Adaptive simulation security for inner product functional encryption
From MaRDI portal
Recommendations
- Efficient inner product encryption with simulation-based security
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Unbounded inner product functional encryption from bilinear maps
- Tightly CCA-secure inner product functional encryption scheme
- Fully secure functional encryption for inner products, from standard assumptions
Cites work
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Adaptively simulation-secure attribute-hiding predicate encryption
- Attribute-based encryption for circuits
- Attribute-hiding predicate encryption in bilinear groups, revisited
- CCA-secure inner-product functional encryption from projective hash functions
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Classical hardness of learning with errors
- Decentralized multi-client functional encryption for inner product
- Dual System Encryption via Predicate Encodings
- Efficient functional encryption for inner-product values with full-hiding security
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption for inner products, from standard assumptions
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Function-hiding inner product encryption
- Functional encryption for bounded collusions, revisited
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for inner product with full function privacy
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Hierarchical Predicate Encryption for Inner-Products
- Identity-Based Encryption from the Weil Pairing
- Identity-based cryptosystems and signature schemes
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Kangaroos, monopoly and discrete logarithms
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input inner-product functional encryption from pairings
- On lattices, learning with errors, random linear codes, and cryptography
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption for circuits from LWE
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Reusable garbled circuits and succinct functional encryption
- Simple functional encryption schemes for inner products
- Stronger security for reusable garbled circuits, general definitions and attacks
- Unbounded inner product functional encryption from bilinear maps
Cited in
(29)- Functional encryption against probabilistic queries: definition, construction and applications
- Dynamic decentralized functional encryptions from pairings in the standard model
- Predicate encryption from lattices: enhanced compactness and refined functionality
- Tight adaptive simulation security for identity-based inner-product FE in the (quantum) random oracle model
- On the black-box complexity of private-key inner-product functional encryption
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- More efficient verifiable functional encryption
- On the achievability of simulation-based security for functional encryption
- Fine-grained polynomial functional encryption
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- A survey on functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Securing data in the cloud using pairing-free inner product functional encryption with unbounded vector size
- Improved unbounded inner-product functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Efficient identity-based inner product functional encryption from RLWE
- Simple and efficient FE for quadratic functions
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Lower bounds for lattice-based compact functional encryption
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Bounded-collusion decentralized ABE with sublinear parameters
- Hierarchical functional encryption for quadratic transformation
- Verifiable functional encryption using Intel SGX
- Efficient inner product encryption with simulation-based security
This page was built for publication: Adaptive simulation security for inner product functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041151)
