Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
On Concurrent Zero-Knowledge with Pre-processing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Zero Knowledge Proofs of Knowledge in Two Rounds
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Complexity of Constant Round ZKIP of Possession of Knowledge
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
How to Go Beyond the Black-Box Simulation Barrier
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Black-Box Constructions of Two-Party Protocols from One-Way Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A Proof of Security of Yao’s Protocol for Two-Party Computation
Journal of Cryptology
Adaptively Secure Two-Party Computation with Erasures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
SIAM Journal on Computing
New receipt-free voting scheme using double-trapdoor commitment
Information Sciences: an International Journal
Practical electronic auction scheme with strong anonymity and bidding privacy
Information Sciences: an International Journal
Adaptively secure broadcast, revisited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Highly-efficient universally-composable commitments based on the DDH assumption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On constant-round concurrent non-malleable proof systems
Information Processing Letters
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
Journal of Cryptology
Constant-Round concurrent non-malleable statistically binding commitments and decommitments
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Concurrent non-malleable statistically hiding commitment
Information Processing Letters
Non-interactive and re-usable universally composable string commitments with adaptive security
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Constructing Non-malleable Commitments: A Black-Box Approach
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.07 |
Secure two-party computation allows two parties with private inputs to securely compute some function of their inputs, even in the presence of a malicious adversary. In this work, we revisit zero-knowledge proofs and focus on adaptive adversaries, which could corrupt an arbitrary number of parties and adaptively determine who and when to corrupt during the computation phase. Previous constructions could realize adaptive zero-knowledge proofs for all languages in NP (Lindell and Zarosim TCC'09) at the cost of a high round-complexity, i.e., super-constant number of rounds. In this work, assuming the existence of constant-round statistically hiding commitment schemes, we build efficient adaptive zero-knowledge proofs for all languages in NP, which only require constant number of communication rounds. The system is also a proof of knowledge. The construction relies on an adaptive instance-dependent commitment scheme, and the proof of security requires only the use of black-box techniques and is presented according to the real/ideal simulation paradigm.