Non-black-box simulation from one-way functions and applications to resettable security
From MaRDI portal
Publication:2802147
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
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Bit commitment using pseudorandomness
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Computationally Sound Proofs
- Constant-round non-malleable commitments from any one-way function
- Definitions and properties of zero-knowledge proof systems
- Foundations of Cryptography
- How to construct constant-round zero-knowledge proof systems for NP
- New and improved constructions of non-malleable cryptographic protocols
- Non-black-box simulation from one-way functions and applications to resettable security
- On the (im)possibility of obfuscating programs
- On the Composition of Public-Coin Zero-Knowledge Protocols
- On the composition of public-coin zero-knowledge protocols
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Point obfuscation and 3-round zero-knowledge
- Probabilistic encryption
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Resettable zero-knowledge (extended abstract)
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of Cryptography
Cited in
(11)- Weak Zero-Knowledge beyond the Black-Box Barrier
- Resettable statistical zero-knowledge for NP
- Non-black-box simulation from one-way functions and applications to resettable security
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Pattern matching on encrypted streams
- On non-black-box simulation and the impossibility of approximate obfuscation
- Non-interactive secure computation from one-way functions
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
- Post-quantum resettably-sound zero knowledge
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)
