Deniable Authentication on the Internet

Authors:
Shaoquan Jiang
Affiliations:
Center for Information Security and Cryptography, University of Calgary,
Venue:
Information Security and Cryptology
Year:
2007

Citing 23
Cited 2

Subliminal-free authentication and signature

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Entity authentication and key distribution

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Concurrent Zero Knowledge with Logarithmic Round-Complexity

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Deniable Ring Authentication

CRYPTO '02 Proceedings of the 22nd 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
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Zaps and their applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
SKEME: a versatile secure key exchange mechanism for Internet

SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
New approaches for deniable authentication

Proceedings of the 12th ACM conference on Computer and communications security
Lower Bounds and Impossibility Results for Concurrent Self Composition

Journal of Cryptology
On the concurrent composition of zero-knowledge proofs

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient and non-malleable proofs of plaintext knowledge and applications

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
The cramer-shoup encryption scheme is plaintext aware in the standard model

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Perfect non-interactive zero knowledge for NP

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient authenticators with application to key exchange

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology

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

Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Timed encryption with application to deniable key exchange

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, we formalize a natural notion of deniable security and naturally extend the basic authenticator theorem by Bellare et al. [1] to the setting of deniable authentication. Of independent interest, this extension is achieved by defining a deniable MT-authenticator via a game. This game is essentially borrowed from the notion of universal composition [6] although we do not assume any result or background about it. Then we construct a 3-round deniable MT-authenticator. Finally, as our application, we obtain a key exchange protocol that is deniably secure in the real world.