Breaking the Sub-Exponential Barrier in Obfustopia

DOI10.1007/978-3-319-56617-7_6zbMath1394.94932OpenAlexW2614048269MaRDI QIDQ5270361

Omkant Pandey, Mark Zhandry, Sanjam Garg, Akshayaram Srinivasan

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (29)

One-Way Functions and (Im)perfect Obfuscation ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Laconic function evaluation for Turing machines ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ How to Generate and Use Universal Samplers ⋮ Adaptive multiparty NIKE ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ Streaming functional encryption ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Obfustopia built on secret-key functional encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Combiners for functional encryption, unconditionally ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ Amplifying the security of functional encryption, unconditionally ⋮ The Complexity of Public-Key Cryptography ⋮ Breaking the Sub-Exponential Barrier in Obfustopia

Cites Work

• Unnamed Item
• Unnamed Item
• Indistinguishability Obfuscation: From Approximate to Exact
• Functional Encryption for Turing Machines
• Perfect Structure on the Edge of Chaos
• Cryptographic Assumptions: A Position Paper
• Functional Encryption Without Obfuscation
• Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• Practical Multilinear Maps over the Integers
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
• How to Generate and Use Universal Samplers
• On the Communication Complexity of Secure Function Evaluation with Long Output
• From Selective to Adaptive Security in Functional Encryption
• Indistinguishability Obfuscation from Compact Functional Encryption
• Time/Space Trade-Offs for Reversible Computation
• Candidate Multilinear Maps from Ideal Lattices
• How to use indistinguishability obfuscation
• Breaking the Sub-Exponential Barrier in Obfustopia
• On the (im)possibility of obfuscating programs
• Advances in Cryptology - CRYPTO 2003
• Witness encryption and its applications

This page was built for publication: Breaking the Sub-Exponential Barrier in Obfustopia