(Inner-product) functional encryption with updatable ciphertexts
From MaRDI portal
Publication:6141858
DOI10.1007/s00145-023-09486-yOpenAlexW4389780777MaRDI QIDQ6141858
Valerio Cini, Christoph Striecks, Sebastian Ramacher, Daniel Slamanig, Erkan Tairi
Publication date: 23 January 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09486-y
Cites Work
- Unnamed Item
- Outsourcing the re-encryption key generation: flexible ciphertext-policy attribute-based proxy re-encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Be adaptive, avoid overcommitting
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Revisiting proxy re-encryption: forward secrecy, improved security, and applications
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Multi-client inner-product functional encryption in the random-oracle model
- Attribute-based access control for inner product functional encryption from LWE
- Multi-client functional encryption for linear functions in the standard model from LWE
- From single-input to multi-client inner-product functional encryption
- Offline witness encryption with semi-adaptive security
- Decentralizing inner-product functional encryption
- What about Bob? The inadequacy of CPA security for proxy reencryption
- Adaptively secure proxy re-encryption
- Proxy re-encryption and re-signatures from lattices
- Unbounded inner-product functional encryption with succinct keys
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Inner-product functional encryption with fine-grained access control
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Constrained Pseudorandom Functions and Their Applications
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Simple Functional Encryption Schemes for Inner Products
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Functional Encryption: Definitions and Challenges
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- How to use indistinguishability obfuscation
- Obfuscation of Probabilistic Circuits and Applications
- Fuzzy Identity-Based Encryption
- Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Attribute-based encryption for circuits
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
- Multi-input Inner-Product Functional Encryption from Pairings
- On lattices, learning with errors, random linear codes, and cryptography
- Pattern matching in encrypted stream from inner product encryption
- Multi-client functional encryption with fine-grained access control
This page was built for publication: (Inner-product) functional encryption with updatable ciphertexts
