64 search results - page 8 / 13 » Proxy Cryptography Revisited |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The security of cascade blockcipher encryption is an important and well-studied problem in theoretical cryptography with practical implications. It is well-known that dou...
PAIRING
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
PKC
2005
Springer
14 years 1 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
EUROCRYPT
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...