5G mobile networks are promising to offer mobile users unrivaled experiences with infinite networking capability at any period and from anywhere. However, it appears unnecessary and impractical for the customers and servers to be connected permanently in wireless networks because battery life is a bottleneck in such kind of networks. Therefore, the authorized entity needs to delegate its right to others in order to ensure the services available. This paper aims to address the issue of delegating authentication in 5G networks by proposing a new proxy signature scheme with efficient proxy signing operations. Concretely, we present a new and efficient proxy signature algorithm whose unforgeability can be reduced to the well-known discrete logarithm assumption. In the proposal, the original signer delegates his signing right by signing an exposure-free chameleon hash value on the warrant, and the proxy signer can generate a proxy signature on a message only by calculating a chameleon hash collision between the warrant and the message. This approach is computationally cost-effective for the proxy signer. Further analysis of the new scheme demonstrates that it offers the desirable properties of delegation of signing sights. Copyright © 2015 John Wiley & Sons, Ltd.

References

1Andrews JG, Buzzi S, Choi W, Hanly SV, Lozano AE, Soong ACK, Zhang J. What will 5G be?IEEE Journal on Selected Areas in Communications 2014; 32(6): 1065–1082.
10.1109/JSAC.2014.2328098
Web of Science® Google Scholar
2Mambo M, Usuda K, Okamoto E. Proxy signature: delegation of the power to sign messages. IEICE Transactions on Fundamentals 1996; E79-A(9): 1338–1353.
Google Scholar
3Lee B, Kim H, Kim K. Secure mobile agent using strong non-designated proxy signature. In Processing of ACISP 2001, V Vijay, M Yi (eds)., vol. LNCS 2119. Springer-Verlag, Heidelberg: Sydney, Australia, 2001; 474–486.
10.1007/3-540-47719-5_37
Google Scholar
4Boldyreva A, Palacio A, Warinschi B. Secure proxy signature scheme for delegation of signing rights. Journal of Cryptology 2012; 25(1): 57–115.
10.1007/s00145-010-9082-x
Web of Science® Google Scholar
5Lee JY, Cheon JH, Kim S. An analysis of proxy signatures: is a secure channel necessary? In Processing of CT-RSA 2003, M Joye (ed.)., vol. LNCS 2612. Springer-Verlag, Heidelberg: San Francisco, CA, USA, 2003; 68–79.
10.1007/3-540-36563-X_5
Google Scholar
6Sun Y, Xu C, Yu Y, Mu Y. Strongly unforgeable proxy signature scheme secure in the standard model. Journal of Systems and Software 2011; 84(9): 1471–1479.
10.1016/j.jss.2011.02.041
Web of Science® Google Scholar
7Huang X, Mu Y, Susilo W, Zhang F, Chen X. A short proxy signature scheme: efficient authentication in the ubiquitous world. In Processing of UISW 2005, J Ma, LT Yang (eds)., vol. LNCS 3823. Springer-Verlag, Heidelberg: Nagasaki, Japan, 2005; 480–489.
10.1007/11596042_50
Google Scholar
8Huang X, Mu Y, Susilo W, Wu W. Proxy signatue without random oracles. In Processing of MSN 2006, J Cao, S Ivan, X Jia, SK Das (eds)., vol. LNCS 4325. Springer-Verlag, Heidelbergs: Hong Kong, China, 2006; 473–484.
Google Scholar
9Yu Y, Xu C, Huang X, Mu Y. An efficient anonymous proxy signature scheme with provable security. Computer Standards and Interfaces 2009; 31(2): 348–353.
10.1016/j.csi.2008.05.003
Web of Science® Google Scholar
10Yu Y, Xu C, Zhang X, Liao Y. Designated verifier proxy signature scheme without random oracles. Computers and Mathematics with Applications 2009; 57(8): 1352–1364.
10.1016/j.camwa.2009.01.032
Web of Science® Google Scholar
11Yu Y, Mu Y, Susilo W, Sun Y, Ji Y. Provably secure proxy signature scheme from factorization. Mathematical and Computer Modelling 2012; 55(3-4): 1160–1168.
10.1016/j.mcm.2011.09.040
Web of Science® Google Scholar
12Huang X, Susilo X, Mu Y, Wu W. Secure universal designated verifier signature without random oracles. International Journal of Information Security 2008; 7(3): 171–183.
10.1007/s10207-007-0021-2
Web of Science® Google Scholar
13Huang Q, Yang G, Wong D, Susilo W. Efficient strong designated verifier signature schemes without random oracle or with non-delegatability. International Journal of Information Security 2011; 10(6): 373–385.
10.1007/s10207-011-0146-1
Web of Science® Google Scholar
14Garcia SS, Oliva AG, Belleboni EP, Cruz IP. Solving identity delegation problem in the e-government environment. International Journal of Information Security 2011; 10(6): 351–372.
10.1007/s10207-011-0140-7
Web of Science® Google Scholar
15Krawczyk H, Rabin T. Chameleon hashing and signatures. Proceedings of the Network and Distributed System Security Symposium, NDSS 2000, The Internet Society, 2000; 143–54.
Google Scholar
16Ateniese G, Medeiros B. On the key exposure problem in chameleon hashes. In Processing of SCN 2004, C Blundo, S Cimato (eds)., vol. LNCS 3352. Springer-Verlag, Heidelberg: Amalfi, Italy, 2004; 165–179.
Google Scholar
17Ateniese G, Medeiros B. Identity-based chameleon hash and applications. In Processing of FC 2004, A Juels (ed.)., vol. LNCS 3110. Springer -Verlag, Heidelberg: Key West, Florida, USA, 2004; 164–180.
10.1007/978-3-540-27809-2_19
Google Scholar
18Chen X, Zhang F, Tian H. Efficient generic on-line off-line (threshold) signatures without key exposure. Information Sciences 2008; 178(21): 4192–4203.
10.1016/j.ins.2008.06.022
Web of Science® Google Scholar
19Chen X, Wu Q, Zhang F, Tian H. New receipt-free voting scheme using double-trapdoor commitment. Information Sciences 2011; 181(8): 1493–1502.
10.1016/j.ins.2010.12.012
Web of Science® Google Scholar
20Harn L, Hsin W, Lin C. Efficient on-line/off-line signature schemes based on multiple-collision trapdoor hash families. The Computer Journal 2010; 53(9): 1478–1484.
10.1093/comjnl/bxp044
Web of Science® Google Scholar
21Mehta M, Harn L.Efficient one-time proxy signatures. IEE Proceedings-Communications 2005; 152(2): 129–133.
10.1049/ip-com:20045251
Web of Science® Google Scholar
22Chandrasekhar S, Chakrabarti S, Singhal M, Calvert K. Efficient proxy signatures based on trapdoor hash functions. IET Information Security 2010; 4(4): 322–332.
10.1049/iet-ifs.2009.0204
Web of Science® Google Scholar
23Yu Y, Au MH, Mu Y, Susilo W, Wu H. Secure delegation of signing power from factorization. The Computer Journal 2015; 58(4): 867–877.
10.1093/comjnl/bxt144
Web of Science® Google Scholar
24Schnorr CP. Efficient signature generation by smart cards. Journal of Cryptology 1991; 4(3): 161–174.
10.1007/BF00196725
Google Scholar
25Shoup V. 2008. A computational introduction to number theory and algebra. Cambridge University Press.
Google Scholar
26Pointcheval D, Stern J. Security arguments for digital signatures and blind signatures. Journal of Cryptology 2000; 13(3): 361–396.
10.1007/s001450010003
Web of Science® Google Scholar

Citing Literature

Volume28, Issue4

Combined Special issues on Cloud computing for data‐driven science and engineering (ScienceCloud 2012), Recent advances in security and privacy in large‐scale networks (LSNS 2014) and Intelligent Distributed Computing (IDC 2014)

25 March 2016

Pages 1193-1203

Delegation of signing rights for emerging 5G networks^†

Summary

References

Citing Literature

References

Information

About Wiley Online Library

Help & Support

Opportunities

Connect with Wiley

Delegation of signing rights for emerging 5G networks†

Summary

References

Citing Literature

References

Related

Information

Delegation of signing rights for emerging 5G networks^†