{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:13:58Z","timestamp":1760235238526,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T00:00:00Z","timestamp":1627516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802075, 61802241, 61902303"],"award-info":[{"award-number":["61802075, 61802241, 61902303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&amp;D Program of China","award":["2017YFB0802000"],"award-info":[{"award-number":["2017YFB0802000"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Deniable ring signature can be regarded as group signature without group manager, in which a singer is capable of singing a message anonymously, but, if necessary, each ring member is allowed to confirm or disavowal its involvement in the signature via an interactive mechanism between the ring member and the verifier. This attractive feature makes the deniable ring signature find many applications in the real world. In this work, we propose an efficient scheme with signature size logarithmic to the cardinality of the ring. From a high level, we adapt Libert et al.\u2019s zero-knowledge argument system (Eurocrypt 2016) to allow the prover to convince the verifier that its witness satisfies an additional condition. Then, using the Fait-Shamir transformation, we get a non-interactive deniable ring signature scheme that satisfies the anonymity, traceability, and non-frameability under the small integer solution assumption in the random oracle model.<\/jats:p>","DOI":"10.3390\/e23080980","type":"journal-article","created":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T21:21:21Z","timestamp":1627593681000},"page":"980","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lattice-Based Logarithmic-Size Non-Interactive Deniable Ring Signatures"],"prefix":"10.3390","volume":"23","author":[{"given":"Huiwen","family":"Jia","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Guangzhou University, No. 230 Wai Huan Xi Road, Guangzhou 510006, China"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Guangzhou University, No. 230 Wai Huan Xi Road, Guangzhou 510006, China"}]},{"given":"Yanhua","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/11685654_7","article-title":"How to leak a secret: Theory and applications of ring signatures","volume":"3895","author":"Rivest","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Naor, M. (2002). Deniable ring authentication. CRYPTO 2002, Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2002, Springer.","DOI":"10.1007\/3-540-45708-9_31"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Kiayias, A., Nicolosi, A., and Shoup, V. (2004). Anonymous identification in Ad Hoc Groups. EUROCRYPT 2004, Proceedings of the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2\u20136 May 2004, Springer.","DOI":"10.1007\/978-3-540-24676-3_36"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chaum, D., and van Heyst, E. (1991). Group signatures. EUROCRYPT 1991, Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, UK, 8\u201311 April 1991, Springer.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micciancio, D., and Warinschi, B. (2003). Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. EUROCRYPT 2003, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, 4\u20138 May 2003, Springer.","DOI":"10.1007\/3-540-39200-9_38"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Boyen, X., and Waters, B. (2006). Compact group signatures without random oracles. EUROCRYPT 2006, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, 28 May\u20131 June 2006, Springer.","DOI":"10.1007\/11761679_26"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Groth, J. (2007). Fully anonymous group signatures without random oracles. ASIACRYPT 2007, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, 2\u20136 December 2007, Springer.","DOI":"10.1007\/978-3-540-76900-2_10"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Libert, B., Ling, S., Nguyen, K., and Wang, H. (2016). Zero-knowledge arguments for lattice-based accumulators: Logarithmic-size ring signatures and group signatures without trapdoors. EUROCRYPT 2016, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, 8\u201312 May 2016, Springer.","DOI":"10.1007\/978-3-662-49896-5_1"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2019.03.023","article-title":"Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease","volume":"783","author":"Ling","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Komano, Y., Ohta, K., Shimbo, A., and Kawamura, S. (2006). Toward the fair anonymous signatures: Deniable ring signatures. CT-RSA 2006, Proceedings of the Cryptographers\u2019 Track at the RSA Conference, San Jose, CA, USA, 13\u201317 February 2006, Springer.","DOI":"10.1007\/11605805_12"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10207-018-0417-1","article-title":"Lattice-based deniable ring signatures","volume":"18","author":"Gao","year":"2019","journal-title":"Int. J. Inf. Secur."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10623-015-0126-y","article-title":"Policy-based signature scheme from lattices","volume":"81","author":"Cheng","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Libert, B., Ling, S., Nguyen, K., and Wang, H. (2017). Zero-knowledge arguments for lattice-based PRFs and applications to e-cash. ASIACRYPT 2017, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Hong Kong, China, 3\u20137 December 2017, Springer.","DOI":"10.1007\/978-3-319-70700-6_11"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.556672","article-title":"A new paradigm for public key identification","volume":"42","author":"Stern","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10207-020-00497-5","article-title":"Cryptanalysis of a non-interactive deniable ring signature scheme","volume":"20","author":"Jia","year":"2020","journal-title":"Int. J. Inf. Secur."},{"key":"ref_17","first-page":"1","article-title":"Generating hard instances of lattice problems","volume":"13","author":"Ajtai","year":"2004","journal-title":"Quad. Mat."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","article-title":"Worst-case to average-case reductions based on Gaussian measure","volume":"37","author":"Micciancio","year":"2007","journal-title":"SIAM J. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. STOC 2008, Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada, 17\u201320 May 2008, ACM.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Micciancio, D., and Peikert, C. (2013). Hardness of SIS and LWE with small parameters. CRYPTO 2013, Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2013, Springer.","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Jain, A., Krenn, S., Pietrzak, K., and Tentes, A. (2012). Commitments and efficient zero-knowledge proofs from learning parity with noise. ASIACRYPT 2012, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, 2\u20136 December 2012, Springer.","DOI":"10.1007\/978-3-642-34961-4_40"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Camenisch, J., Krenn, S., Lyubashevsky, V., and Neven, G. (2014). Better zero-knowledge proofs for lattice encryption and their application to group signatures. ASIACRYPT 2014, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, 7\u201311 December 2014, Springer.","DOI":"10.1007\/978-3-662-45611-8_29"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Kawachi, A., Tanaka, K., and Xagawa, K. (2008). Concurrently secure identification schemes based on the worst-case hardness of lattice problems. ASIACRYPT 2008, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, 7\u201311 December 2008, Springer.","DOI":"10.1007\/978-3-540-89255-7_23"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Groth, J. (2004). Evaluating security of voting schemes in the universal composability framework. ACNS 2004, Proceedings of the InInternational Conference on Applied Cryptography and Network Security, Yellow Mountains, China, 8\u201311 June 2004, Springer.","DOI":"10.1007\/978-3-540-24852-1_4"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/8\/980\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:37:03Z","timestamp":1760164623000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/8\/980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,29]]},"references-count":24,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["e23080980"],"URL":"https:\/\/doi.org\/10.3390\/e23080980","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,7,29]]}}}