Hardness of k-LWE and Applications in Traitor Tracing
From MaRDI portal
Publication:2874512
DOI10.1007/978-3-662-44371-2_18zbMath1343.94071OpenAlexW130395163MaRDI QIDQ2874512
Ron Steinfeld, Duong Hieu Phan, San Ling, Damien Stehlé
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_18
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
LWE without modular reduction and improved side-channel attacks against BLISS ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ New approaches to traitor tracing with embedded identities ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Witness encryption and null-iO from evasive LWE ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
This page was built for publication: Hardness of k-LWE and Applications in Traitor Tracing
