242 search results - page 28 / 49 » Randomness in Cryptography |
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
SRDS
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper presents a strong security scheme for network-attached storage (NAS) that is based on capability and uses a key distribution scheme to keep network-attached storage fro...
CHES
2003
Springer
15 years 2 months ago
2003
Springer
To protect a cryptographic algorithm against Differential Power Analysis, a general method consists in masking all intermediate data with a random value. When a cryptographic algo...
81
Voted
IJNSEC
2008
14 years 9 months ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
INFORMATICALT
2006
14 years 9 months ago
2006
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...