Non-black-box simulation from one-way functions and applications to resettable security
From MaRDI portal
Publication:2802147
DOI10.1137/130946083zbMATH Open1384.94045OpenAlexW2338446747MaRDI QIDQ2802147FDOQ2802147
Rafael Pass, Kai-Min Chung, Karn Seth
Publication date: 25 April 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130946083
Recommendations
- Non-black-box simulation from one-way functions and applications to resettable security
- Towards non-black-box separations of public key encryption and one way function
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the achievability of simulation-based security for functional encryption
- Non-interactive secure computation from one-way functions
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Concurrent secure computation via non-black box simulation
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Secure non-interactive simulation: feasibility and rate
- Secure non-interactive simulation from arbitrary joint distributions
Cites Work
- Probabilistic encryption
- A Pseudorandom Generator from any One-way Function
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Bit commitment using pseudorandomness
- How to construct constant-round zero-knowledge proof systems for NP
- Resettable zero-knowledge (extended abstract)
- Title not available (Why is that?)
- Foundations of Cryptography
- Constant-round non-malleable commitments from any one-way function
- Theory of Cryptography
- Definitions and properties of zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
- New and improved constructions of non-malleable cryptographic protocols
- Computationally Sound Proofs
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
- Theory of Cryptography
- On the (im)possibility of obfuscating programs
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Point Obfuscation and 3-Round Zero-Knowledge
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Non-black-box simulation from one-way functions and applications to resettable security
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- On the Composition of Public-Coin Zero-Knowledge Protocols
- On the Composition of Public-Coin Zero-Knowledge Protocols
Cited In (8)
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Resettable statistical zero-knowledge for NP
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Post-quantum resettably-sound zero knowledge
- Pattern matching on encrypted streams
- Non-interactive secure computation from one-way functions
This page was built for publication: Non-black-box simulation from one-way functions and applications to resettable security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802147)
