Traceable Anonymous Single Sign on Scheme on Lattice

Tang Yongli; Li Ying; Zhao Zongqu; Li Xingyu; Wang Hanbo

doi:10.7544/issn1000-1239.202111235

Journal of Computer Research and Development > 2023 > 60(6): 1417-1430. > DOI: 10.7544/issn1000-1239.202111235 CSTR: 32373.14.issn1000-1239.202111235

Tang Yongli, Li Ying, Zhao Zongqu, Li Xingyu, Wang Hanbo. Traceable Anonymous Single Sign on Scheme on Lattice[J]. Journal of Computer Research and Development, 2023, 60(6): 1417-1430. DOI: 10.7544/issn1000-1239.202111235

Citation:

PDF (1815 KB)

Traceable Anonymous Single Sign on Scheme on Lattice

School of Software, Henan Polytechnic University, Jiaozuo, Henan 454003

Funds: This work was supported by the National Natural Science Foundation of China (61802117), the Youth Backbone Teacher Support Program of Henan Polytechnic University (2018XQG-10), and the Support Plan Program of Scientific and Technological Innovation Team in University of Henan Province (20IRTSTHN013).

More Information

Author Bio:
Tang Yongli: born in 1972. PhD, professor. Senior member of CCF. His main research interests include information security, computer network, and cryptography

Li Ying: born in 1998. Master candidate. Her main research interests include information security and cryptography

Zhao Zongqu: born in 1974. PhD, lecturer. His main research interests include information security, cryptography, and malicious code analysis

Li Xingyu: born in 1998. Master candidate. His main research interests include information security and malicious code analysis

Wang Hanbo: born in 1997. Master candidate. His main research interests include information security and cryptography
Received Date: December 14, 2021
Revised Date: August 16, 2022
Available Online: March 20, 2023

Graphical Abstract

Abstract

Abstract

The single sign on (SSO) scheme can avoid the waste of resources and information leakage caused by the redundancy of authentication module, and the anonymous single sign on can realize anonymous authentication and authorization under the condition of protecting personal privacy. However, the existing anonymous single sign on schemes do not consider the accountability of fraud caused by the anonymity of users. For this problem, a traceable anonymous single sign on scheme on lattice is proposed. The proposed scheme uses the identity-based cryptosystem on lattice to alleviate the problem of public key certificate management, and realizes the anonymous authentication of the user through the authorized authentication tag and pseudonym. Then, the strong designated verifier technology is used to realize the directional verification of user service requests. And the trusted organization is introduced to recover the user's identity and pursue responsibility through the public key. The proposed scheme is proved to have unlinkability, unforgeability and traceability under the security model. The security and performance analysis results show that under PARMS II and PARMS III, our scheme can generate the access service tickets for 4 service requests by running for about 75 ms and 108 ms respectively. And it can reach the quantum security strength of 230 b and 292 b.
- single sign on,
- traceability,
- anonymous authentication,
- inhomogeneous small integer solution,
- identity-based cryptosystem

FullText(HTML)

References (34)

References

