Broadcast, trace and revoke with optimal parameters from polynomial hardness
From MaRDI portal
Publication:6063535
DOI10.1007/978-3-031-30620-4_20zbMath1528.94028OpenAlexW4365806564MaRDI QIDQ6063535
Simran Kumari, Anshu Yadav, Shweta Agrawal, Shota Yamada
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_20
broadcastoptimal parameterstrace and revokerevocable mixed functional encryptionrevocable predicate encryption
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traitor-tracing from LWE made simple and attribute-based
- FE and iO for Turing machines from minimal assumptions
- Laconic oblivious transfer and its applications
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Function-private functional encryption in the private-key setting
- Optimal broadcast encryption from pairings and LWE
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Optimal broadcast encryption from LWE and pairings in the standard model
- On perfect correctness in (lockable) obfuscation
- Candidate obfuscation via oblivious LWE sampling
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- From minicrypt to obfustopia via private-key functional encryption
- New approaches to traitor tracing with embedded identities
- Collusion resistant broadcast and trace from positional witness encryption
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- Succinct LWE sampling, random polynomials, and obfuscation
- Output-Compressing Randomized Encodings and Applications
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Practical Multilinear Maps over the Integers
- On the Achievability of Simulation-Based Security for Functional Encryption
- Low Overhead Broadcast Encryption from Multilinear Maps
- Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Indistinguishability Obfuscation from Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Collusion resistant traitor tracing from learning with errors
- Breaking the Sub-Exponential Barrier in Obfustopia
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Attribute-based encryption for circuits
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Witness encryption and null-iO from evasive LWE
- Candidate witness encryption from lattice techniques
This page was built for publication: Broadcast, trace and revoke with optimal parameters from polynomial hardness
