On Constructing One-Way Permutations from Indistinguishability Obfuscation

DOI10.1007/978-3-662-49099-0_19zbMath1382.94051MaRDI QIDQ2799107

Publication date: 8 April 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_19

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

The Journey from NP to TFNP Hardness, Structure Versus Hardness Through the Obfuscation Lens, On the complexity of compressing obfuscation, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Can PPAD hardness be based on standard cryptographic assumptions?, Fine-grained cryptography revisited, On Constructing One-Way Permutations from Indistinguishability Obfuscation

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
The impossibility of basing one-way permutations on central cryptographic primitives
Indistinguishability Obfuscation: From Approximate to Exact
Perfect Structure on the Edge of Chaos
On Constructing One-Way Permutations from Indistinguishability Obfuscation
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
Notions of Black-Box Reductions, Revisited
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
On Virtual Grey Box Obfuscation for General Circuits
The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
On the power of nonuniformity in proofs of security
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Towards Non-Black-Box Lower Bounds in Cryptography
On Black-Box Separations among Injective One-Way Functions
The Dual BKR Inequality and Rudich's Conjecture
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
From Selective to Adaptive Security in Functional Encryption
A Punctured Programming Approach to Adaptively Secure Functional Encryption
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
Indistinguishability Obfuscation from Compact Functional Encryption
Towards a Separation of Semantic and CCA Security for Public Key Encryption
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
A method for obtaining digital signatures and public-key cryptosystems
A Pseudorandom Generator from any One-way Function
Foundations of Cryptography
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
How to use indistinguishability obfuscation
On Basing Size-Verifiable One-Way Functions on NP-Hardness
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
Random-Oracle Uninstantiability from Indistinguishability Obfuscation
On Obfuscation with Random Oracles
Obfuscation of Probabilistic Circuits and Applications
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
Advances in Cryptology – CRYPTO 2004
On the (im)possibility of obfuscating programs
Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
Multi-input Functional Encryption
Bounds on the Efficiency of Generic Cryptographic Constructions
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
Two-Round Secure MPC from Indistinguishability Obfuscation
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
On the Power of Public-Key Encryption in Secure Computation
On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
Theory of Cryptography