On constant-round concurrent non-malleable proof systems
Highlights
► Construction of constant-round one–many CNMZK proofs for in the plain model. ► Construction of constant-round CNMWI proofs for in the plain model. ► Constant-round proofs in the plain model secure against concurrent MiM attacks.
References (28)
- et al.
Hybrid commitments and their applications to zero-knowledge proof systems
Theoret. Comput. Sci.
(2007) - et al.
The knowledge complexity of interactive proof systems
SIAM J. Comput.
(1989) - et al.
Nonmalleable cryptography
SIAM J. Comput.
(2000) - et al.
Concurrent zero-knowledge
- et al.
Concurrent non-malleable zero knowledge
- et al.
Efficiency preserving transformations for concurrent non-malleable zero knowledge
- et al.
Concurrent non-malleable zero knowledge proofs
How to go beyond the black-box simulation barrier
- et al.
Concurrent zero knowledge with logarithmic round-complexity
- et al.
Robust non-interactive zero knowledge
Universally composable commitments
Strengthening zero-knowledge protocols using signatures
J. Cryptology
(2006)
Universally composable protocols with relaxed set-up assumptions
Universally composable security with global setup
Cited by (5)
Constant-round adaptive zero-knowledge proofs for NP
2014, Information SciencesCitation Excerpt :Lindell and Zarosim [36] first constructed a super-constant round adaptive zero-knowledge proof for NP assuming the existence of non-uniform one-way functions. Zero-knowledge protocols, which is one of the most important cryptographic primitives, also have many applications in other cryptographic protocols, such as non-malleable commitment scheme [8,9,24,44], e-voting [10], auction [31] and so on. Organization.
New trends of information security —how to change people’s life style?
2016, Science China Information SciencesConcurrent non-malleable commitments (and more) in 3 rounds
2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)On input indistinguishable proof systems
2014, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Constructing non-malleable commitments: A black-box approach
2012, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Copyright © 2011 Elsevier B.V. All rights reserved.