Name
Abstract | ||
|---|---|---|
Deterministic public-key encryption, encrypting a plaintext into a unique ciphertext without involving any randomness, was introduced by Bellare, Boldyreva, and O'Neill (CRYPTO 2007) as a realistic alternative to some inherent drawbacks in randomized public-key encryption. Bellare, Kiltz, Peikert and Waters (EUROCRYPT 2012) bring deterministic public-key encryption to the identity-based setting, and propose deterministic identity-based encryption scheme (DIBE). Although the constructions of chosen plaintext attack (CPA) secure DIBE scheme have been studied intensively, the construction of chosen ciphertext attack (CCA) secure DIBE scheme is still challenging problems. In this paper, we introduce the notion of identity-based all-but-one trapdoor functions (IB-ABO-TDF), which is an extension version of all-but-one lossy trapdoor function in the public-key setting. We give a instantiation of IB-ABO-TDF under decisional linear assumption. Based on an identity-based lossy trapdoor function and our IB-ABO-TDF, we present a generic construction of CCA-secure DIBE scheme. |
Year | Venue | Keywords |
|---|---|---|
2019 | JOURNAL OF UNIVERSAL COMPUTER SCIENCE | deterministic identity-based encryption,identity-based lossy trapdoor functions,identity-based all-but-one trapdoor functions,chosen ciphertext security |
Field | DocType | Volume |
Data mining,Lossy compression,Chosen-plaintext attack,Computer science,Theoretical computer science,Encryption,Trapdoor function,Chosen-ciphertext attack,Ciphertext,Plaintext,Randomness | Journal | 25 |
Issue | ISSN | Citations |
3 | 0948-695X | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mei-juan Huang | 1 | 1 | 2.73 |
| Bo Yang | 2 | 4 | 5.14 |
| Yi Zhao | 3 | 144 | 38.97 |
| Kaitai Liang | 4 | 612 | 45.13 |
| Liang Xue | 5 | 0 | 2.70 |
| Xiaoyi Yang | 6 | 0 | 0.68 |