1562 search results - page 78 / 313 » Mathematics, Cryptology, Security |
ASIACRYPT
2000
Springer
14 years 15 days ago
2000
Springer
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
ASIACRYPT
2006
Springer
13 years 12 months ago
2006
Springer
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
CRYPTO
2006
Springer
13 years 12 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
PAIRING
2010
Springer
13 years 6 months ago
2010
Springer
Lewko and Waters [Eurocrypt 2010] presented a fully secure HIBE with short ciphertexts. In this paper we show how to modify their construction to achieve anonymity. We prove the s...