Constant-round concurrent zero-knowledge from indistinguishability obfuscation

DOI10.1007/978-3-662-47989-6_14MaRDI QIDQ3457115zbMATH OpenOpenAlexFDO

Authors Kai-Min Chung, Huijia Lin, Rafael Pass

Publication date 10 December 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-662-47989-6_14

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Automata, Languages and Programming
• On Constant-Round Concurrent Zero-Knowledge
• On constant-round concurrent zero-knowledge from a knowledge assumption
• Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
• Theory of Cryptography

Cites work

• 4-round resettably-sound zero knowledge
• Computationally Sound Proofs
• Concurrent zero knowledge, revisited
• Concurrent zero-knowledge
• On extractability obfuscation
• Private coins versus public coins in zero-knowledge proof systems
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Public-coin parallel zero-knowledge for NP
• The Knowledge Complexity of Interactive Proof Systems
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
• Universal Arguments and their Applications

Cited in

(25)

• Succinct garbling schemes from functional encryption through a local simulation paradigm
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
• On the concurrent composition of quantum zero-knowledge
• Constant-round leakage-resilient zero-knowledge from collision resistance
• Simpler constructions of asymmetric primitives from obfuscation
• Random walks and concurrent zero-knowledge
• On constructing one-way permutations from indistinguishability obfuscation
• Non-black-box simulation in the fully concurrent setting, revisited
• Individual simulations
• On constructing one-way permutations from indistinguishability obfuscation
• On constant-round concurrent zero-knowledge from a knowledge assumption
• 3-message zero knowledge against human ignorance
• Compactness vs collusion resistance in functional encryption
• Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
• On Constant-Round Concurrent Zero-Knowledge
• Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
• Magic adversaries versus individual reduction: science wins either way
• Constant-round leakage-resilient zero-knowledge from collision resistance
• Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
• How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
• Indistinguishability obfuscation from bilinear maps and LPN variants
• Indistinguishability obfuscation from well-founded assumptions
• A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
• Four-round statistical non-malleable zero-knowledge
• Lower bounds on the overhead of indistinguishability obfuscation

This page was built for publication: Constant-round concurrent zero-knowledge from indistinguishability obfuscation

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