Perfect Structure on the Edge of Chaos

DOI10.1007/978-3-662-49096-9_20zbMath1382.94070OpenAlexW2293639154MaRDI QIDQ2796138

Nir Bitansky, Daniel Wichs, Omer Paneth

Publication date: 23 March 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (23)

Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Certifying trapdoor permutations, revisited ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ 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? ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Obfustopia built on secret-key functional encryption ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Bounded KDM Security from iO and OWF ⋮ Fully deniable interactive encryption ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Hiding cliques for cryptographic security
• Constructing pseudo-random permutations with a prescribed structure
• Enhancements of trapdoor permutations
• Indistinguishability Obfuscation: From Approximate to Exact
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Practical Multilinear Maps over the Integers
• Constrained Pseudorandom Functions and Their Applications
• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
• Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
• How to Obfuscate Programs Directly
• Candidate One-Way Functions Based on Expander Graphs
• New Multilinear Maps Over the Integers
• Indistinguishability Obfuscation from Compact Functional Encryption
• Lossy trapdoor functions and their applications
• A method for obtaining digital signatures and public-key cryptosystems
• A Pseudorandom Generator from any One-way Function
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Candidate Multilinear Maps from Ideal Lattices
• How to use indistinguishability obfuscation
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• Obfuscation of Probabilistic Circuits and Applications
• Obfuscating Circuits via Composite-Order Graded Encoding
• Functional Signatures and Pseudorandom Functions
• Key Derivation without Entropy Waste
• Protecting Obfuscation against Algebraic Attacks
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• On Extractability Obfuscation

This page was built for publication: Perfect Structure on the Edge of Chaos