{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:52Z","timestamp":1750309552228,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:00Z","timestamp":1740096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,21]]},"DOI":"10.1145\/3728725.3728791","type":"proceedings-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T21:00:02Z","timestamp":1749070802000},"page":"417-426","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Zero-Knowledge Range Proof Scheme Based on Multibit Split Square Decomposition"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5602-0465","authenticated-orcid":false,"given":"Yu","family":"Cao","sequence":"first","affiliation":[{"name":"He'nan Province Key Laboratory of Information Security, Zhengzhou, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5623-1035","authenticated-orcid":false,"given":"Xuehui","family":"Du","sequence":"additional","affiliation":[{"name":"He'nan Province Key Laboratory of Information Security, Zhengzhou, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9453-2867","authenticated-orcid":false,"given":"Lulu","family":"Zhang","sequence":"additional","affiliation":[{"name":"He'nan Province Key Laboratory of Information Security, Zhengzhou, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0506-1003","authenticated-orcid":false,"given":"Shihao","family":"Wang","sequence":"additional","affiliation":[{"name":"He'nan Province Key Laboratory of Information Security, Zhengzhou, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,3]]},"reference":[{"key":"e_1_3_3_1_1_2","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1007\/s42452-019-0989-z","article-title":"A survey on zero knowledge range proofs and applications","volume":"2019","author":"Eduardo Morais","year":"2019","unstructured":"Morais Eduardo, Koens Tommy, and Van Wijk Cees. 2019. A survey on zero knowledge range proofs and applications. SN Applied Sciences, 2019, 1(8): 946.","journal-title":"SN Applied Sciences"},{"key":"e_1_3_3_1_2_2","volume-title":"IEEE Internet Computing","author":"Gail-Joon Ahn","year":"2011","unstructured":"Ahn Gail-Joon, Shehab Mohamed, Squicciarini Anna. 2011.Security and Privacy in Social Networks. IEEE Internet Computing, 2011, 15(3): 10\u201312."},{"key":"e_1_3_3_1_3_2","volume-title":"ACM Computing Surveys","author":"Abbas Acar","year":"2019","unstructured":"Acar Abbas, Aksu Hidayet, Uluagac A. Selcuk. 2019. A Survey on Homomorphic Encryption Schemes: Theory and Implementation. ACM Computing Surveys, 2019, 51(4): 1\u201335."},{"key":"e_1_3_3_1_4_2","volume-title":"Information Sciences","author":"Chuan Zhao","year":"2019","unstructured":"Zhao Chuan, Zhao Shengnan, Zhao Minghao, Chen Zhenxiang. 2019. Secure Multi-Party Computation: Theory, practice and applications. Information Sciences, 2019, 476: 357\u2013372."},{"key":"e_1_3_3_1_5_2","volume-title":"WANG X.Public Key Cryptography \u2013 PKC","author":"Eiichiro Fujisaki","year":"2007","unstructured":"Fujisaki Eiichiro, Suzuki Koutarou. 2007. Traceable Ring Signature\/\/OKAMOTO T, WANG X.Public Key Cryptography \u2013 PKC 2007. Berlin, Heidelberg: Springer, 2007: 181\u2013200."},{"key":"e_1_3_3_1_6_2","volume-title":"STANDAERT F-X. Advances in cryptology \u2013 EUROCRYPT","author":"Geoffroy Couteau","year":"2021","unstructured":"Couteau Geoffroy, Kloo\u00df Michael, Lin Huang. 2021. Efficient range proofs with transparent setup from bounded integer commitments\/\/CANTEAUT A, STANDAERT F-X. Advances in cryptology \u2013 EUROCRYPT 2021. Cham: Springer International Publishing, 2021: 247\u2013277."},{"key":"e_1_3_3_1_7_2","volume-title":"On Diophantine Complexity and Statistical Zero-Knowledge Arguments\/\/LAIH C-S.Advances in Cryptology - ASIACRYPT","author":"Helger Lipmaa","year":"2003","unstructured":"Lipmaa Helger. 2003. On Diophantine Complexity and Statistical Zero-Knowledge Arguments\/\/LAIH C-S.Advances in Cryptology - ASIACRYPT 2003. Berlin, Heidelberg: Springer, 2003: 398\u2013415."},{"key":"e_1_3_3_1_8_2","volume-title":"Communications on Pure and Applied Mathematics","author":"Rabin Michael","year":"1986","unstructured":"Rabin Michael O, Shallit Jeffery O. 1986. Randomized algorithms in number theory. Communications on Pure and Applied Mathematics, 1986, 39(S1): S239\u2013S256."},{"key":"e_1_3_3_1_9_2","volume-title":"Gradual and Verifiable Release of a Secret \/\/Advances in Cryptology \u2013 CRYPTO \u201987","author":"Brickell Ernest","year":"1988","unstructured":"Brickell Ernest F., Chaum David, Damg\u00e5rd Ivan B. 1988. Gradual and Verifiable Release of a Secret \/\/Advances in Cryptology \u2013 CRYPTO \u201987. Springer, Berlin, Heidelberg, 1988: 156\u2013166."},{"key":"e_1_3_3_1_10_2","volume-title":"CRYPTO","author":"Hugo Krawczyk","year":"2003","unstructured":"Krawczyk Hugo. 2003. SIGMA: The \u2018SIGn-and-MAc\u2019 Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols\/\/BONEH D.Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, 2729: 400\u2013425."},{"key":"e_1_3_3_1_11_2","volume-title":"Easy come\u2014Easy go divisible cash\/\/Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"Agnes Chan","year":"1998","unstructured":"Chan Agnes, Frankel Yair, Tsiounis Yiannis. 1998. Easy come\u2014Easy go divisible cash\/\/Advances in Cryptology \u2014 EUROCRYPT\u201998. Springer, Berlin, Heidelberg, 1998: 561\u2013575."},{"key":"e_1_3_3_1_12_2","volume-title":"Practical and Provably Secure Release of a Secret and Exchange of Signatures\/\/Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"Bjerre Damg\u00e5rd Ivan","year":"1994","unstructured":"Damg\u00e5rd Ivan Bjerre. 1994. Practical and Provably Secure Release of a Secret and Exchange of Signatures\/\/Advances in Cryptology \u2014 EUROCRYPT \u201993. Springer, Berlin, Heidelberg, 1994: 200\u2013217."},{"key":"e_1_3_3_1_13_2","volume-title":"Statistical zero knowledge protocols to prove modular polynomial relations\/\/Advances in Cryptology \u2013 CRYPTO \u201997","author":"Eiichiro Fujisaki","year":"1997","unstructured":"Fujisaki Eiichiro, Okamoto Tatsuaki. 1997. Statistical zero knowledge protocols to prove modular polynomial relations\/\/Advances in Cryptology \u2013 CRYPTO \u201997. Springer, Berlin, Heidelberg, 1997: 16\u201330."},{"key":"e_1_3_3_1_14_2","volume-title":"Efficient Proofs that a Committed Number Lies in an Interval\/\/Advances in Cryptology \u2013 EUROCRYPT","author":"Fabrice Boudot","year":"2000","unstructured":"Boudot Fabrice. 2000. Efficient Proofs that a Committed Number Lies in an Interval\/\/Advances in Cryptology \u2013 EUROCRYPT 2000. Springer, Berlin, Heidelberg, 2000: 431\u2013444."},{"key":"e_1_3_3_1_15_2","volume-title":"Non-interactive Zero-Knowledge Arguments for Voting\/\/Applied Cryptography and Network Security","author":"Jens Groth","year":"2005","unstructured":"Groth Jens. 2005. Non-interactive Zero-Knowledge Arguments for Voting\/\/Applied Cryptography and Network Security. Springer, Berlin, Heidelberg, 2005: 467\u2013482."},{"key":"e_1_3_3_1_16_2","volume-title":"Removing the Strong RSA Assumption from Arguments over the Integers\/\/Advances in Cryptology \u2013 EUROCRYPT","author":"Geoffroy Couteau","year":"2017","unstructured":"Couteau Geoffroy, Peters Thomas, Pointcheval David. 2017. Removing the Strong RSA Assumption from Arguments over the Integers\/\/Advances in Cryptology \u2013 EUROCRYPT 2017. Springer, Cham, 2017: 321\u2013350."},{"key":"e_1_3_3_1_17_2","volume-title":"Cuproof: Range Proof with Constant Size. Entropy","author":"Cong Deng","year":"2022","unstructured":"Deng Cong, You Lin, Xianghong Tang. 2022. Cuproof: Range Proof with Constant Size. Entropy, Multidisciplinary Digital Publishing Institute, 2022, 24(3): 334."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"Verifiable partial key escrow | Proceedings of the 4th ACM conference on Computer and communications security. [2024-05-16]. 10.1145\/266420.266439.","DOI":"10.1145\/266420.266439"},{"key":"e_1_3_3_1_19_2","volume-title":"Efficient Binary Conversion for Paillier Encrypted Values\/\/VAUDENAY S. Advances in Cryptology - EUROCRYPT","author":"Berry Schoenmakers","year":"2006","unstructured":"Schoenmakers Berry, Tuyls Pim. 2006. Efficient Binary Conversion for Paillier Encrypted Values\/\/VAUDENAY S. Advances in Cryptology - EUROCRYPT 2006. Berlin, Heidelberg: Springer: 522\u2013537."},{"key":"e_1_3_3_1_20_2","volume-title":"CORON J-S.Advances in Cryptology \u2013 EUROCRYPT","author":"Jonathan Bootle","year":"2016","unstructured":"Bootle Jonathan, Cerulli Andrea, Chaidos Pyrros. 2016. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting\/\/FISCHLIN M, CORON J-S.Advances in Cryptology \u2013 EUROCRYPT 2016. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016, 9666: 327\u2013357."},{"key":"e_1_3_3_1_21_2","first-page":"315","article-title":"Bulletproofs: Short Proofs for Confidential Transactions and More\/\/2018 IEEE Symposium on Security and Privacy (SP). San Francisco","volume":"2018","author":"Benedikt Bunz","year":"2018","unstructured":"Bunz Benedikt, Bootle Jonathan, Boneh Dan. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More\/\/2018 IEEE Symposium on Security and Privacy (SP). San Francisco, CA: IEEE, 2018: 315\u2013334.","journal-title":"CA: IEEE"},{"key":"e_1_3_3_1_22_2","volume-title":"Efficient Protocols for Set Membership and Range Proofs\/\/Advances in Cryptology - ASIACRYPT","author":"Jan Camenisch","year":"2008","unstructured":"Camenisch Jan, Chaabouni Rafik, Shelat Abhi. 2008. Efficient Protocols for Set Membership and Range Proofs\/\/Advances in Cryptology - ASIACRYPT 2008. Springer, Berlin, Heidelberg, 2008: 234\u2013252."},{"key":"e_1_3_3_1_23_2","volume-title":"New Results for the Practical Use of Range Proofs\/\/Public Key Infrastructures, Services and Applications","author":"S\u00e9bastien Canard","year":"2014","unstructured":"Canard S\u00e9bastien, Coisel Iwen, Jambert Amandine. 2014. New Results for the Practical Use of Range Proofs\/\/Public Key Infrastructures, Services and Applications. Springer, Berlin, Heidelberg, 2014: 47\u201364."},{"key":"e_1_3_3_1_24_2","volume-title":"Efficient Range proof Protocols Based on Chinese CryptographicSM2. Chainese journal of computers","author":"Lin Chao","year":"2022","unstructured":"Chao Lin, Xinqin Huang, Debiao He. 2022. Efficient Range proof Protocols Based on Chinese CryptographicSM2. Chainese journal of computers, 2022, 45(1): 148\u2013159."},{"key":"e_1_3_3_1_25_2","article-title":"A Survey on Learning to Hash","volume":"2018","author":"Wang Jingdong","year":"2018","unstructured":"Jingdong Wang, Ting Zhang, Jingkuan Song. 2018. A Survey on Learning to Hash. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018, 40(4): 769\u2013790.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_3_1_26_2","volume-title":"Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing\/\/FEIGENBAUM J.Advances in Cryptology \u2014 CRYPTO \u201991","author":"Pryds Pedersen Torben","year":"1992","unstructured":"Pedersen Torben Pryds. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing\/\/FEIGENBAUM J.Advances in Cryptology \u2014 CRYPTO \u201991. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, 576: 129\u2013140."},{"key":"e_1_3_3_1_27_2","volume-title":"Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures\/\/Advances in Cryptology \u2013 ASIACRYPT","author":"Vadim Lyubashevsky","year":"2009","unstructured":"Lyubashevsky Vadim. 2009. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures\/\/Advances in Cryptology \u2013 ASIACRYPT 2009. Springer, Berlin, Heidelberg, 2009: 598\u2013616."}],"event":{"name":"GAIIS 2025: 2025 2nd International Conference on Generative Artificial Intelligence and Information Security","acronym":"GAIIS 2025","location":"Hangzhou China"},"container-title":["Proceedings of the 2025 2nd International Conference on Generative Artificial Intelligence and Information Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728725.3728791","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3728725.3728791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:48Z","timestamp":1750295928000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728725.3728791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,21]]},"references-count":27,"alternative-id":["10.1145\/3728725.3728791","10.1145\/3728725"],"URL":"https:\/\/doi.org\/10.1145\/3728725.3728791","relation":{},"subject":[],"published":{"date-parts":[[2025,2,21]]},"assertion":[{"value":"2025-06-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}