Constant-round adaptive zero-knowledge proofs for NP

DOI10.1016/j.ins.2013.07.037zbMath1347.68189OpenAlexW1967524496MaRDI QIDQ903613

Haojin Zhu, Zong-yang Zhang, Zhen Fu Cao

Publication date: 14 January 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.07.037

zbMATH Keywords

proofs of knowledgetrapdoor commitmentsadaptive zero-knowledge proofinstance-dependent commitments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on constant-round zero-knowledge proofs of knowledge
• Concurrent non-malleable statistically hiding commitment
• New receipt-free voting scheme using double-trapdoor commitment
• Practical electronic auction scheme with strong anonymity and bidding privacy
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• A language-dependent cryptographic primitive
• Bit commitment using pseudorandomness
• A proof of security of Yao's protocol for two-party computation
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• How to construct constant-round zero-knowledge proof systems for NP
• On constant-round concurrent non-malleable proof systems
• Security and composition of multiparty cryptographic protocols
• Black-box constructions for secure computation
• Adaptively secure broadcast, revisited
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Security of blind signatures under aborts and applications to adaptive oblivious transfer
• Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Universally composable two-party and multi-party secure computation
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Adaptively Secure Two-Party Computation with Erasures
• Foundations of Cryptography
• Foundations of Cryptography
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
• Advances in Cryptology – CRYPTO 2004
• Theory of Cryptography