Breaking the Sub-Exponential Barrier in Obfustopia

From MaRDI portal
Publication:5270361

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




Related Items (29)

One-Way Functions and (Im)perfect ObfuscationThe Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iODeniable fully homomorphic encryption from learning with errorsA simple construction of iO for Turing machinesSuccinct garbling schemes from functional encryption through a local simulation paradigmFE and iO for Turing machines from minimal assumptionsFrom Cryptomania to Obfustopia Through Secret-Key Functional EncryptionSingle-Key to Multi-Key Functional Encryption with Polynomial LossDistributed (correlation) samplers: how to remove a trusted dealer in one roundFrom cryptomania to obfustopia through secret-key functional encryptionFrom FE combiners to secure MPC and backMultiparty noninteractive key exchange from ring key-homomorphic weak PRFsBroadcast, trace and revoke with optimal parameters from polynomial hardnessLaconic function evaluation for Turing machinesMultiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscationHow to Generate and Use Universal SamplersAdaptive multiparty NIKEConstrained (Verifiable) Pseudorandom Function from Functional EncryptionStreaming functional encryptionRobust Transforming Combiners from Indistinguishability Obfuscation to Functional EncryptionDecomposable obfuscation: a framework for building applications of obfuscation from polynomial hardnessObfustopia built on secret-key functional encryptionConstrained pseudorandom functions from functional encryptionMinicrypt primitives with algebraic structure and applicationsCombiners for functional encryption, unconditionallyRevisiting the Cryptographic Hardness of Finding a Nash EquilibriumAmplifying the security of functional encryption, unconditionallyThe Complexity of Public-Key CryptographyBreaking the Sub-Exponential Barrier in Obfustopia



Cites Work


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