Multimedia Tools and Applications

, Volume 78, Issue 3, pp 3511–3528 | Cite as

Lattice based signature with outsourced revocation for Multimedia Social Networks in cloud computing

  • Faguo Wu
  • Wang Yao
  • Xiao ZhangEmail author
  • Zhiming Zheng


Identity-based signature schemes enable any pair of users to communicate securely and to verify each other’s identity without exchanging private or public keys, without keeping key directories, and without using the services of a third party. Such paradigms are very suitable for an emerging scenario of Multimedia Social Networks (MSNs), in which there are a large number of users, dynamic interaction and huge content sharing. A revocable identity-based signature(RIBS) scheme, proposed by Tsai et al., provides a revocation mechanism for controlling user’s access dynamically. To capture a realistic and efficient scenario, In 2017, XiaoYing Jia et al. introduced an additional important component, called Cloud Revocation Server(CRS), where most of the computations needed during key-updates are of loaded to the CRS. With the surprising development of quantum computation technology in recent years, IBS schemes mentioned above, based on conventional number theory problem, would become vulnerable. Recently, lattice-based cryptography schemes were proved to be secure against quantum attacks. Although such efficient RIBS scheme based on Computational Diffle-Hellam Problem(CDH) assumption has been proposed, all the lattice-based RIBS do not achieve this realistic and efficient property. In this paper, we propose the first lattice-based RIBS with outsourced Cloud Service Provider(CSP). In our scheme, a user’s private key is composed of both an partial private key and a time update key. The time update key is periodically updated by CSP and is transmitted over a public channel. Based on the hardness assumption of Short Integer Solution (SIS), we demonstrate that the proposed lattice-based RIBS scheme with outsourced revocation in cloud computing provides existential unforgeability against adaptive chosen-message attacks in the random oracle. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of energy consumption, signature size, signing key size, and the revocation mechanism with public channels. As the underlying lattice problem is intractable even for quantum computers, our scheme would work well in the quantum age.


Identity-based signature Multimedia Social Networks Revocation Outsourced computation Lattice-based 



