Name
Abstract | ||
|---|---|---|
Practical hardness results are necessary to select parameters for cryptographic schemes. Cryptographic challenges proved to be useful for determining the practical hardness of computational problems that are used to build public-key cryptography. However, several of these problems have the drawback that it is not known how to create a challenge for them without knowing the solutions. Hence, for these problems the creators of the challenges are excluded from participating. In this work, we present a method to create cryptographic challenges without excluding anyone from participating. This method is based on secure multi-party computation (MPC). We demonstrate that the MPC-based approach is indeed feasible by using it to build a challenge for the learning with errors (LWE) problem. The LWE problem is one of the most important problems in lattice-based cryptography. The security of many cryptographic schemes that have been proposed in the last decade is directly based on it. We identify parameters for LWE instances that provide the appropriate hardness level for a challenge while representing instances used to instantiate encryption schemes as close as possible. The LWE challenge is designed to determine the practical hardness of LWE, to gain an overview of the best known LWE solvers, and to motivate additional research effort in this direction. |
Year | Venue | DocType |
|---|---|---|
2017 | IACR Cryptology ePrint Archive | Journal |
Volume | Citations | PageRank |
2017 | 5 | 0.45 |
References | Authors | |
16 | 9 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Buchmann | 1 | 587 | 52.67 |
| Niklas Büscher | 2 | 47 | 4.58 |
| Florian Göpfert | 3 | 64 | 4.96 |
| Stefan Katzenbeisser | 4 | 1844 | 143.68 |
| Juliane Krämer | 5 | 74 | 7.52 |
| Daniele Micciancio | 6 | 3158 | 205.44 |
| Sander Siim | 7 | 30 | 1.58 |
| Christine van Vredendaal | 8 | 47 | 7.27 |
| Michael Walter | 9 | 111 | 10.36 |