Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP

DOI10.1007/978-3-662-46497-7_25zbMath1382.94151OpenAlexW2292141629MaRDI QIDQ5261694

Manoj Prabhakaran, Amit Sahai, Omkant Pandey

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

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

Related Items (12)

One-Way Functions and (Im)perfect Obfuscation ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Random walks and concurrent zero-knowledge ⋮ On the obfuscatability of quantum point functions ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits

This page was built for publication: Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP