Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
From MaRDI portal
Publication:5738874
DOI10.1007/978-3-319-56620-7_6zbMath1411.94046MaRDI QIDQ5738874
Amit Sahai, Prabhanjan V. Ananth
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items (34)
One-Way Functions and (Im)perfect Obfuscation ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Multilinear maps from obfuscation ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the security of functional encryption in the generic group model ⋮ Multi-client functional encryption with fine-grained access control ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ A survey on functional encryption ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Streaming functional encryption ⋮ Indistinguishability obfuscation ⋮ Inner-product functional encryption with fine-grained access control ⋮ On the complexity of compressing obfuscation ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ Simple and efficient FE for quadratic functions ⋮ Candidate iO from homomorphic encryption schemes ⋮ Combiners for functional encryption, unconditionally ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
Cites Work
- Unnamed Item
- Unnamed Item
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Computationally private randomizing polynomials and their applications
- Indistinguishability Obfuscation: From Approximate to Exact
- Functional Encryption for Inner Product with Full Function Privacy
- Time-Lock Puzzles from Randomized Encodings
- Function-Hiding Inner Product Encryption
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- On the Achievability of Simulation-Based Security for Functional Encryption
- Simple Functional Encryption Schemes for Inner Products
- On the Practical Security of Inner Product Functional Encryption
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- Secure Obfuscation in a Weak Multilinear Map Model
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- From Selective to Adaptive Security in Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Homomorphic Encryption and Signatures from Vector Decomposition
- Hierarchical Predicate Encryption for Inner-Products
- The Knowledge Complexity of Interactive Proof Systems
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- Function-Private Functional Encryption in the Private-Key Setting
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Obfuscating Circuits via Composite-Order Graded Encoding
- Algebraic attacks against random local functions and their countermeasures
- Watermarking cryptographic capabilities
- Fuzzy Identity-Based Encryption
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- On Removing Graded Encodings from Functional Encryption
- Two-Round Secure MPC from Indistinguishability Obfuscation
This page was built for publication: Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
