Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge
From MaRDI portal
Publication:3454578
DOI10.1007/978-3-319-16745-9_8zbMath1400.94141OpenAlexW279360380MaRDI QIDQ3454578
Publication date: 25 November 2015
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_8
Cites Work
- Unnamed Item
- Unnamed Item
- A note on constant-round zero-knowledge proofs of knowledge
- Minimum disclosure proofs of knowledge
- Zero-knowledge proofs of identity
- Definitions and properties of zero-knowledge proof systems
- How to construct constant-round zero-knowledge proof systems for NP
- Lower bounds for non-black-box zero knowledge
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Strict polynomial-time in simulation and extraction
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- A Pseudorandom Generator from any One-way Function
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
- Zaps and Their Applications
- Which Languages Have 4-Round Zero-Knowledge Proofs?
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
This page was built for publication: Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge
