Name
Abstract | ||
|---|---|---|
The notion of selective opening attacks (SOAs) was first introduced by Dwork et al. at FOCS'99. Informally, an encryption scheme is SOA secure if an adversary is given a vector of ciphertexts and can adaptively corrupt some fraction of them by obtaining not only their messages but also their randomness, the uncorrupted ciphertexts retain secure. Provably achieving security against SOA has been proven extremely challenging. In this paper, we propose a security model to capture simulation-based selective opening chosen-plaintext attacks (SIM-SO-CPA) for certificateless encryption. We provide a concrete construction and prove its security in our simulation-based selective opening chosen-plaintext attack security model, based on the real or random and computational Diffie-Hellman assumptions. Compared with previous SOA-secure public key encryption and identity-based encryption, our certificateless encryption scheme is more simple and efficient. (C) 2017 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/sec.1720 | SECURITY AND COMMUNICATION NETWORKS |
Keywords | Field | DocType |
certificateless encryption,chosen-plaintext attacks,selective opening attacks,one-sided publicly openable | Multiple encryption,Computer security,Computer science,Attribute-based encryption,Computer network,Plaintext-aware encryption,Encryption,40-bit encryption,Probabilistic encryption,Link encryption,56-bit encryption | Journal |
Volume | Issue | ISSN |
9.0 | 18.0 | 1939-0114 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huige Wang | 1 | 8 | 4.94 |
| Kefei Chen | 2 | 1178 | 107.83 |
| Baodong Qin | 3 | 190 | 19.40 |
| Liangliang Wang | 4 | 5 | 3.49 |