Traitor-tracing from LWE made simple and attribute-based
From MaRDI portal
Publication:1631335
DOI10.1007/978-3-030-03810-6_13zbMath1430.94065OpenAlexW2951603772MaRDI QIDQ1631335
Brent Waters, Vinod Vaikuntanathan, Daniel Wichs, Hoeteck Wee, Yilei Chen
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_13
Related Items (15)
Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ Optimal bounded-collusion secure functional encryption ⋮ New approaches to traitor tracing with embedded identities ⋮ A survey of lattice based expressive attribute based encryption ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Functional encryption for cubic polynomials and implementation ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
Cites Work
- Unnamed Item
- Stronger security for reusable garbled circuits, general definitions and attacks
- Functional encryption for bounded collusions, revisited
- Private constrained PRFs (and more) from LWE
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Practical Ciphertext-Policy Attribute-Based Encryption: Traitor Tracing, Revocation, and Large Universe
- Key Homomorphic PRFs and Their Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Collusion resistant traitor tracing from learning with errors
- Graph-Induced Multilinear Maps from Lattices
- Classical hardness of learning with errors
- Constraining Pseudorandom Functions Privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Identity-Based Traitor Tracing
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Traitor-tracing from LWE made simple and attribute-based
