Secure Obfuscation in a Weak Multilinear Map Model

DOI10.1007/978-3-662-53644-5_10zbMath1397.94064OpenAlexW2532623575MaRDI QIDQ3181029

Amit Sahai, Akshayaram Srinivasan, Pratyay Mukherjee, Eric Miles, Mark Zhandry, Sanjam Garg

Publication date: 22 December 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

One-Way Functions and (Im)perfect Obfuscation ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ Witness encryption and null-iO from evasive LWE ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ Constraining Pseudorandom Functions Privately ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators

Cites Work

• Unnamed Item
• Time-Lock Puzzles from Randomized Encodings
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Cryptanalysis of GGH Map
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
• Practical Multilinear Maps over the Integers
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• Bootstrapping Obfuscators via Fast Pseudorandom Functions
• Cryptanalysis of the Multilinear Map over the Integers
• Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
• Secure Obfuscation in a Weak Multilinear Map Model
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• New Multilinear Maps Over the Integers
• Candidate Multilinear Maps from Ideal Lattices
• Graph-Induced Multilinear Maps from Lattices
• On the (im)possibility of obfuscating programs
• Protecting Obfuscation against Algebraic Attacks
• Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

This page was built for publication: Secure Obfuscation in a Weak Multilinear Map Model