Unbounded inner product functional encryption from bilinear maps
From MaRDI portal
Publication:5919081
DOI10.1007/s13160-020-00419-xzbMath1459.94142OpenAlexW3172526346WikidataQ123193857 ScholiaQ123193857MaRDI QIDQ5919081
Junichi Tomida, Katsuyuki Takashima
Publication date: 15 February 2021
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-020-00419-x
Related Items
Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ A survey on functional encryption
Cites Work
- CBC MACs for arbitrary-length messages: The three-key constructions
- 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
- 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
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
- Simple Functional Encryption Schemes for Inner Products
- 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
- 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
- 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
- Multi-input Inner-Product Functional Encryption from Pairings
- Dual System Encryption via Predicate Encodings
- Unbounded inner product functional encryption from bilinear maps
