20 search results - page 3 / 4 » On Deniability in the Common Reference String and Random Ora... |
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
TCC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
CCS
2010
ACM
13 years 6 months ago
2010
ACM
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...