[1]	Wu T S, Hsu C L. Efficient user identification scheme with key distribution preserving anonymity for distributed computer networks[J]. Computers and Security, 2004, 23(2): 120−125 doi: 10.1016/j.cose.2003.09.005
[2]	Mangipudi K, Katti R. A secure identification and key agreement protocol with user anonymity[J]. Computers and Security, 2006, 25(6): 420−425 doi: 10.1016/j.cose.2006.05.002
[3]	Chang C C, Lee C Y. A secure single sign-on mechanism for distributed computer networks[J]. IEEE Transactions on Industrial Electronics, 2012, 59(1): 629−637 doi: 10.1109/TIE.2011.2130500
[4]	Wang Guilin, Yu Jiangshan, Xie Qi. Security analysis of a single sign-on mechanism for distributed computer networks[J]. IEEE Transactions on Industrial Informatics, 2013, 9(1): 294−302 doi: 10.1109/TII.2012.2215877
[5]	Wen C K, Shih P W, Huang Y C, et al. An anonymous and authentication protocol for multi-server[J]. Information Technology and Control, 2017, 46(2): 235−245
[6]	Gope P, Das A K. Robust anonymous mutual authentication scheme for n-times ubiquitous mobile cloud computing services[J]. IEEE Internet of Things Journal, 2017, 4(5): 1764−1772 doi: 10.1109/JIOT.2017.2723915
[7]	Lee T F. Provably secure anonymous single-sign-on authentication mechanisms using extended Chebyshev chaotic maps for distributed computer networks[J]. IEEE Systems Journal, 2018, 12(2): 1499−1505 doi: 10.1109/JSYST.2015.2471095
[8]	Jegadeesan S, Azees M, Kumar P M, et al. An efficient anonymous mutual authentication technique for providing secure communication in mobile cloud computing for smart city applications[J]. Sustainable Cities and Society, 2019, 49: 101522−101528 doi: 10.1016/j.scs.2019.101522
[9]	Jia Xiaoying, He Debiao, Kumar N, et al. A provably secure and efficient identity-based anonymous authentication scheme for mobile edge computing[J]. IEEE Systems Journal, 2019, 14(1): 560−571
[10]	Elmufti K, Weerasinghe D, Rajarajan M, et al. Anonymous authentication for mobile single sign-on to protect user privacy[J]. International Journal of Mobile Communications, 2008, 6(6): 760−769 doi: 10.1504/IJMC.2008.019824
[11]	Mahor V K, Padmavathi R, Chatterjee S, et al. A secure three factor-based fully anonymous user authentication protocol for multi-server environment[J]. International Journal of Ad Hoc and Ubiquitous Computing, 2020, 34(1): 45−60 doi: 10.1504/IJAHUC.2020.107506
[12]	Kim H J, Lee I Y. A study on a secure single sign-on for user authentication information privacy in distributed computing environment[J]. International Journal of Communication Networks and Distributed Systems, 2017, 19(1): 28−45 doi: 10.1504/IJCNDS.2017.085433
[13]	He Debiao, Zeadally S, Kumar N, et al. Efficient and anonymous mobile user authentication protocol using self-certified public key cryptography for multi-server architectures[J]. IEEE Transactions on Information Forensics & Security, 2016, 11(9): 2052−2064
[14]	Han Jinguang, Chen Liqun, Schneider S, et al. Anonymous single-sign-on for n designated services with traceability[G] //LNCS 11098: Proc of the 23rd European Symp on Research in Computer Security. Cham, Switzerland: Springer, 2018: 470−490
[15]	He Lei, Ma Jianfeng, Shen Limin, et al. Certificateless designated verifier proxy signature scheme for unmanned aerial vehicle networks[J]. Science China Information Sciences, 2021, 64(1): 1−15
[16]	Yang Xiaodong, Chen Guilan, Li Ting, et al. Strong designated verifier signature scheme with undeniability and strong unforgeability in the standard model[J]. Applied Sciences, 2019, 9(10): 2062−2080 doi: 10.3390/app9102062
[17]	Han Shu, Xie Mande, Yang Bailin, et al. A certificateless verifiable strong designated verifier signature scheme[J]. IEEE Access, 2019, 7: 126391−126408 doi: 10.1109/ACCESS.2019.2938898
[18]	Chen Jing, Chen Jiong, He Kun, et al. SeCrowd: Efficient secure interactive crowdsourcing via permission-based signatures[J]. Future Generation Computer Systems, 2021, 115(6): 448−458
[19]	Han Jinguang, Chen Liqun, Schneider S, et al. Anonymous single-sign-on with proxy re-verification[J]. IEEE Transactions on Information Forensics and Security, 2020, 15(1): 223−236
[20]	Zhang Zhiyi, Król M, Sonnino A, et al. EL PASSO: Efficient and lightweight privacy-preserving single sign on[J]. Proceedings on Privacy Enhancing Technologies, 2021, 2021(2): 70−87 doi: 10.2478/popets-2021-0018
[21]	Pointcheval D, Sanders O. Reassessing security of randomizable signatures[G] //LNCS 10808: Proc of Cryptographers’Track at the RSA Conf. Cham, Switzerland: Springer, 2018: 319−338
[22]	Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Review, 1999, 41(2): 303−332 doi: 10.1137/S0036144598347011
[23]	Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings[G] //LNCS 6110: Proc of the 29th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2010: 1−23
[24]	Cai Jie, Jiang Han, Zhang Pingyuan, et al. ID-based strong designated verifier signature over R-SIS assumption[J]. Security and Communication Networks, 2019, 2019: 1−8
[25]	Wang Qingxuan, Wang Ding, Cheng Chi, et al. Quantum2FA: Efficient quantum-resistant two-factor authentication scheme for mobile devices[J]. IEEE Transactions on Dependable and Secure Computing, 2021, 99: 1−16
[26]	Li Zengpeng, Wang Ding, Morais E. Quantum-safe round-optimal password authentication for mobile devices[J]. IEEE Transactions on Dependable and Secure Computing, 2020, 19(3): 1885−1899
[27]	Liu Hui, Sun Yining, Xu Yan, et al. A secure lattice-based anonymous authentication scheme for VANETs[J]. Journal of the Chinese Institute of Engineers, 2019, 42(1): 66−73 doi: 10.1080/02533839.2018.1537804
[28]	Libert B, Ling San, Nguyen K, et al. Zero-knowledge arguments for lattice-based accumulators: Logarithmic-size ring signatures and group signatures without trapdoors[G] //LNCS 9666: Proc of the 35th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2016: 1−31
[29]	Wang Ding, Wang Ping. Two birds with one stone: Two-factor authentication with security beyond conventional bound[J]. IEEE Transactions on Dependable and Secure Computing, 2016, 15(4): 708−722
[30]	Qiu Shuming, Wang Ding, Xu Guoai, et al. Practical and provably secure three-factor authentication protocol based on extended chaotic-maps for mobile lightweight devices[J]. IEEE Transactions on Dependable and Secure Computing, 2020, 19(2): 1338−1351
[31]	Hsu C L, Chuang Y H. A novel user identification scheme with key distribution preserving user anonymity for distributed computer networks[J]. Information Sciences, 2009, 179(4): 422−429 doi: 10.1016/j.ins.2008.10.006
[32]	侯琬钰,孙钰,李大伟,等. 基于PUF的5G车联网V2V匿名认证与密钥协商协议[J]. 计算机研究与发展,2021,58(10):2265−2277 doi: 10.7544/issn1000-1239.2021.20210486 Hou Wanyu, Sun Yu, Li Dawei, et al. Anonymous authentication and key agreement protocol for 5G-V2V based on PUF[J]. Journal of Computer Research and Development, 2021, 58(10): 2265−2277 (in Chinese) doi: 10.7544/issn1000-1239.2021.20210486
[33]	Lenstra A K. Unbelievable security matching AES security using public key systems[G] //LNCS 2248: Proc of the 7th Int Conf on the Theory and Application of Cryptology and Information Security. Berlin: Springer, 2001: 67−86
[34]	Schnorr C P, Euchner M. Lattice basis reduction: Improved practical algorithms and solving subset sum problems[J]. Mathematical Programming, 1994, 66(1): 181−199

