Name
Abstract | ||
|---|---|---|
In a multi-decrypter encryption (MDE) scheme, a message encrypted under the public keys of multiple receivers can be recovered only when all the receivers designated by the sender are available (e.g. in a national security setting where a "Top Secret" document can only be decrypted and recovered when all the designated "keyholders" present the respective keys). Despite its effectiveness (i.e. without heavy computational overheads) in ensuring a message can only be read when all the designated parties are available, this is an under-researched topic (there are only two published MDE schemes in the literature, to the best of our knowledge). In this paper, we propose an efficient MDE scheme and prove its CCA2 security in the standard model under the decisional bilinear Diffie Hellman assumption. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.15388/Informatica.2015.63 | INFORMATICA |
Keywords | Field | DocType |
multi-user cryptography, multi-decrypter encryption, bilinear pairing, chosen ciphertext security, decisional bilinear Diffie-Hellman assumption, standard model | Multiple encryption,Trustworthy computing,Optimal asymmetric encryption padding,Computer science,Computer security,Information science,Attribute-based encryption,Plaintext-aware encryption,Encryption,Artificial intelligence,Probabilistic encryption,Machine learning | Journal |
Volume | Issue | ISSN |
26 | 3 | 0868-4952 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shengbao Wang | 1 | 169 | 13.37 |
| Peng Zeng | 2 | 50 | 6.32 |
| Kim-Kwang Raymond Choo | 3 | 4103 | 362.49 |
| Hongbing Wang | 4 | 2 | 0.73 |