Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits
From MaRDI portal
Publication:2817870
DOI10.1007/978-3-319-42634-1_23zbMath1394.94930OpenAlexW2495736462MaRDI QIDQ2817870
Yanli Ren, Ning Ding, Da-Wu Gu
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_23
Cites Work
- Unnamed Item
- A note on constant-round zero-knowledge proofs of knowledge
- Minimum disclosure proofs of knowledge
- How to construct constant-round zero-knowledge proof systems for NP
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits
- Obfuscation-Based Non-Black-Box Extraction and Constant-Round Zero-Knowledge Arguments of Knowledge
- Fully Homomorphic Encryption over the Integers
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
- Public-Coin Differing-Inputs Obfuscation and Its Applications
