On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits

DOI10.1007/978-3-319-17470-9_4zbMath1336.94043OpenAlexW1161473062MaRDI QIDQ2947522

Ning Ding

Publication date: 24 September 2015

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-17470-9_4

zbMATH Keywords

zero knowledgeargument of knowledgediffering-input obfuscation for circuits

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on constant-round zero-knowledge proofs of knowledge
• Minimum disclosure proofs of knowledge
• Zero-knowledge proofs of identity
• Advances in cryptology -- CRYPTO 2004. 24th annual international cryptology conference, Santa Barbara, California, USA, August 15--19, 2004. Proceedings.
• How to construct constant-round zero-knowledge proof systems for NP
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
• Obfuscation-Based Non-Black-Box Extraction and Constant-Round Zero-Knowledge Arguments of Knowledge
• Strict polynomial-time in simulation and extraction
• Universal Arguments and their Applications
• The Knowledge Complexity of Interactive Proof Systems
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Software protection and simulation on oblivious RAMs
• On the Composition of Zero-Knowledge Proof Systems
• Fully homomorphic encryption using ideal lattices
• Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
• Public-Coin Differing-Inputs Obfuscation and Its Applications
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Recursive composition and bootstrapping for SNARKS and proof-carrying data

This page was built for publication: On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits