Functional Encryption for Inner Product with Full Function Privacy
From MaRDI portal
Publication:2798775
DOI10.1007/978-3-662-49384-7_7zbMath1388.94046OpenAlexW2295524223MaRDI QIDQ2798775
Sourav Mukhopadhyay, Ratna Dutta, Pratish Datta
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_7
Related Items (24)
Post-quantum secure inner product functional encryption using multivariate public key cryptography ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Multi-input quadratic functional encryption from pairings ⋮ Hierarchical identity-based inner product functional encryption ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ DFE-IP: delegatable functional encryption for inner product ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ A survey on functional encryption ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Inner-product functional encryption with fine-grained access control ⋮ Efficient Inner Product Encryption with Simulation-Based Security ⋮ Efficient anonymous multi-group broadcast encryption ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ A new approach to practical function-private inner product encryption
Cites Work
- Unnamed Item
- Certifying algorithms
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Producing and verifying extremely large propositional refutations
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
- Computer-aided proof of Erdős discrepancy properties
- Efficiently checking propositional refutations in HOL theorem provers
- Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- A SAT Attack on the Erdős Discrepancy Conjecture
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Formalization of Abstract State Transition Systems for SAT
- Optimal Translation of LTL to Limit Deterministic Automata
- Extended Resolution Proofs for Conjoining BDDs
- Expressing Symmetry Breaking in DRAT Proofs
- Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
- Extraction in Coq: An Overview
- A First Step Towards a Unified Proof Checker for QBF
- Solving Games Without Determinization
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
- The complexity of probabilistic verification
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
- Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
- Deterministic generators and games for Ltl fragments
- Mechanical Verification of SAT Refutations with Extended Resolution
- Lazy probabilistic model checking without determinisation
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- From LTL to Symbolically Represented Deterministic Automata
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Functional Encryption for Inner Product with Full Function Privacy
