3-message zero knowledge against human ignorance

DOI10.1007/978-3-662-53641-4_3MaRDI QIDQ3179352zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On round optimal statistical zero knowledge arguments
• 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
• Theory of Cryptography
• scientific article; zbMATH DE number 1302862
• Multi-collision resistance: a paradigm for keyless hash functions

Cites work

• \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
• 4-round resettably-sound zero knowledge
• A Framework for Efficient and Composable Oblivious Transfer
• Advances in Cryptology – CRYPTO 2004
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Definitions and properties of zero-knowledge proof systems
• Delegating RAM Computations
• Efficient oblivious transfer protocols
• Formalizing human ignorance
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• How to delegate computations
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
• Memory delegation
• Minimum disclosure proofs of knowledge
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• On lattices, learning with errors, random linear codes, and cryptography
• On non-black-box simulation and the impossibility of approximate obfuscation
• On the Composition of Zero-Knowledge Proof Systems
• On the existence of extractable one-way functions
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• On the Power of Secure Two-Party Computation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Smooth projective hashing and two-message oblivious transfer
• The hunting of the SNARK
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Towards a Theory of Extractable Functions
• Universal Arguments and their Applications
• Universally Composable Security with Global Setup
• Which languages have 4-round zero-knowledge proofs?
• Zero-knowledge proofs from secure multiparty computation

Cited in

(7)

• Witness indistinguishability for any single-round argument with applications to access control
• Round-optimal black-box commit-and-prove with succinct communication
• On round optimal statistical zero knowledge arguments
• Weak Zero-Knowledge beyond the Black-Box Barrier
• 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
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash

This page was built for publication: 3-message zero knowledge against human ignorance

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