Unbounded inner product functional encryption from bilinear maps
From MaRDI portal
Publication:5915907
DOI10.1007/978-3-030-03329-3_21zbMath1446.94161OpenAlexW2886272158MaRDI QIDQ5915907
Katsuyuki Takashima, Junichi Tomida
Publication date: 23 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-03329-3_21
Related Items (10)
Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Multi-authority ABE for non-monotonic access structures ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting ⋮ Inner-product functional encryption with fine-grained access control ⋮ Verifiable functional encryption using Intel SGX ⋮ Fully secure unbounded zero inner product encryption with short ciphertexts and keys ⋮ Unbounded inner product functional encryption from bilinear maps
Cites Work
- Unbounded ABE via bilinear entropy expansion, revisited
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Improved (almost) tightly-secure structure-preserving signatures
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Function-hiding inner product encryption is practical
- Efficient functional encryption for inner-product values with full-hiding security
- Unbounded inner-product functional encryption with succinct keys
- Functional Encryption for Inner Product with Full Function Privacy
- Functional Encryption Without Obfuscation
- Function-Hiding Inner Product Encryption
- Dual-System Simulation-Soundness with Applications to UC-PAKE and More
- Compactly Hiding Linear Spans
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- Simple Functional Encryption Schemes for Inner Products
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Functional Encryption: Definitions and Challenges
- Unbounded HIBE and Attribute-Based Encryption
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- Adaptive Partitioning
- Fine-Tuning Groth-Sahai Proofs
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
- Multi-input Inner-Product Functional Encryption from Pairings
- Dual System Encryption via Predicate Encodings
This page was built for publication: Unbounded inner product functional encryption from bilinear maps
