A note on the Dwork-Naor timed deniable authentication

Authors:
Yunlei Zhao
Affiliations:
Software School, School of Information Science and Engineering, Fudan University, Shanghai, China
Venue:
Information Processing Letters
Year:
2006

Citing 12
Cited 1

Subliminal-free authentication and signature

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
2-round zero knowledge and proof auditors

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Concurrent zero-knowledge with timing, revisited

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Pricing via Processing or Combatting Junk Mail

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Undeniable Signatures

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Zaps and their applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Simulation in quasi-polynomial time, and its application to protocol composition

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Dwork-Naor ZAP and its application in deniable authentication, revisited

Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we present an improved Dwork-Naor 2-round timed deniable authentication scheme with reduced computational and communication complexity. The improved protocol is convenient for authenticating arbitrarily large files (e.g., the contents of a large data-base or a large software), and its first message (from the verifier to the authenticator) is independent on the message to be authenticated by the authenticator.