On constructing one-way permutations from indistinguishability obfuscation
From MaRDI portal
Publication:2413613
DOI10.1007/S00145-017-9268-6zbMATH Open1400.94112OpenAlexW2755430954MaRDI QIDQ2413613FDOQ2413613
Authors: Gilad Asharov, Gil Segev 
Publication date: 14 September 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9268-6
Recommendations
- On constructing one-way permutations from indistinguishability obfuscation
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- One-Way Functions and (Im)perfect Obfuscation
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- Limits on the power of indistinguishability obfuscation and functional encryption
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- A Pseudorandom Generator from any One-way Function
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Foundations of Cryptography
- Title not available (Why is that?)
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- Title not available (Why is that?)
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Can optimally-fair coin tossing be based on one-way functions?
- Theory of Cryptography
- Title not available (Why is that?)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- On the power of nonuniformity in proofs of security
- Towards non-black-box lower bounds in cryptography
- How to use indistinguishability obfuscation
- The dual BKR inequality and Rudich's conjecture
- Advances in Cryptology – CRYPTO 2004
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- Random-oracle uninstantiability from indistinguishability obfuscation
- On the (im)possibility of obfuscating programs
- Multi-input functional encryption
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On virtual grey box obfuscation for general circuits
- Obfuscation of probabilistic circuits and applications
- Indistinguishability obfuscation from compact functional encryption
- A punctured programming approach to adaptively secure functional encryption
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Notions of black-box reductions, revisited
- On black-box separations among injective one-way functions
- Limits on the power of indistinguishability obfuscation and functional encryption
- From selective to adaptive security in functional encryption
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- On basing size-verifiable one-way functions on NP-hardness
- On obfuscation with random oracles
- Two-round secure MPC from indistinguishability obfuscation
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- The impossibility of obfuscation with auxiliary input or a universal simulator
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- On the power of public-key encryption in secure computation
- The impossibility of basing one-way permutations on central cryptographic primitives
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
Cited In (7)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- On constructing one-way permutations from indistinguishability obfuscation
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
- Adaptive security in SNARGs via iO and lossy functions
- One-Way Functions and (Im)perfect Obfuscation
- Title not available (Why is that?)
This page was built for publication: On constructing one-way permutations from indistinguishability obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413613)
