Hardness of k-LWE and Applications in Traitor Tracing
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2017
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/84074 http://hdl.handle.net/10220/42953 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|