Provably secure threshold public-key encryption with adaptive security and short ciphertexts

  • Authors:
  • Bo Qin;Qianhong Wu;Lei Zhang;Oriol FarríS;Josep Domingo-Ferrer

  • Affiliations:
  • Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, Tarragona, Catalonia, Spain and Department of Maths, School of Science, Xi'an University of Technology, China;Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, Tarragona, Catalonia, Spain and Key Lab. of Aerospace Information Security and Trusted Computing, Ministry of Educ ...;Shanghai Key Laboratory of Trustworthy Computing, Software Engineer Institute, East China Normal University, Shanghai, China;Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, Tarragona, Catalonia, Spain;Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, Tarragona, Catalonia, Spain

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.07

Visualization

Abstract

Threshold public-key encryption is a cryptographic primitive allowing decryption control in group-oriented encryption applications. Existing TPKE schemes suffer from long ciphertexts with size linear in the number of authorized users or can only achieve non-adaptive security, which is too weak to capture the capacity of the attackers in the real world. In this paper, we propose an efficient TPKE scheme with constant-size ciphertexts and adaptive security. Security is proven under the decision Bilinear Diffie-Hellman Exponentiation assumption in the standard model. Then we extend our basic construction with efficient trade-offs between the key size and the ciphertext size. Finally, we illustrate improvements to transmit multiple secret session keys in one session with almost no extra cost.