Weak zero-knowledge beyond the black-box barrier

DOI10.1145/3313276.3316382MaRDI QIDQ5212849zbMATH OpenOpenAlexFDO

Authors Nir Bitansky, Dakshita Khurana, Omer Paneth

Publication date 30 January 2020

Published in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3313276.3316382

zbMATH Keywords

homomorphic trapdoornon black-box simulationwitness hidingzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• From weak to strong zero-knowledge and applications
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• scientific article; zbMATH DE number 1302862
• Lower bounds for non-black-box zero knowledge
• On the existence of three round zero-knowledge proofs

Cited in

(24)

• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Post-quantum multi-party computation
• Secure software leasing
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Individual simulations
• Post-quantum resettably-sound zero knowledge
• The round complexity of quantum zero-knowledge
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• Point obfuscation and 3-round zero-knowledge
• Weak Zero-Knowledge beyond the Black-Box Barrier
• From weak to strong zero-knowledge and applications
• A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols
• Theory of Cryptography
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Statistically sender-private OT from LPN and derandomization
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• Weak zero-knowledge via the Goldreich-Levin theorem
• Witness semantic security
• The round complexity of black-box post-quantum secure computation
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• On quantum money and evasive obfuscation
• Quantum black-box separations: succinct non-interactive arguments from falsifiable assumptions

This page was built for publication: Weak zero-knowledge beyond the black-box barrier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212849)