(Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
From MaRDI portal
Publication:6041293
DOI10.1007/978-3-030-92068-5_15zbMATH Open1514.94072OpenAlexW3205299548MaRDI QIDQ6041293FDOQ6041293
Authors: Pratish Datta, Tapas Pal 
Publication date: 26 May 2023
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-92068-5_15
Recommendations
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
Cites Work
- Functional encryption: definitions and challenges
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- How to Garble Arithmetic Circuits
- Title not available (Why is that?)
- Simple Functional Encryption Schemes for Inner Products
- Fully secure unbounded inner-product and attribute-based encryption
- An algebraic framework for Diffie-Hellman assumptions
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Stronger security for reusable garbled circuits, general definitions and attacks
- Partial Garbling Schemes and Their Applications
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Adaptively simulation-secure attribute-hiding predicate encryption
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Adaptive Simulation Security for Inner Product Functional Encryption
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
Cited In (7)
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Unbounded predicate inner product functional encryption from pairings
- Unbounded quadratic functional encryption and more from pairings
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Attribute-based multi-input FE (and more) for attribute-weighted sums
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
This page was built for publication: (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041293)