[1]	Xue Zhihang, Xu Zheming, Lang Congyan, Feng Songhe, Wang Tao, Li Yidong. Text-to-Image Generation Method Based on Image-Text Semantic Consistency[J]. Journal of Computer Research and Development, 2023, 60(9): 2180-2190. DOI: 10.7544/issn1000-1239.202220416
[2]	Zhang Jing, Ju Jialiang, Ren Yonggong. Double-Generators Network for Data-Free Knowledge Distillation[J]. Journal of Computer Research and Development, 2023, 60(7): 1615-1627. DOI: 10.7544/issn1000-1239.202220024
[3]	Zhang Hao, Ma Jiayi, Fan Fan, Huang Jun, Ma Yong. Infrared and Visible Image Fusion Based on Multiclassification Adversarial Mechanism in Feature Space[J]. Journal of Computer Research and Development, 2023, 60(3): 690-704. DOI: 10.7544/issn1000-1239.202110639
[4]	Liu Guangrui, Zhang Weizhe, Li Xinjie. Data Contamination Defense Method for Intelligent Network Intrusion Detection Systems Based on Edge Examples[J]. Journal of Computer Research and Development, 2022, 59(10): 2348-2361. DOI: 10.7544/issn1000-1239.20220509
[5]	Guo Zhengshan, Zuo Jie, Duan Lei, Li Renhao, He Chengxin, Xiao Yingjie, Wang Peiyan. A Generative Adversarial Negative Sampling Method for Knowledge Hypergraph Link Prediction[J]. Journal of Computer Research and Development, 2022, 59(8): 1742-1756. DOI: 10.7544/issn1000-1239.20220074
[6]	Chen Dawei, Fu Anmin, Zhou Chunyi, Chen Zhenzhu. Federated Learning Backdoor Attack Scheme Based on Generative Adversarial Network[J]. Journal of Computer Research and Development, 2021, 58(11): 2364-2373. DOI: 10.7544/issn1000-1239.2021.20210659
[7]	Dai Hong, Sheng Lijie, Miao Qiguang. Adversarial Discriminative Domain Adaptation Algorithm with CapsNet[J]. Journal of Computer Research and Development, 2021, 58(9): 1997-2012. DOI: 10.7544/issn1000-1239.2021.20200569
[8]	Qian Yaguan, He Niannian, Guo Yankai, Wang Bin, Li Hui, Gu Zhaoquan, Zhang Xuhong, Wu Chunming. An Evasion Algorithm to Fool Fingerprint Detector for Deep Neural Networks[J]. Journal of Computer Research and Development, 2021, 58(5): 1106-1117. DOI: 10.7544/issn1000-1239.2021.20200903
[9]	Yu Haitao, Yang Xiaoshan, Xu Changsheng. Antagonistic Video Generation Method Based on Multimodal Input[J]. Journal of Computer Research and Development, 2020, 57(7): 1522-1530. DOI: 10.7544/issn1000-1239.2020.20190479
[10]	Tian Jiwei, Wang Jinsong, Shi Kai. Positive and Unlabeled Generative Adversarial Network on POI Positioning[J]. Journal of Computer Research and Development, 2019, 56(9): 1843-1850. DOI: 10.7544/issn1000-1239.2019.20180847