Affiliations: [1] School of Information Science and Engineering, Hangzhou Normal University, Hangzhou 310012, PR China | [2] Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, PR China | [3] Information Assurance Research Group, Advanced Computing Research Centre, University of South Australia, Adelaide SA 5000, Australia | [4] Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, PR China, e-mail: shengbaowang@gmail.com, pzeng@sei.ecnu.edu.cn, raymond.choo@fulbrightmail.org, florawang.2011@gmail.com
Correspondence:
[*]
Corresponding author
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.
Keywords: multi-user cryptography, multi-decrypter encryption, bilinear pairing, chosen ciphertext security, decisional bilinear Diffie–Hellman assumption, standard model
Journal: Informatica, vol. 26, no. 3, pp. 543-556, 2015
