Concurrent non-malleable zero knowledge with adaptive inputs

Authors:
Huijia Lin;Rafael Pass
Affiliations:
Cornell University;Cornell University
Venue:
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Year:
2011

Citing 21
Cited 0

Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Nonmalleable Cryptography

SIAM Journal on Computing
Concurrent Zero Knowledge with Logarithmic Round-Complexity

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Bounded-concurrent secure two-party computation without setup assumptions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Concurrent zero-knowledge

Journal of the ACM (JACM)
New and improved constructions of non-malleable cryptographic protocols

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Concurrent Non-Malleable Zero Knowledge

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Non-malleability amplification

Proceedings of the forty-first annual ACM symposium on Theory of computing
On the limitations of universally composable two-party computation without set-up assumptions

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Concurrent non-malleable commitments from any one-way function

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Concurrent non-malleable zero knowledge proofs

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficiency preserving transformations for concurrent non-malleable zero knowledge

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Concurrent zero knowledge without complexity assumptions

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. We provide the first construction of a CNMZK protocol that, without any trusted set-up, remains secure even if the attacker may adaptively select the statements to receive proofs of; previous works only handle scenarios where the statements are fixed at the beginning of the execution, or chosen adaptively from a restricted set of statements.