Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP

DOI10.1007/978-3-662-46497-7_25MaRDI QIDQ5261694zbMATH OpenOpenAlexFDO

Authors Omkant Pandey, Manoj Prabhakaran, Amit Sahai

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46497-7_25

zbMATH Keywords

polynomial time Turing machinesfour message, fully concurrent zero-knowledge proof systempublic-coin differing-input obfuscation (pc-diO)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
• Non-black-box simulation in the fully concurrent setting, revisited
• Non-black-box simulation in the fully concurrent setting
• An alternative approach to non-black-box simulation in fully concurrent setting
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation

Cited in

(18)

• Point obfuscation and 3-round zero-knowledge
• Random walks and concurrent zero-knowledge
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Non-black-box simulation in the fully concurrent setting
• Simpler constructions of asymmetric primitives from obfuscation
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• An alternative approach to non-black-box simulation in fully concurrent setting
• Magic adversaries versus individual reduction: science wins either way
• Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
• On non-black-box simulation and the impossibility of approximate obfuscation
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
• scientific article; zbMATH DE number 5568627 (Why is no real title available?)
• Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
• One-Way Functions and (Im)perfect Obfuscation
• On the obfuscatability of quantum point functions
• Non-black-box simulation in the fully concurrent setting, revisited

This page was built for publication: Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP

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