Fully secure functional encryption for inner products, from standard assumptions
From MaRDI portal
(Redirected from Publication:2829952)
Recommendations
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Simple functional encryption schemes for inner products
- Functional encryption for inner product with full function privacy
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Function-hiding inner product encryption
Cites work
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1088235 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits from multilinear maps
- Bi-deniable public-key encryption
- Bounded-collusion IBE from key homomorphism
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Circular and KDM security for identity-based encryption
- Classical hardness of learning with errors
- Computationally private randomizing polynomials and their applications
- Computing small discrete logarithms faster
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- Efficient selective identity-based encryption without random oracles
- From selective to adaptive security in functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption for inner products, from standard assumptions
- Function-hiding inner product encryption
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for regular languages
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Hardness of \(k\)-LWE and applications in traitor tracing
- How to run Turing machines on encrypted data
- Identity-Based Encryption from the Weil Pairing
- Identity-based cryptosystems and signature schemes
- Kangaroos, monopoly and discrete logarithms
- Lattice signatures and bimodal Gaussians
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the achievability of simulation-based security for functional encryption
- Practical multilinear maps over the integers
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption for circuits from LWE
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Reusable garbled circuits and succinct functional encryption
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Simple functional encryption schemes for inner products
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(only showing first 100 items - show all)- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Efficient inner product encryption with simulation-based security
- Functional encryption for cubic polynomials and implementation
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
- Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
- Dynamic decentralized functional encryption
- Beyond volume pattern: storage-efficient Boolean searchable symmetric encryption with suppressed leakage
- Generic construction of trace-and-revoke inner product functional encryption
- On the security of functional encryption in the generic group model
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Privacy-enhanced and non-interactive linear regression with dropout-resilience
- Multi-client attribute-based unbounded inner product functional encryption, and more
- Dynamic decentralized functional encryptions from pairings in the standard model
- Dynamic decentralized functional encryption: generic constructions with strong security
- Multi-client functional encryption with public inputs and strong security
- 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
- Multi-client attribute-based and predicate encryption from standard assumptions
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Bounded collusion-resistant registered functional encryption for circuits
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Simulation secure multi-input quadratic functional encryption
- More efficient verifiable functional encryption
- (Inner-product) functional encryption with updatable ciphertexts
- Non-zero inner product encryption with short ciphertexts and private keys
- Simple functional encryption schemes for inner products
- Privacy-preserving distributed estimation for interconnected dynamic systems
- Public key encryption with equality test from generic assumptions in the random oracle model
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- On the practical security of inner product functional encryption
- Fully secure functional encryption for inner products, from standard assumptions
- CCA-secure inner-product functional encryption from projective hash functions
- Multi-input inner-product functional encryption from pairings
- Adaptively secure distributed PRFs from LWE
- On the multi-user security of LWE-based NIKE
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Fine-grained polynomial functional encryption
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- A new approach to practical function-private inner product encryption
- A survey on functional encryption
- Collusion resistant traitor tracing from learning with errors
- Hierarchical identity-based inner product functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Verifiable decentralized multi-client functional encryption for inner product
- Securing data in the cloud using pairing-free inner product functional encryption with unbounded vector size
- Multi-authority ABE for non-monotonic access structures
- ABE for circuits with constant-size secret keys and adaptive security
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner product functional encryption from bilinear maps
- Efficient lattice-based inner-product functional encryption
- Fine-grained verifier NIZK and its applications
- Attribute-based access control for inner product functional encryption from LWE
- Unbounded predicate inner product functional encryption from pairings
- Improved unbounded inner-product functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Unbounded inner-product functional encryption with succinct keys
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Adaptive simulation security for inner product functional encryption
- Simple and efficient FE for quadratic functions
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Streaming functional encryption
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- Functional encryption for inner product based on matrix
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Impossibility results for lattice-based functional encryption schemes
- Tightly CCA-secure inner product functional encryption scheme
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Non-interactive anonymous router
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Fully secure functional encryption with general relations from the decisional linear assumption
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- A public key identity-based revocation scheme: fully attribute-hiding and function private
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- Lower bounds for lattice-based compact functional encryption
- Registered functional encryptions from pairings
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Adaptively secure inner product encryption from LWE
- An Anonymous Trace-and-Revoke Broadcast Encryption Scheme
- FE for inner products and its application to decentralized ABE
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
- How to Solve Multiple Short-Exponent Discrete Logarithm Problem
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- Multi-client functional encryption with fine-grained access control
- On the smoothing parameter and last minimum of random orthogonal lattices
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Functional encryption for set intersection in the multi-client setting
- Bounded-collusion decentralized ABE with sublinear parameters
- Hardness of \(k\)-LWE and applications in traitor tracing
- Hierarchical functional encryption for quadratic transformation
This page was built for publication: Fully secure functional encryption for inner products, from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829952)
