Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
From MaRDI portal
Publication:6618631
DOI10.1007/s10623-024-01432-8zbMATH Open1547.94348MaRDI QIDQ6618631
Tapas Pal, Katsuyuki Takashima, Pratish Datta
Publication date: 14 October 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Unnamed Item
- FE and iO for Turing machines from minimal assumptions
- Unbounded ABE via bilinear entropy expansion, revisited
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Functional encryption for bounded collusions, revisited
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Adaptively simulation-secure attribute-hiding predicate encryption
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Function-private functional encryption in the private-key setting
- Function-hiding inner product encryption is practical
- Efficient functional encryption for inner-product values with full-hiding security
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- Tightly CCA-secure inner product functional encryption scheme
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Multi-client functional encryption for separable functions
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Dynamic decentralized functional encryption
- Multi-client inner-product functional encryption in the random-oracle model
- Multi-input quadratic functional encryption from pairings
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Dynamic collusion bounded functional encryption from identity-based encryption
- Optimal bounded-collusion secure functional encryption
- Multi-client functional encryption for linear functions in the standard model from LWE
- From single-input to multi-client inner-product functional encryption
- FE for inner products and its application to decentralized ABE
- Decentralizing inner-product functional encryption
- Unbounded inner-product functional encryption with succinct keys
- Functional Encryption for Turing Machines
- Functional Encryption for Inner Product with Full Function Privacy
- Deniable Functional Encryption
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- How to Run Turing Machines on Encrypted Data
- Functional Encryption from (Small) Hardware Tokens
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simple Functional Encryption Schemes for Inner Products
- Simulation-Based Secure Functional Encryption in the Random Oracle Model
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
- Verifiable Functional Encryption
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
- Functional Encryption: Definitions and Challenges
- Unbounded HIBE and Attribute-Based Encryption
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- 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
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional 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
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Adaptive Simulation Security for Inner Product Functional Encryption
- Partial Garbling Schemes and Their Applications
- Functional Encryption for Randomized Functionalities
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Multi-input Functional Encryption
- How to Garble Arithmetic Circuits
- Reusable garbled circuits and succinct functional encryption
- Multi-input Inner-Product Functional Encryption from Pairings
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Dual System Encryption via Predicate Encodings
- Unbounded inner product functional encryption from bilinear maps
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- Indistinguishability obfuscation from well-founded assumptions
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Efficient lattice-based inner-product functional encryption
This page was built for publication: Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}