Abstract | ||
---|---|---|
We revisit the problem of constructing public key encryption (PKE) secure against both key-leakage and tampering attacks. First, we present an enhanced security against both kinds of attacks, namely strong leakage and tamper-resilient chosen-ciphertext (sLTR-CCA) security, which imposes only minimal restrictions on the adversary's queries and thus captures the capability of the adversary in a more reasonable way. Then, we propose a generic paradigm achieving this security on the basis of a refined hash proof system (HPS) called public-key-malleable HPS. The paradigm can not only tolerate a large amount of bounded key-leakage, but also resist an arbitrary polynomial of restricted tampering attacks, even depending on the challenge phase. Moreover, the paradigm with slight adaptations can also be proven sLTR-CCA secure with respect to subexponentially hard auxiliary-input leakage. In addition, we instantiate our paradigm under certain standard number-theoretic assumptions, and thus, to our best knowledge, obtain the first efficient PKE schemes possessing the strong bounded/auxiliary-input leakage and tamper-resilient chosen-ciphertext security in the standard model. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1007/978-3-030-21568-2_24 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Public key encryption,Hash proof system,Chosen-ciphertext security,Leakage attack,Tampering attack | Leakage (electronics),Polynomial,Computer science,Computer security,Theoretical computer science,Hash function,Adversary,Public-key cryptography,Bounded function | Conference |
Volume | ISSN | Citations |
11464 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shifeng Sun | 1 | 59 | 15.53 |
Dawu Gu | 2 | 644 | 103.50 |
Man Ho Au | 3 | 1444 | 97.70 |
Shuai Han | 4 | 7 | 10.28 |
Yu Yu | 5 | 219 | 30.37 |
Joseph K. Liu | 6 | 99 | 17.73 |