This work was supported by NSFC (61402030), the Major Program of National Natural Science Foundation of China (11290141),and Fundamental Research of Civil Aircraft no. MJ-F-2012-04.


  1. 1.
    Ajtai M (1996) Generating hard instances of lattice problems. In: 28th ACM symposium on theory of computing, pp 99–108Google Scholar
  2. 2.
    Alwen J, Peikert C (2011) Generating shorter bases for hard random lattices. Theory Comput Syst 48(3):535MathSciNetCrossRefGoogle Scholar
  3. 3.
    Alzain MA, Li AS, Soh B, Pardede E (2015) Multi-cloud data management using Shamir’s secret sharing and quantum byzantine agreement schemes. Int J Cloud Appl Comput 5(3):35Google Scholar
  4. 4.
    Atawneh S, Almomani A, Bazar HA, Sumari P, Gupta B (2017) Secure and imperceptible digital image steganographic algorithm based on diamond encoding in DWT domain. Multimed Tools Appl 76(18):18451CrossRefGoogle Scholar
  5. 5.
    Boldyreva A, Goyal V, Kumar V (2008) Identity-based encryption with efficient revocation. In: ACM conference on computer and communications security, pp 417–426Google Scholar
  6. 6.
    Boneh D, Franklin M (2001) Identity based encryption from the Weil pairing. Grypto 32(3):213MathSciNetzbMATHGoogle Scholar
  7. 7.
    Dan B, Franklin M (2003) Identity-Based encryption from the weil pairing. Society for Industrial and Applied Mathematics, PhiladelphiazbMATHGoogle Scholar
  8. 8.
    Feng B, Liu J (2017) Practical Identity-based authentication protocol for ad-hoc networks. In: IEEE international conference on software engineering and service scienceGoogle Scholar
  9. 9.
    Gao Y, Zeng P, Choo KKR, Song F (2016) An improved online/offline identity-based signature scheme for WSNs. Int J Netw Secur 18(6):1143Google Scholar
  10. 10.
    Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions, pp 197–206Google Scholar
  11. 11.
    Gupta S, Gupta BB (2016) XSS-Secure as a service for the platforms of online social network-based multimedia web applications in cloud. Multimed Tools Appl 77:1–33Google Scholar
  12. 12.
    Gupta B, Agrawal DP, Yamaguchi S (2016) Handbook of research on modern cryptographic solutions for computer and cyber security. IGI GlobalGoogle Scholar
  13. 13.
    He D, Wang H, Zhang J, Wang L (2017) Insecurity of an identity-based public auditing protocol for the outsourced data in cloud storage. Inf Sci 375:48CrossRefGoogle Scholar
  14. 14.
    Hung YH, Tseng YM, Huang SS (2017) Revocable ID-based signature with short size over lattices. Security and Communication Networks 2017(10):1CrossRefGoogle Scholar
  15. 15.
    Jararweh Y, Al-Ayyoub M, Fakirah M, Alawneh L, Gupta BB (2017) Improving the performance of the needleman-wunsch algorithm using parallelization and vectorization techniques. Multimed Tools Appl 2017(3):1Google Scholar
  16. 16.
    Jia X, He D, Zeadally S, Li L (2017) Efficient revocable ID-based signature with cloud revocation server. IEEE Access PP(99):1CrossRefGoogle Scholar
  17. 17.
    Li J, Li J, Chen X, Jia C, Lou W (2015) Identity-based encryption with outsourced revocation in cloud computing. IEEE Trans Comput 64(2):425MathSciNetCrossRefGoogle Scholar
  18. 18.
    Lu Y, Wang G, Li J, Shen J (2017) Efficient designated server identity-based encryption with conjunctive keyword search. Ann Telecommun 72:1–12CrossRefGoogle Scholar
  19. 19.
    Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, New York, pp 738–755Google Scholar
  20. 20.
    Micciancio D, Regev O (2004) Worst-case to average-case reductions based on Gaussian measures. In: IEEE symposium on foundations of computer science, pp 372–381Google Scholar
  21. 21.
    Shamir A (1984) Identity-based cryptosystems and signature schemes. Springer, BerlinzbMATHGoogle Scholar
  22. 22.
    Shor PW (1999) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In: Quantum entanglement and quantum information–proceedings of ccast, pp 303–332Google Scholar
  23. 23.
    Tian M, Huang L (2014) Efficient identity-based signature from lattices. Springer, BerlinCrossRefGoogle Scholar
  24. 24.
    Tian M, Huang L, Yang W (2013) Efficient hierarchical identity-based signatures from lattices. Int J Electron Secur Digit Forens 5(1):1CrossRefGoogle Scholar
  25. 25.
    Tseng YM, Tsai TT, Huang SS, Huang CP (2016) Identity-based encryption with cloud revocation authority and its applications. In: IEEE transactions on cloud computing, pp 1–1Google Scholar
  26. 26.
    Tseng YM, Tsai TT, Huang SS, Huang CP (2017) Identity-based encryption with cloud revocation authority and its applications. IEEE Trans Cloud Comput PP (99):1CrossRefGoogle Scholar
  27. 27.
    Wang Z (2017) An identity-based data aggregation protocol for the smart grid. IEEE Trans Ind Inf PP(99):1Google Scholar
  28. 28.
    Wang F, Liu ZH, Wang C (2016) Full secure identity-based encryption scheme with short public key size over lattices in the standard model. Taylor & Francis, New YorkCrossRefGoogle Scholar
  29. 29.
    Wei Z, Yang Y, Wu Y, Weng J, Deng RH (2017) HIBS-KS haring: hierarchical identity-based signature key sharing for automotive. IEEE Access 5(99):16314CrossRefGoogle Scholar
  30. 30.
    Xiang X (2015) Adaptive secure revocable identity-based signature scheme over lattices. Comput Eng 41(10):126Google Scholar
  31. 31.
    Xinyin X (2015) Adaptive secure revocable identity-based signature scheme over lattices. Comput Eng 10:025Google Scholar
  32. 32.
    Zhang ZY, Pei QQ, Yang L, Ma JF (2009) Attestation proxy party-supported remote attestation model and its secure protocol. J Xidian Univ 36:58–63Google Scholar
  33. 33.
    Zhang Q, Zhang Q, Zhongmei MA, Tan Y (2014) An authenticated asymmetric group key agreement for imbalanced mobile networks. Chin J Electron 23(4):827Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Faguo Wu
    • 1
    • 2
    • 3
  • Wang Yao
    • 1
    • 2
    • 3
  • Xiao Zhang
    • 1
    • 2
    • 3
    Email author
  • Zhiming Zheng
    • 1
    • 2
    • 3
  1. 1.School of Mathematics and Systems ScienceBeihang UniversityBeijingChina
  2. 2.Key Laboratory of Mathematics, Informatics and Behavioral SemanticsMinistry of EducationBeijingChina
  3. 3.Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijingChina

Personalised recommendations