An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain

IEEE Access

Volumn 6, Issue , 2018, Pages 20632-20640

  Lin, Qun ^a   Yan, Hongyang ^b   Huang, Zhengan ^c   Chen, Wenbin ^c   Shen, Jian ^d   Tang, Yi ^c  

^a HANSHAN NORMAL UNIVERSITY   (China)

^b NANKAI UNIVERSITY   (China)

^c GUANGZHOU UNIVERSITY   (China)

^d NANJING UNIVERSITY OF INFORMATION SCIENCE AND TECHNOLOGY   (China)

Author keywords

bilinear pairings; homomorphic signature; ID based signature; random oracle

Indexed keywords

BLOCKCHAIN; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC MAIL; PUBLIC KEY CRYPTOGRAPHY;

ADAPTATION MODELS; BILINEAR PAIRING; GAMES; HOMOMORPHIC SIGNATURE; ID BASED SIGNATURE; IDENTITY BASED ENCRYPTION; RANDOM ORACLE;

AUTHENTICATION;

EID: 85042715169     PISSN: None     EISSN: 21693536     Source Type: Journal    
DOI: 10.1109/ACCESS.2018.2809426     Document Type: Article

References (41)

1. A. Shamir, "Identity-based cryptosystems and signature schemes," Crypto, vol. 84, pp. 47-53, Aug. 1984.
2. R. Johnson, D. Molnar, D. Song, and D. Song, "Homomorphic sig-nature schemes," in Topics in Cryptology-CT-RSA (Lecture Notes in Computer Science), vol 2271. Berlin, Germany: Springer, 2002, pp. 244-262.
3. Z. Huang, S. Liu, X. Mao, K. Chen, and J. Li, "Insight of the protection for data security under selective opening attacks," Inf. Sci., vols. 412-413, pp. 223-241, Oct. 2017.
4. J. Li, X. Chen, M. Li, J. Li, P. P. C. Lee, andW. Lou, "Secure deduplication with efficient and reliable convergent key management," IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 6, pp. 1615-1625, Jun. 2014.
5. W. Chen et al., "Inapproximability results for the minimum integral solu-tion problem with preprocessing over l1 norm," Theor. Comput. Sci., vol. 478, pp. 127-131, Mar. 2013.
6. W. Chen et al., "An improved lower bound for approximating the minimum integral solution problem with preprocessing over l1norm," J. Combinat. Optim., vol. 30, no. 3, pp. 447-455, 2015.
7. D. M. Freeman, "Improved security for linearly homomorphic signa-tures: A generic framework," in Public Key Cryptography-PKC (Lecture Notes in Computer Science), vol 7293. Berlin, Germany: Springer, 2012, pp. 697-714.
8. D. Boneh, D. Freeman, J. Katz, and B.Waters, "Signing a linear subspace: Signature schemes for network coding," in Public Key Cryptography-PKC (Lecture Notes in Computer Science), vol. 5443. Berlin, Germany: Springer, 2009, pp. 68-87.
9. J. Li, Y. K. Li, X. Chen, P. P. C. Lee, andW. Lou, "A hybrid cloud approach for secure authorized deduplication," IEEE Trans. Parallel Distrib. Syst., vol. 26, no. 5, pp. 1206-1216, May 2015.
10. J. Li et al., "Secure distributed deduplication systems with improved reli-ability," IEEE Trans. Comput., vol. 64, no. 12, pp. 3569-3579, Dec. 2015.
11. J. Choon and J. Cheon, "An identity-based signature from gap Diffie-Hellman groups," in Proc. Int. Workshop Public Key Cryptogr., 2003, pp. 18-30.
12. D. Boneh and D. Freeman, "Homomorphic signatures for polynomial functions," in Advances in Cryptology-EUROCRYPT (Lecture Notes in Computer Science), vol. 6632. Berlin, Germany: Springer, 2011, pp. 149-168.
13. N. Attrapadung and B. Libert, "Homomorphic network coding signa-tures in the standard model," in Public Key Cryptography-PKC (Lecture Notes in Computer Science), vol 6571. Berlin, Germany: Springer, 2011, pp. 17-34.
14. D. Catalano, D. Fiore, and B. Warinschi, "Homomorphic signatures with efficient verification for polynomial functions," in Advances in Cryptology-CRYPTO (Lecture Notes in Computer Science), vol 8616. Berlin, Germany: Springer, 2014, pp. 371-389.
15. R. Hiromasa, Y. Manabe, and T. Okamoto, "Homomorphic signatures for polynomial functions with shorter signatures," in Proc. 30th Symp. Cryptogr. Inf. Secur., Kyoto, Japan, 2013, pp. 1-8.
16. J. Li, Y. Zhang, X. Chen, and Y. Xiang, "Secure attribute-based data sharing for resource-limited users in cloud computing," Comput. Secur., vol. 72, pp. 1-12, Jan. 2018, doi: 10.1016/j.cose.2017.08.007.
17. X. Boyen, X. Fan, and E. Shi, "Adaptively secure fully homo-morphic signatures based on lattices," IACR Cryptol. ePrint Arch., Tech. Rep. 2014/916, 2014.
18. P. Li, J. Li, Z. Huang, C.-Z. Gao, W.-B. Chen, and K. Chen, "Privacy-preserving outsourced classification in cloud computing," in Clus-ter Computing. New York, NY, USA: Springer, 2017, pp. 1-10, doi: 10.1007/s10586-017-0849-9.
19. S. Gorbunov, V. Vaikuntanathan, and D. Wichs, "Leveled fully homo-morphic signatures from standard lattices," IACR Cryptol. ePrint Arch., Tech. Rep. 2014/897, 2014. [Online]. Available: http://eprint.iacr.org/
20. N. Attrapadung, B. Libert, and T. Peters, "Efficient completely context-hiding quotable and linearly homomorphic signatures," in Public-Key Cryptography-PKC (Lecture Notes in Computer Science), vol 7778. Berlin, Germany: Springer, 2013, pp. 386-404.
21. J. Li, J. Li, X. Chen, C. Jia, and W. Lou, "Identity-based encryption with outsourced revocation in cloud computing," IEEE Trans. Comput., vol. 64, no. 2, pp. 425-437, Feb. 2015.
22. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing," in Advances in Cryptology-ASIACRYPT (Lecture Notes in Computer Science), vol 2248. Berlin, Germany: Springer, 2001, pp. 514-532.
23. D. Boneh and D. Freeman, "Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures," in Public Key Cryptography-PKC (Lecture Notes in Computer Science), vol 6571. Berlin, Germany: Springer, 2011, pp. 1-16.
24. D. Catalano, A. Marcedone, and O. Puglisi, "Authenticating computation on groups: New homomorphic primitives and applications," in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Secur., 2014, pp. 193-212.
25. N. Attrapadung, B. Libert, and T. Peters, "Computing on authenti-cated data: New privacy definitions and constructions," in Advances in Cryptology-ASIACRYPT (Lecture Notes in Computer Science), vol 7658. Berlin, Germany: Springer, 2012, pp. 367-385.
26. W. Chen, H. Lei, and K. Qi, "Lattice-based linearly homomorphic signa-tures in the standard model," Theor. Comput. Sci., vol. 634, pp. 47-54, Jun. 2016.
27. P. Li et al., "Multi-key privacy-preserving deep learning in cloud comput-ing," Future Generat. Comput. Syst., vol. 74, pp. 76-85, Sep. 2017.
28. J.-D. Wu, Y.-M. Tseng, and S.-S. Huang, "Leakage-resilient ID-based signature scheme in the generic bilinear group model," Secur. Commun. Netw., vol. 9, no. 17, pp. 3987-4001, 2016.
29. P. Sarde and A. Banerjee, "Asecure ID-based proxy signature scheme from bilinear pairings," Int. J. Comput. Appl., vol. 124, no. 9, pp. 1-4, 2015.
30. D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing," SIAM J. Comput., vol. 32, no. 3, pp. 586-615, 2003.
31. C. Meshram, "An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem," Inf. Pro-cess. Lett., vol. 115, no. 2, pp. 351-358, 2015.
32. G. Schmid and F. Rossi, "Implementing identity-based key agreement in embedded devices," in Proc. Int. Conf. Pervasive Embedded Comput. Commun. Syst., 2016, pp. 1-7.
33. P. Sarkar and M. Chowdhury, "Inductive hierarchical identity based key agreement with pre-deployment interactions," in Proc. Int. Conf. Appl. Techn. Inf. Secur., 2016, pp. 106-114.
34. Y. Zhang, Y. Jiang, B. Li, and M. Zhang, "An efficient identity-based homomorphic signature scheme for network coding," in Proc. Int. Conf. Emerg. Internetwork., Data Web Technol., 2017, pp. 524-531.
35. S. Sadrhaghighi and S. Khorsandi, "An identity-based digital signature scheme to detect pollution attacks in intra-session network coding," in Proc. 13th Int. Iranian Soc. Cryptol. Conf. Inf. Secur. Cryptol. (ISCISC), 2016, pp. 7-12.
36. J. Li, Z. Liu, X. Chen, "L-EncDB: A lightweight framework for privacy-preserving data queries in cloud computing," Knowl.-Based Syst., vol. 79, pp. 18-26, May 2015.
37. F. Wang, K. Wang, B. Li, and Y. Gao, "Leveled strongly-unforgeable identity-based fully homomorphic signatures," in Proc. ISC, 2015, pp. 42-60.
38. D. Catalano, "Homomorphic signatures and message authentication codes," in Security and Cryptography for Networks (Lecture Notes in Computer Science), vol 8642. Cham, Switzerland: Springer, 2014, pp. 514-519.
39. D. Catalano, D. Fiore, and B. Warinschi, "Adaptive pseudo-free groups and applications," in Advances in Cryptology-EUROCRYPT (Lecture Notes in Computer Science), vol 6632. Berlin, Germany: Springer, 2011, pp. 207-223.
40. D. Charles, K. Jain, and K. Lauter, "Signatures for network coding," Int. J. Inf. Coding Theory, vol. 1, no. 1, pp. 3-14, Mar. 2009.
41. R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin, "Secure network coding over the integers," in Public Key Cryptography-PKC (Lecture Notes in Computer Science), vol 6056. Berlin, Germany: Springer, 2010, pp. 142-160.