Abstract
In this paper, we propose a novel lattice-based linkable ring signature scheme based on the Borromean ring signature. In our scheme, to avoid the extra overhead caused by reject sampling that used in the existing schemes, we use an exact indistinguishable distribution to replace it. Using our method, signature will be successfully generated without repeating, so the size of the signature can be reduced. Furthermore, our scheme can be extended to multiple layers easily. We also propose a lattice-based multilayer linkable ring signature scheme which can be use for transactions with multiple inputs. Then, we prove that our scheme has unforgeability, anonymity, linkability and non-slanderability that a linkable ring signature scheme should have. Efficiency analysis shows that our scheme has a smaller signature size under the same security conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data availability
No data were used to support this study.
References
Albrecht MR, Deo A (2017) Large modulus ring-LWE \(\ge \) Module-LWE. In: International conference on the theory and application of cryptology and information security (Springer), pp. 267–296
Au MH, Chow SS, Susilo W, Tsang PP (2006) Short linkable ring signatures revisited. In: European public key infrastructure workshop (Springer), pp. 101–115
Au MH, Liu JK, Susilo W, Yuen TH (2007) Certificate based (linkable) ring signature. In: International conference on information security practice and experience (Springer), pp. 79–92
Au MH, Liu JK, Susilo W, Yuen TH (2013) Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction. Theor Comput Sci 469:1
Baum C, Lin H, Oechsner S (2018) Towards practical lattice-based one-time linkable ring signatures. In: International conference on information and communications security (Springer), pp. 303–322
Bender A, Katz J, Morselli R (2006) Ring signatures: stronger definitions, and constructions without random oracles. In: Theory of cryptography conference (Springer), pp. 60–79
Bos J, Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schanck JM, Schwabe P, Seiler G, Stehlé D (2018) CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European symposium on security and privacy (EuroS&P) (IEEE), pp. 353–367
Brakerski Z, Kalai YT (2010) A framework for efficient signatures, ring signatures and identity based encryption in the standard model. IACR Cryptol Arch 1:86
Dodis Y, Kiayias A, Nicolosi A, Shoup V (2004) Anonymous identification in ad hoc groups. In: International conference on the theory and applications of cryptographic techniques (Springer), pp. 609–626
Ducas L, Durmus A, Lepoint T, Lyubashevsky V (2013) Lattice signatures and bimodal Gaussians. In: Annual cryptology conference (Springer), pp. 40–56
Esgin MF, Steinfeld R, Sakzad A, Liu JK, Liu D (2019) Short lattice-based one-out-of-many proofs and applications to ring signatures. In: International conference on applied cryptography and network security (Springer), pp. 67–88
Franklin MK, Zhang H (2012) A framework for unique ring signatures. IACR Cryptology ePrint Archive, p 577
Fujisaki E, Suzuki K (2007) Traceable ring signature. In: International workshop on public key cryptography (Springer), pp. 181–200
García-Gil D, Luque-Sánchez F, Luengo J, García S, Herrera F (2019) From big to smart data: iterative ensemble filter for noise filtering in Big Data classification. Int J Intell Syst 34(12):3260. https://doi.org/10.1002/int.22193
Jiang N, Xu D, Zhou J, Yan H, Wan T, Zheng J (2020) Toward optimal participant decisions with voting-based incentive model for crowd sensing. Inf Sci 512:1
Langlois A, Stehlé D (2015) Worst-case to average-case reductions for module lattices. Des Codes Cryptogr 75(3):565
Li X, Niu JW, Ma J, Wang WD, Liu CL (2011) Cryptanalysis and improvement of a biometrics-based remote user authentication scheme using smart cards. J Netw Comput Appl 34(1):73
Li X, Niu J, Khurram Khan M, Liao J (2013) An enhanced smart card based remote user password authentication scheme. J Netw Comput Appl 36(5):1365. Doi: 10.1016/j.jnca.2013.02.034. http://www.sciencedirect.com/science/article/pii/S1084804513000726
Li J, Wang X, Huang Z, Wang L, Xiang Y (2019) Multi-level multi-secret sharing scheme for decentralized e-voting in cloud computing. J Parallel Distrib Comput 130:91
Li T, Chen Y, Wang Y, Wang Y, Zhao M, Zhu H, Tian Y, Yu X, Yang Y (2020) Rational protocols and attacks in blockchain system. Secur Commun Netw. https://doi.org/10.1155/2020/8839047
Libert B, Ling S, Nguyen K, Wang H (2016) Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Annual international conference on the theory and applications of cryptographic techniques (Springer), pp. 1–31
Libert B, Ling S, Nguyen K, Wang H (2017) Zero-knowledge arguments for lattice-based prfs and applications to e-cash. In: International conference on the theory and application of cryptology and information security (Springer), pp. 304–335
Liu JK, Wong DS (2005) Linkable ring signatures: Security models and new schemes. In: International conference on computational science and its applications (Springer), pp. 614–623
Liu JK, Wong DS (2006) Enhanced security models and a generic construction approach for linkable ring signature. Int J Found Comput Sci 17(06):1403
Liu JK, Wei VK, Wong DS (2004) Linkable spontaneous anonymous group signature for ad hoc groups. In: Australasian conference on information security and privacy (Springer), pp. 325–335
Liu JK, Au MH, Susilo W, Zhou J (2013) Linkable ring signature with unconditional anonymity. IEEE Trans Knowl Data Eng 26(1):157
Liu Z, Wang L, Wang X, Shen X, Li L (2019a) Secure remote sensing image registration based on compressed sensing in cloud setting. IEEE Access 7:36516
Liu Z, Nguyen K, Yang G, Wang H, Wong DS (2019b) A lattice-based linkable ring signature supporting stealth addresses. In: European symposium on research in computer security (Springer), pp. 726–746
Lu X, Au MH, Zhang Z (2019) Raptor: a practical lattice-based (linkable) ring signature. In: International conference on applied cryptography and network security (Springer), pp. 110–130
Lyubashevsky V (2009) Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: International conference on the theory and application of cryptology and information security (Springer), pp. 598–616
Melchor CA, Bettaieb S, Boyen X, Fousse L, Gaborit P (2013) Adapting Lyubashevskys signature schemes to the ring signature setting. In: International conference on cryptology in Africa (Springer), pp. 1–25
Noether S (2015) Ring signature confidential transactions for monero., IACR Cryptology ePrint Archive, 1098
Rivest RL, Shamir A, Tauman Y (2001) How to leak a secret. In: International conference on the theory and application of cryptology and information security (Springer), pp. 552–565
Sun SF, Au MH, Liu JK, Yuen TH (2017) RingCT 2.0: a compact accumulator-based (linkable ring signature) protocol for blockchain cryptocurrency Monero. In: European symposium on research in computer security (Springer), pp. 456–474
Torres WAA, Steinfeld R, Sakzad A, Liu JK, Kuchta V, Bhattacharjee N, Au MH, Cheng J (2018) Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice RingCT v1. 0). In: Australasian conference on information security and privacy (Springer), pp. 558–576
Tsang PP, Wei VK (2005) Short linkable ring signatures for e-voting, e-cash and attestation. In: International conference on information security practice and experience (Springer), pp. 48–60
Tsang PP, Au MH, Liu JK, Susilo W, Wong DS (2010) A suite of non-pairing ID-based threshold ring signature schemes with different levels of anonymity. In: International conference on provable security (Springer), pp. 166–183
Wang X, Zhang Y, Gupta BB, Zhu H, Liu D (2019) An identity-based signcryption on lattice without trapdoor. J UCS 25(3):282
Wang Y, Yang G, Bracciali A, Leung HF, Yu X (2020a) Incentive compatible and anti-compounding of wealth in proof-of-stake. Inf Sci 530:85
Wang Y, Yang G, Li T, Li F, Tian Y, Yu X (2020b) Belief and fairness: a secure two-party protocol toward the view of entropy for IoT devices. J Netw Comput Appl 161:102641
Yuen TH, Liu JK, Au MH, Susilo W, Zhou J (2013) Efficient linkable and/or threshold ring signature without random oracles. Comput J 56(4):407
Zhao Q, Zhao C, Cui S, Jing S, Chen Z (2020) PrivateDL: privacy-preserving collaborative deep learning against leakage from gradient sharing. Int J Intell Syst 35(8):1262–79
Zheng D, Li X, Chen K, Li J (2007) Linkable ring signatures from linear feedback shift register. In: International conference on embedded and ubiquitous computing (Springer), pp. 716–727
Acknowledgements
This work was supported by the National Natural Science Foundation of Shanxi (Grant No.201601D021014), Higher Education Technology Innovation Projects Foundation of Shanxi (Grant No.2019L0860), National Natural Science Foundation of China (Grant No. 61702124) and the Subject Research Projects Foundation of Key Laboratory of Information Security Technology of Guangdong (Grant No. GDXXAQ2016-05).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ren, Y., Guan, H. & Zhao, Q. An efficient lattice-based linkable ring signature scheme with scalability to multiple layer. J Ambient Intell Human Comput 13, 1547–1556 (2022). https://doi.org/10.1007/s12652-021-03092-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-021-03092-1