Hardness of \(k\)-LWE and applications in traitor tracing

DOI10.1007/s00453-016-0251-7zbMath1405.94074OpenAlexW4392715428MaRDI QIDQ1688407

Damien Stehlé, Ron Steinfeld, San Ling, Duong Hieu Phan

Publication date: 5 January 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://hal.science/hal-01643505

zbMATH Keywords

traitor tracingLWElattice-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the smoothing parameter and last minimum of random orthogonal lattices

Cites Work

• Encryption for digital content
• Generating shorter bases for hard random lattices
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Discrete Gaussian Leftover Hash Lemma over Infinite Domains
• Hardness of k-LWE and Applications in Traitor Tracing
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• A Group Signature Scheme from Lattice Assumptions
• Breaking and Repairing Asymmetric Public-Key Traitor Tracing
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• A Note on Discrete Gaussian Combinations of Lattice Vectors
• Traitor Tracing with Optimal Transmission Rate
• Lossy trapdoor functions and their applications
• 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
• An Efficient and Parallel Gaussian Sampler for Lattices
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• Lattice-based Cryptography
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Tracing traitors
• Learning with Errors over Rings
• Public-key cryptosystems from the worst-case shortest vector problem
• Bi-Deniable Public-Key Encryption
• Public Traceability in Traitor Tracing Schemes
• On Ideal Lattices and Learning with Errors over Rings
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Classical hardness of learning with errors
• Efficient Traitor Tracing from Collusion Secure Codes
• Identity-Based Traitor Tracing
• On lattices, learning with errors, random linear codes, and cryptography
• Optimal probabilistic fingerprint codes
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hardness of \(k\)-LWE and applications in traitor tracing