51 search results - page 6 / 11 » The Random Oracle Model and the Ideal Cipher Model Are Equiv... |
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
ENTCS
2006
13 years 8 months ago
2006
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
TCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...