Name
Abstract | ||
|---|---|---|
The Learning with Rounding (LWR) problem is a deterministic variant of the classical Learning with Errors (LWE) problem, for which sampling an instance does not involve discrete Gaussian sampling. We propose the first probabilistic Identity-Based Encryption (IBE) from the LWR problem which is secure in the standard model. The encryption of our IBE scheme does not require discrete Gaussian sampling as it is based on the LWR problem, and hence it is simpler and faster than that of LWE-based IBEs such as ABB scheme. We also present an efficient instantiation employing algebraic ring structure and MP12 trapdoor sampling algorithms with an implementation result. With our proposed parameter sets, the ciphertext sizes can be reduced in a large extent compared to the ABB scheme with the same security level. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-40921-0_14 | INFORMATION SECURITY AND CRYPTOLOGY, ICISC 2019 |
Keywords | DocType | Volume |
Lattice, Identity-Based Encryption, Learning with Rounding | Conference | 11975 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jung Hee Cheon | 1 | 1787 | 129.74 |
| Haejin Cho | 2 | 0 | 0.34 |
| Jaewook Jung | 3 | 32 | 8.00 |
| Joohee Lee | 4 | 0 | 0.34 |
| Keewoo Lee | 5 | 16 | 3.02 |