Functional encryption for inner product with full function privacy
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- A First Step Towards a Unified Proof Checker for QBF
- A SAT attack on the Erdős discrepancy conjecture
- Are good-for-games automata good for probabilistic model checking?
- Certifying algorithms
- Computer-aided proof of Erdős discrepancy properties
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Deterministic generators and games for LTL fragments
- Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment
- Efficiently checking propositional refutations in HOL theorem provers
- Experiments with deterministic -automata for formulas of linear temporal logic
- Expressing symmetry breaking in DRAT proofs
- Extended Resolution Proofs for Conjoining BDDs
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Extraction in Coq: An Overview
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Formalization of Abstract State Transition Systems for SAT
- From LTL to Symbolically Represented Deterministic Automata
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
- Lazy probabilistic model checking without determinisation
- Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\)
- Limit-deterministic Büchi automata for linear temporal logic
- Mechanical verification of SAT refutations with extended resolution
- Optimal Translation of LTL to Limit Deterministic Automata
- Producing and verifying extremely large propositional refutations
- Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
- Rabinizer 3: Safraless translation of LTL to small deterministic automata
- Solving Games Without Determinization
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- The complexity of probabilistic verification
- Verification, Model Checking, and Abstract Interpretation
Cited in
(74)- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- More efficient verifiable functional encryption
- (Inner-product) functional encryption with updatable ciphertexts
- GeoENC: geometric area based keys and policies in functional encryption systems
- Function-private identity-based encryption: hiding the function in functional encryption
- Function-private subspace-membership encryption and its applications
- Function-private functional encryption in the private-key setting
- Simple functional encryption schemes for inner products
- Function-hiding inner product encryption
- Efficient anonymous multi-group broadcast encryption
- Function-hiding inner product encryption is practical
- Efficient functional encryption for inner-product values with full-hiding security
- Function-private functional encryption in the private-key setting
- 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
- Functional encryption: origins and recent developments
- CCA-secure inner-product functional encryption from projective hash functions
- Multi-input inner-product functional encryption from pairings
- Doubly spatial encryption from DBDH
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- Fine-grained polynomial functional encryption
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- A new approach to practical function-private inner product encryption
- A survey on functional encryption
- Hierarchical identity-based inner product functional encryption
- Multi-input quadratic functional encryption from pairings
- Registered (inner-product) functional encryption
- Functional encryption: definitions and challenges
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner product functional encryption from bilinear maps
- Efficient lattice-based inner-product functional encryption
- Attribute-based access control for inner product functional encryption from LWE
- Unbounded predicate inner product functional encryption from pairings
- On the semantic security of functional encryption schemes
- 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 simulation security for inner product functional encryption
- 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
- Impossibility results for lattice-based functional encryption schemes
- Tightly CCA-secure inner product functional encryption scheme
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Functional encryption from (small) hardware tokens
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Lower bounds for lattice-based compact functional encryption
- Registered functional encryptions from pairings
- 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
- Blind Functional Encryption
- Hierarchical functional encryption for linear transformations
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Function private predicate encryption for low min-entropy predicates
- Efficient function-hiding functional encryption: from inner-products to orthogonality
- Traceable inner product functional encryption
- DFE-IP: delegatable functional encryption for inner product
- Inner-product functional encryption with fine-grained access control
- Functional encryption for public-attribute inner products: achieving constant-size ciphertexts with adaptive security or support for negation
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Strongly full-hiding inner product encryption
- Publicly auditable functional encryption
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Efficient inner product encryption with simulation-based security
This page was built for publication: Functional encryption for inner product with full function privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798775)
