Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
From MaRDI portal
Recommendations
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Multilinear maps from obfuscation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Multilinear maps from obfuscation
Cites work
- Algebraic attacks against random local functions and their countermeasures
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Computationally private randomizing polynomials and their applications
- Cryptanalysis of the multilinear map over the integers
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- From cryptomania to obfustopia through secret-key functional encryption
- From selective to adaptive security in functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Function-hiding inner product encryption
- Function-private functional encryption in the private-key setting
- Functional encryption for inner product with full function privacy
- Fuzzy Identity-Based Encryption
- Graph-induced multilinear maps from lattices
- Hierarchical Predicate Encryption for Inner-Products
- Homomorphic Encryption and Signatures from Vector Decomposition
- How to obfuscate programs directly
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation: from approximate to exact
- Multi-input functional encryption
- Obfuscating circuits via composite-order graded encoding
- On Removing Graded Encodings from Functional Encryption
- On the achievability of simulation-based security for functional encryption
- On the practical security of inner product functional encryption
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Practical multilinear maps over the integers
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Secure Obfuscation in a Weak Multilinear Map Model
- Simple functional encryption schemes for inner products
- The Knowledge Complexity of Interactive Proof Systems
- Time-lock puzzles from randomized encodings
- Two-round secure MPC from indistinguishability obfuscation
- Watermarking cryptographic capabilities
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(48)- FE and iO for Turing machines from minimal assumptions
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- 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
- Amplifying the security of functional encryption, unconditionally
- 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
- Constrained pseudorandom functions from functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Inner-product functional encryption with fine-grained access control
- A new paradigm for public-key functional encryption for degree-2 polynomials
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Lattice-based SNARGs and their application to more efficient obfuscation
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- On Removing Graded Encodings from Functional Encryption
- One-Way Functions and (Im)perfect Obfuscation
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
- 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
- Candidate iO from homomorphic encryption schemes
- 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
- Two-round concurrent 2PC from sub-exponential LWE
- Registered (inner-product) functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Lower bounds for lattice-based compact functional encryption
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Simulation secure multi-input quadratic functional encryption: applications to differential privacy
- Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
- Dynamic decentralized functional encryption: generic constructions with strong security
- Simulation secure multi-input quadratic functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- Obfuscating pseudorandom functions is post-quantum complete
- Indistinguishability obfuscation from ring key-homomorphic weak PRFs
This page was built for publication: Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738874)
