Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
From MaRDI portal
Publication:6122595
DOI10.1016/j.tcs.2023.114368OpenAlexW4390331425MaRDI QIDQ6122595
No author found.
Publication date: 1 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114368
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traceable inner product functional encryption
- Traitor-tracing from LWE made simple and attribute-based
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Decentralized multi-client functional encryption for inner product
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Function-hiding inner product encryption is practical
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Attribute-based access control for inner product functional encryption from LWE
- New approaches to traitor tracing with embedded identities
- Multi-client functional encryption for linear functions in the standard model from LWE
- Collusion resistant broadcast and trace from positional witness encryption
- FE for inner products and its application to decentralized ABE
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Inner-product functional encryption with fine-grained access control
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- Functional Encryption Without Obfuscation
- A Decade of Lattice Cryptography
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- 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
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Public-key cryptosystems from the worst-case shortest vector problem
- Collusion resistant traitor tracing from learning with errors
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Efficient Traitor Tracing from Collusion Secure Codes
- An Introduction to Computational Physics
- Multi-input Inner-Product Functional Encryption from Pairings
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
- On lattices, learning with errors, random linear codes, and cryptography
- Advances in Cryptology - ASIACRYPT 2003
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Generic construction of trace-and-revoke inner product functional encryption
This page was built for publication: Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
