Hardness of \(k\)-LWE and applications in traitor tracing
type: Item
instance of: scholarly article
title: Hardness of \(k\)-LWE and applications in traitor tracing
zbMATH Open document ID: 1405.94074
author: San Ling
author: Duong Hieu Phan
author: Damien Stehlé
author: Ron Steinfeld
published in: Algorithmica
publication date: 2018-01-05T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6822868
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: traitor tracing
zbMATH Keywords: LWE
MaRDI profile type: Publication
full work available at URL: hal-01643505
OpenAlex ID: W4392715428
cites work: Identity-Based Traitor Tracing
cites work: A Note on Discrete Gaussian Combinations of Lattice Vectors
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
cites work: Discrete Gaussian Leftover Hash Lemma over Infinite Domains
cites work: Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
cites work: Q4228459
cites work: Q4938616
cites work: Generating shorter bases for hard random lattices
cites work: Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
cites work: Efficient Traitor Tracing from Collusion Secure Codes
cites work: Q4941864
cites work: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
cites work: Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
cites work: Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
cites work: Classical hardness of learning with errors
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Public Traceability in Traitor Tracing Schemes
cites work: Q4940701
cites work: Tracing traitors
cites work: Q4737235
cites work: Traitor Tracing with Optimal Transmission Rate
cites work: Q4341773
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: A Group Signature Scheme from Lattice Assumptions
cites work: Encryption for digital content
cites work: Q4738936
cites work: Q4783720
cites work: Breaking and Repairing Asymmetric Public-Key Traitor Tracing
cites work: Q4737263
cites work: Q4952720
cites work: Q2724598
cites work: Q4249634
cites work: Q3043936
cites work: GGHLite: More Efficient Multilinear Maps from Ideal Lattices
cites work: Hardness of k-LWE and Applications in Traitor Tracing
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Lattice-based Cryptography
cites work: Q4783719
cites work: Q4536284
cites work: Bi-Deniable Public-Key Encryption
cites work: Limits on the hardness of lattice problems in \(\ell_{p}\) norms
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: An Efficient and Parallel Gaussian Sampler for Lattices
cites work: Q4471332
cites work: Lossy trapdoor functions and their applications
cites work: Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Learning with Errors over Rings
cites work: Q4474172
cites work: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
cites work: Q4250813
cites work: Optimal probabilistic fingerprint codes
cites work: Q2724458
DOI: 10.1007/S00453-016-0251-7