Efficient identity-based threshold decryption scheme from bilinear pairings

Abstract

Using Shamir’s secret sharing scheme to indirectly share the identity-based private key in the form of a pairing group element, we propose an efficient identity-based threshold decryption scheme from pairings and prove its security in the random oracle model. This new paring-based scheme features a few improvements compared with other schemes in the literature. The two most noticeable features are its efficiency, by drastically reducing the number of pairing computations, and the ability it gives the user to share the identity-based private key without requiring any access to a private key generator. With the ability it gives the user to share the identity-based private key, our ID-based threshold decryption (IBTD) scheme, the second of its kind, is significantly more efficient than the first scheme, which was developed by Baek and Zheng, at the expense of a slightly increased ciphertext length. In fact, our IBTD scheme tries to use as few bilinear pairings as possible, especially without depending on the suite of Baek–Zheng secret sharing tools based on pairings.

Keywords

identity-based cryptography / threshold cryptography / provable security / random oracle model / bilinear pairing / identity-based threshold decryption

References

[1] Shamir A. Identity-based cryptosystems and signature schemes. In: Proceedins of Advances in Cryptology-Crypto. 1984, 47–53

[2] Boneh D, Franklin M. Identity-based encryption from theWeil pairing. In: Proceedings of Advances in Cryptology-Crypto. 2001, 213–229

[3] Beak J, Newmarch J, Safavi-Naini R, Susilo W. A survey of identitybased cryptography. In: Proceedings of Australian Unix Users Group Annual Conference. 2004, 95–102

[4] Desmedt Y, Frankel Y. Threshold cryptosystems. In: Proceedings of Advances in Cryptology-CRYPTO. 1990, 307–315

[5] Santis A, Desmedt Y, Frankel Y, Yung M. How to share a function securely. In: Proceedings of the 26th ACM Symposium on Theory of Computing. 1994, 522–533

[6] Shoup V, Gennaro R. Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology, 2002, 15(2): 75–96

[7] Guo P, Wang J, Li B, Lee S. A variable threshold-value authentication architecture for wireless mesh networks. Journal of Internet Technology, 2014, 15(6): 929–936

[8] Fu Z J, Ren K, Shu J G, Sun X M, Huang F X. Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Transactions on Parallel and Distributed Systems, 2016, 27(9): 2546–2559

[9] Fu Z J, Wu X L, Guan C W, Sun X M, Ren K. Towards efficient multikeyword fuzzy search over encrypted outsourced data with accuracy improvement. IEEE Transactions on Information Forensics and Security, 2016, 11(12): 2706–2716

[10] Baek J, Zheng Y L. Identity-based threshold decryption. In: Proceedings of Public Key Cryptography-PKC. 2004, 262–276

[11] Boneh D, Ding X, Tsudik G, Wong C. A method for fast revocation of public key certificates and security capabilities. In: Proceedings of the 10th USENIX Security Symposium. 2001, 297–310

[12] Boneh D, Boyen X, Halevi S. Chosen ciphertext secure public key threshold encryption without random oracles. In: Proceedings of Topics in Cryptology-CT-RSA. 2006, 226–243

[13] Boneh D, Boyen X. Efficient selective-ID identity based encryption without random oracles. In: Proceedings of Advances in Cryptology- Eurocrypt. 2004, 522–533

[14] Libert B, Quisquater J. Efficient revocation and threshold pairing based cryptosystems. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing. 2003, 163–171

[15] Chai Z C, Cao Z F, Lu R X. ID-based threshold decryption without random oracles and its application in key escrow. In: Proceedings of the 3rd International Conference on Information Security. 2004, 119–124

[16] Long L, Chen K F, Liu S L. ID-based threshold decryption secure against adaptive chosen-ciphertext attack. Computers and Electrical Engineering, 2007, 33 (3): 166–176

[17] Zhang L Y, Hu Y P, Tian X A, Yang Y. New constructions of identitybased threshold decryption. Wuhan University Journal of Natural Sciences, 2010, 15(3): 222–226

[18] Ming Y, Wang Y M. Identity-based threshold decryption scheme without random oracles. Chinese Journal of Electronics, 2011, 20(2): 323–328

[19] Zhang X, Chen M R, Liu H. Practical identity-based threshold decryption scheme without random oracle. Journal of Shenzhen University Science & Engineering, 2010, 27(3): 340–346

[20] Zhao C A, Zhang F G. Research and development on efficient pairing computations. Journal of Software, 2009, 20 (11): 3001–3009

[21] Bos J W, Costello C, Naehrig M. Exponentiating in pairing groups. In: Proceedings of Selected Areas in Cryptography-SAC. 2014, 438–455

[22] Ren Y J, Shen J, Wang J, Han J, Lee S Y. Mutual verifiable provable data auditing in public cloud storage. Journal of Internet Technology, 2015, 16(2): 317–323

[23] Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612–613

[24] Xie S D, Wang Y X. Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wireless Personal Communications, 2014, 78(1): 231–246

[25] Shen J, Tan H W, Wang J, Wang J W, Lee S. A novel routing protocol providing good transmission reliability in underwater sensor networks. Journal of Internet Technology, 2015, 16(1): 171–178

[26] Chaum D, Pedersen T. Wallet databases with observers. In: Proceedings of Advances in Cryptology-Crypto. 1992, 89–105

[27] Aranha D F, Barreto P S L M, Longa P, Ricardini J E. The realm of the pairings. In: Proceedings of International Workshop on Selected Areas in Cryptography-SAC. 2014, 3–25

[28] Tang C M, Ni D M, Xu M Z, Guo B A, Qi Y F. Implementing optimized pairings with elliptic nets. Science China Information Sciences, 2014, 57(5): 1–10

[29] Chen S, Zhang X S, Wang K P, Lin D D. Six subfamilies of implementation-friendly Barreto-Naehrig curves. Chinese Journal of Electronics, 2014, 23(1): 169–174

[30] Chen S, Wang K P, Lin D D. Omega pairing on hyperelliptic curves. Information Security and Cryptology. In: Proceedings of the 9th International Conference on Information Security and Cryptology-Inscrypt. 2013, 167–184

[31] Desmedt Y, Lange Y. Pairing based threshold cryptography improving on Libert-Quisquater and Baek-Zheng. In: Proceedings of International Conference on Financial Cryptography and Data Security 2006. 2006, 154–159

[32] Galindo D, Kiltz E. Chosen-ciphertext secure threshold identity-based key encapsulation without random oracles. In: Proceedings of International Conference on Security and Cryptography for Networks-SCN. 2006, 173–185

RIGHTS & PERMISSIONS

2018 Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature