Broadcast, trace and revoke with optimal parameters from polynomial hardness
From MaRDI portal
Publication:6063535
Recommendations
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- An Anonymous Trace-and-Revoke Broadcast Encryption Scheme
- Efficient fully anonymous public-key trace and revoke with adaptive \textsf{IND-CCA} security
- A concise bounded anonymous broadcast yielding combinatorial trace-and-revoke schemes
Cites work
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Anonymous traitor tracing: how to embed arbitrary information in a key
- Attribute-based encryption for circuits
- Breaking the sub-exponential barrier in obfustopia
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Candidate Multilinear Maps from Ideal Lattices
- Candidate obfuscation via oblivious LWE sampling
- Candidate witness encryption from lattice techniques
- Collusion resistant broadcast and trace from positional witness encryption
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- Collusion resistant traitor tracing from learning with errors
- Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption
- Expressive key-policy attribute-based encryption with constant-size ciphertexts
- FE and iO for Turing machines from minimal assumptions
- From minicrypt to obfustopia via private-key functional encryption
- From selective to adaptive security in functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Function-private functional encryption in the private-key setting
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- scientific article; zbMATH DE number 1759344 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Laconic oblivious transfer and its applications
- Low overhead broadcast encryption from multilinear maps
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New approaches to traitor tracing with embedded identities
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- On perfect correctness in (lockable) obfuscation
- On the achievability of simulation-based security for functional encryption
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Optimal broadcast encryption from LWE and pairings in the standard model
- Optimal broadcast encryption from pairings and LWE
- Output-compressing randomized encodings and applications
- Practical multilinear maps over the integers
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Succinct LWE sampling, random polynomials, and obfuscation
- Traitor-tracing from LWE made simple and attribute-based
- Witness encryption and null-iO from evasive LWE
Cited in
(8)- A concise bounded anonymous broadcast yielding combinatorial trace-and-revoke schemes
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Certified everlasting secure collusion-resistant functional encryption, and more
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Traitor tracing without trusted authority from registered functional encryption
- Pseudorandom FE, iO and applications
- \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
- Certified everlasting secure collusion-resistant functional encryption, and more
This page was built for publication: Broadcast, trace and revoke with optimal parameters from polynomial hardness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063535)
