3-Message Zero Knowledge Against Human Ignorance

DOI10.1007/978-3-662-53641-4_3zbMath1351.94027OpenAlexW2537051845MaRDI QIDQ3179352

Zvika Brakerski, Omer Paneth, Vinod Vaikuntanathan, Yael Kalai, Nir Bitansky

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/111007

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

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 ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Round-optimal black-box commit-and-prove with succinct communication ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Which languages have 4-round zero-knowledge proofs?
• Minimum disclosure proofs of knowledge
• Definitions and properties of zero-knowledge proof systems
• The hunting of the SNARK
• How to construct constant-round zero-knowledge proof systems for NP
• On the Power of Secure Two-Party Computation
• Formalizing Human Ignorance
• Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
• Delegating RAM Computations
• On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
• Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
• Zero-Knowledge Proofs from Secure Multiparty Computation
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Universally Composable Security with Global Setup
• A Framework for Efficient and Composable Oblivious Transfer
• Towards a Theory of Extractable Functions
• Universal Arguments and their Applications
• The Knowledge Complexity of Interactive Proof Systems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Memory Delegation
• How to delegate computations
• On the existence of extractable one-way functions
• Advances in Cryptology – CRYPTO 2004
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• 4-Round Resettably-Sound Zero Knowledge
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: 3-Message Zero Knowledge Against Human Ignorance