logo

SCIENTIA SINICA Informationis, Volume 46 , Issue 7 : 855-869(2016) https://doi.org/10.1360/N112016-00020

New algorithms for verifiable outsourcing of bilinear pairings

More info
  • ReceivedJan 22, 2016
  • AcceptedFeb 3, 2016

Abstract

It is well known that the computation of bilinear pairing is the most expensive operation in pairing-based cryptography. In this paper, we first propose a secure verifiable outsourcing algorithm of single bilinear pairing based on two servers in the one-malicious model. The outsourcer need not execute any expensive operations, such as scalar multiplication or modular exponentiation. We also present another verifiable outsourcing algorithm for multiple bilinear pairings. This algorithm is much more efficient than the repeated invocation of the outsourcing algorithm of single bilinear pairing. Both of the proposed algorithms enable the outsourcer to detect any failure with a probability of 1 if one of the servers misbehaves. Finally, we utilize the proposed algorithms as two subroutines to achieve an anonymous identity-based encryption (AIBE) scheme with outsourced decryption and an identity-based signature (IBS) scheme with outsourced verification.


Funded by

国家自然科学基金(61202367)

国家自然科学基金(61572309)

国家自然科学基金(61572246)

教育部博士点基金(20120073110094)

上海市教委创新基金(14YZ020)

河南省科技创新人才支持计划河南省高校科技创新人才支持计划(13HASTIT042)


References

[1] Chen X F, Li J, Ma J F, et al. New algorithms for secure outsourcing of modular exponentiations. IEEE Trans Parall Distrib Syst, 2014, 25: 2386-2396 CrossRef Google Scholar

[2] Gennaro R, Gentry C, Parno B. Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Proceedings of the 30th Annual Conference on Advances in Cryptology. Berlin: Springer, 2010. 465-482. Google Scholar

[3] Chung K, Kalai Y, Vadhan S. Improved delegation of computation using fully homomorphic encryption. In: Proceedings of the 30th Annual Conference on Advances in Cryptology. Berlin: Springer, 2010. 483-501. Google Scholar

[4] Chaum D, Pedersen T. Wallet databases with observers. In: Proceedings of 12th Annual Conference on Advances in Cryptology. Berlin: Springer, 1992. 89-105. Google Scholar

[5] Hohenberger S, Lysyanskaya A. How to securely outsource cryptographic computations. In: Proceedings of the 2nd International Conference on Theory of Cryptography. Berlin: Springer, 2005. 264-282. Google Scholar

[6] Green M, Hohenberger S, Waters B. Outsourcing the decryption of ABE ciphertexts. In: Proceedings of the 20th USENIX Conference on Security. New York: ACM, 2011. 34. Google Scholar

[7] Lai J Z, Deng R H, Guan C W, et al. Attribute-based encryption with verifiable outsourced decryption. IEEE Trans Inf Foren Secur, 2013, 8: 1343-1354 CrossRef Google Scholar

[8] Golle P, Mironov I. Uncheatable distributed computations. In: Proceedings of the Cryptographers' Track at RSA Conference. Berlin: Springer, 2001. 425-440. Google Scholar

[9] Atallah M, Pantazopoulos K, Rice J, et al. Secure outsourcing of scientific computations. Adv Comput, 2001, 54: 216-272. Google Scholar

[10] Boneh D, Franklin M. Identity-based encryption from the Weil pairings. In: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology. London: Springer, 2001. 213-229. Google Scholar

[11] Cha J, Cheon J. An identity-based signature from gap Diffie-Hellman groups. In: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography. London: Springer, 2003. 18-30. Google Scholar

[12] Joux A. A one round protocol for tripartite Diffie-Hellman. In: Proceedings of the 4th International Symposium on Algorithmic Number Theory. London: Springer, 2000. 385-394. Google Scholar

[13] Barreto P, Galbraith S, Heigeartaigh C, et al. Efficient pairing computation on supersingular Abelian varieties. Design Code Cryptogr, 2007, 42: 239-271 CrossRef Google Scholar

[14] Beuchat J, Gonzalez J, Mitsunari S, et al. High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves. In: Proceedings of the 4th International Conference on Pairing-Based Cryptography. Berlin: Springer, 2010. 21-39. Google Scholar

[15] Hess F, Smart N, Vercauteren F. The Eta pairing revisited. IEEE Trans Inf Theory, 2006, 52: 4595-4602 CrossRef Google Scholar

[16] Scott M, Costigan N, Abdulwahab W. Implementing cryptographic pairings on smartcards. In: Proceedings of the 8th International Conference on Cryptographic Hardware and Embedded Systems. Berlin: Springer, 2006. 134-147. Google Scholar

[17] Chevallier-Mames B, Coron J, McCullagh N, et al. Secure delegation of elliptic-curve pairing. In: Proceedings of the 9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Application. Berlin: Springer, 2010. 24-35. Google Scholar

[18] Galbraith S, Paterson K, Smart N. Pairings for cryptographers. Discrete Appl Math, 2008, 156: 3113-3121 CrossRef Google Scholar

[19] Tsang P, Chow S, Smith S. Batch pairing delegation. In: Proceedings of the 2nd International Workshop on Security. Berlin: Springer, 2007. 74-90. Google Scholar

[20] Chow S, Au M, Susilo W. Server-aided signatures verification secure against collusion attack. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2011. 401-405. Google Scholar

[21] Chen X F, Susilo W, Li J, et al. Efficient algorithms for secure outsourcing of bilinear pairings. Theor Comput Sci, 2015, 562: 112-121 CrossRef Google Scholar

[22] Tian H B, Zhang F G, Ren K. Secure bilinear pairing outsourcing made more efficient and flexible. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2015. 417-426. Google Scholar

[23] Boneh D, Franklin M. Identity-based encryption from the Weil pairings. In: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology. London: Springer, 2001. 213-229. Google Scholar

[24] Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairings. In: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security. London: Springer, 2001. 514-532. Google Scholar

[25] Cha J, Cheon J. An identity-based signature from gap Diffie-Hellman groups. In: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography. London: Springer, 2003. 18-30. Google Scholar

[26] Galbraith S, Paterson K, Smart N. Pairings for cryptographers. Discrete Appl Math, 2008, 156: 3113-3121 CrossRef Google Scholar

[27] Sahai A, Waters B. Fuzzy identity-based encryption. In: Proceedings of 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2005. 457-473. Google Scholar

[28] Waters B. Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology. Berlin: Springer, 2009. 619-636. Google Scholar

[29] Boyen X, Waters B. Anonymous hierarchical identity-based encryption (without random oracles). In: Proceedings of the 26th Annual International Conference on Advances in Cryptology. Berlin: Springer, 2006. 290-307. Google Scholar

[30] Paterson K, Schuldt J. Efficient identity-based signatures secure in the standard model. In: Proceedings of the 11th Australasian Conference on Information Security and Privacy. Berlin: Springer, 2006. 207-222. Google Scholar

Copyright 2020  CHINA SCIENCE PUBLISHING & MEDIA LTD.  中国科技出版传媒股份有限公司  版权所有

京ICP备14028887号-23       京公网安备11010102003388号