Memorizable interactive proof and zero-knowledge proof systems

Authors:
Ning Chen;Jia-Wei Rong
Affiliations:
Department of Computer Science, Fudan University, Shanghai 200433, P.R. China;Department of Computer Science, Fudan University, Shanghai 200433, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 7
Cited 0

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness

Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
An attack-finding algorithm for security protocols

Journal of Computer Science and Technology
Multiparty authentication services and key agreement protocols with semi-trusted third party

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality.