Hardness of k-LWE and Applications in Traitor Tracing

• المؤلفون الرئيسيون: Ling, San, Phan, Duong Hieu, Stehlé, Damien, Steinfeld, Ron
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2017
• الموضوعات: Lattice-based cryptography; Traitor tracing
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/84074; http://hdl.handle.net/10220/42953
• المؤسسة: Nanyang Technological University

We introduce the k-LWE problem, a Learning With Errors variant of the k-SIS problem. The Boneh-Freeman reduction from SIS to k-SIS suffers from an exponential loss in k. We improve and extend it to an LWE to k-LWE reduction with a polynomial loss in k, by relying on a new technique involving trapdoo...