242 search results - page 16 / 49 » Randomness in Cryptography |
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
117
click to vote
CISC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
ACNS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...