{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:58:07Z","timestamp":1760230687269,"version":"build-2065373602"},"reference-count":39,"publisher":"MDPI AG","issue":"16","license":[{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"Open Program of Neusoft Corporation, Item number NCBETOP2101, the National Key R&amp;D Program of China","doi-asserted-by":"publisher","award":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"],"award-info":[{"award-number":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"],"award-info":[{"award-number":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"],"award-info":[{"award-number":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"],"award-info":[{"award-number":["2020YFB1005600","M21031","U21A20467","61932011","61972019","2021M700347"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>With the increasing demand for privacy protection in the blockchain, the universal zero-knowledge proof protocol has been developed and widely used. Because hash function is an important cryptographic primitive in a blockchain, the zero-knowledge proof of hash preimage has a wide range of application scenarios. However, it is hard to implement it due to the transformation of efficiency and execution complexity. Currently, there are only zero-knowledge proof circuits of some widely used hash functions that have been implemented, such as SHA256. SM3 is a Chinese hash function standard published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service systems, and hence might be used in several cryptographic applications in China. As the national cryptographic hash function standard, the zero-knowledge proof circuit of SM3 (Chinese Commercial Cryptography) has not been implemented. Therefore, this paper analyzed the SM3 algorithm process, designed a new layered circuit structure, and implemented the SM3 hash preimage zero-knowledge proof circuit with a circuit size reduced by half compared to the automatic generator. Moreover, we proposed several extended practical protocols based on the SM3 zero-knowledge proof circuit, which is widely used in blockchain.<\/jats:p>","DOI":"10.3390\/s22165951","type":"journal-article","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T04:20:32Z","timestamp":1660105232000},"page":"5951","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Implementation and Optimization of Zero-Knowledge Proof Circuit Based on Hash Function SM3"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4069-3123","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"first","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing 100191, China"}]},{"given":"Shangbin","family":"Han","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing 100191, China"}]},{"given":"Ping","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing 100191, China"}]},{"given":"Yan","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing 100191, China"}]},{"given":"Zhenyang","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing 100191, China"}]},{"given":"Shengjie","family":"Hou","sequence":"additional","affiliation":[{"name":"National Innovation Institute of Defense Technology, Academy of Military Sciences, Beijing 100071, China"}]},{"given":"Shicheng","family":"Xu","sequence":"additional","affiliation":[{"name":"Neusoft Corporation, Shenyang 110179, China"},{"name":"Liaoning Blockchain Engineering Technology Research Center, Shenyang 110179, China"}]},{"given":"Haibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Hangzhou Innovation Institute, Beihang University, Hangzhou 310051, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/116825.116852","article-title":"Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems","volume":"38","author":"Goldreich","year":"1991","journal-title":"J. ACM"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Groth, J. (2016, January 8\u201312). On the size of pairing-based non-interactive arguments. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., and Petit, C. (2016, January 8\u201312). Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria.","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., and Maxwell, G. (2018, January 21\u201323). Bulletproofs: Short proofs for confidential transactions and more. Proceedings of the 2018 IEEE Symposium on Security and Privacy, San Francisco, CA, USA.","DOI":"10.1109\/SP.2018.00020"},{"key":"ref_5","first-page":"46","article-title":"Scalable, transparent, and post-quantum secure computational integrity","volume":"2018","author":"Bentov","year":"2018","journal-title":"Cryptol. EPrint Arch."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., and Meiklejohn, S. (2019, January 11\u201315). Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3339817"},{"key":"ref_7","unstructured":"Erway, C.C., K\u00fcp\u00e7\u00fc, A., Hinkle, T., and Lysyanskaya, A. (2010, January 11\u201313). ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash. Proceedings of the 19th USENIX Security Symposium, San Jose, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., and Virza, M. (2013, January 18\u201322). SNARKs for C: Verifying program executions succinctly and in zero knowledge. Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., and Raykova, M. (2013, January 19\u201322). Pinocchio: Nearly practical verifiable computation. Proceedings of the 2013 IEEE Symposium on Security and Privacy, Berkeley, CA, USA.","DOI":"10.1109\/SP.2013.47"},{"key":"ref_10","unstructured":"Valiant, P. (2008, January 19\u201321). Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. Proceedings of the Theory of Cryptography Conference, New York, NY, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., and Tromer, E. (2013, January 2\u20134). Recursive composition and bootstrapping for SNARKs and proof-carrying data. Proceedings of the 44th ACM Symposium on Theory of Computing, Palo Alto, CA, USA.","DOI":"10.1145\/2488608.2488623"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Braun, B., Feldman, A.J., Ren, Z., Setty, S., Blumberg, A.J., and Walfish, M. (2013, January 3\u20136). Verifying computations with state. Proceedings of the 24th ACM Symposium on Operating Systems Principles, Farmington, PA, USA.","DOI":"10.1145\/2517349.2522733"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Kosba, A., Papamanthou, C., and Shi, E. (2018, January 21\u201323). xJsnark: A framework for efficient verifiable computation. Proceedings of the 2018 IEEE Symposium on Security and Privacy, San Francisco, CA, USA.","DOI":"10.1109\/SP.2018.00018"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3269","DOI":"10.1109\/TIFS.2021.3074869","article-title":"Zilch: A framework for deploying transparent zero-knowledge proofs","volume":"16","author":"Mouris","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_15","unstructured":"Mendel, F., Nad, T., and Schl\u00e4ffer, M. (March, January 25). Finding collisions for round-reduced SM3. Proceedings of the Cryptographers\u2019 Track at the RSA Conference, San Francisco, CA, USA."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Coron, J.S., Dodis, Y., Malinaud, C., and Puniya, P. (2005, January 14\u201318). Merkle-Damg\u00e5rd revisited: How to construct a hash function. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/11535218_26"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"17882","DOI":"10.1109\/ACCESS.2021.3049881","article-title":"A novel hash function based on a chaotic sponge and DNA sequence","volume":"9","author":"Alawida","year":"2021","journal-title":"IEEE Access"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.cose.2018.02.010","article-title":"One-time password based on hash chain without shared secret and re-registration","volume":"75","author":"Park","year":"2018","journal-title":"Comput. Secur."},{"key":"ref_19","unstructured":"Merkle, R.C. (1987, January 16\u201320). A digital signature based on a conventional encryption function. Proceedings of the Conference on the Theory and Application of Cryptographic Techniques, Santa Barbara, CA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Chen, Y., Li, H., Li, K., and Zhang, J. (2017, January 10\u201312). An improved P2P file system scheme based on IPFS and blockchain. Proceedings of the 2017 IEEE International Conference on Big Data, Beijing, China.","DOI":"10.1109\/BigData.2017.8258226"},{"key":"ref_21","first-page":"1347","article-title":"ZERONET: An Overview","volume":"119","author":"Pavithra","year":"2018","journal-title":"Int. J. Pure Appl. Math."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/MS.2012.61","article-title":"Git","volume":"29","author":"Spinellis","year":"2012","journal-title":"IEEE Softw."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Groth, J. (2010, January 6\u201310). Short non-interactive zero-knowledge proofs. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Singapore.","DOI":"10.1007\/978-3-642-17373-8_20"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., and Miers, I. (2018, January 18\u201322). Updatable and universal common reference strings with applications to zk-SNARKs. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Eberhardt, J., and Tai, S. (August, January 30). Zokrates-scalable privacy-preserving off-chain computations. Proceedings of the 2018 IEEE International Conference on Internet of Things and IEEE Green Computing and Communications and IEEE Cyber, Physical and Social Computing and IEEE Smart Data, Halifax, NS, Canada.","DOI":"10.1109\/Cybermatics_2018.2018.00199"},{"key":"ref_26","unstructured":"Giacomelli, I., Madsen, J., and Orlandi, C. (2016, January 10\u201312). ZKBoo: Faster zero-knowledge for boolean circuits. Proceedings of the 25th USENIX Security Symposium, Austin, TX, USA."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Gervais, A., Karame, G.O., W\u00fcst, K., Glykantzis, V., Ritzdorf, H., and Capkun, S. (2016, January 24\u201328). On the security and performance of proof of work blockchains. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978341"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"22328","DOI":"10.1109\/ACCESS.2019.2896108","article-title":"A survey on consensus mechanisms and mining strategy management in blockchain networks","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., and Tiessen, T. (2016, January 4\u20138). MiMC: Efficient encryption and cryptographic hashing with minimal multiplicative complexity. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam.","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"ref_30","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., and Schofnegger, M. (2021, January 11\u201313). Poseidon: A new hash function for zero-knowledge proof systems. Proceedings of the 30th USENIX Security Symposium, Vancouver, BC, Canada."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Kircanski, A., Shen, Y., Wang, G., and Youssef, A.M. (2012, January 15\u201316). Boomerang and slide-rotational analysis of the SM3 hash function. Proceedings of the International Conference on Selected Areas in Cryptography, Windsor, ON, Canada.","DOI":"10.1007\/978-3-642-35999-6_20"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Grajek, M., and Naik, R. (2014, January 22\u201324). Optimizing SHA256 in bitcoin mining. Proceedings of the International Conference on Cryptography and Security Systems, Lublin, Poland.","DOI":"10.1007\/978-3-662-44893-9_12"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1364\/AO.35.001056","article-title":"National institute of standards and technology high-accuracy cryogenic radiometer","volume":"35","author":"Gentile","year":"1996","journal-title":"Appl. Opt."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Fisch, B. (2019, January 19\u201323). Tight proofs of space and replication. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany.","DOI":"10.1007\/978-3-030-17656-3_12"},{"key":"ref_35","unstructured":"Gabizon, A., Williamson, Z.J., and Ciobotaru, O. (2022, June 28). PLONK: Permutations over Lagrange-Bases for Oecumenical Noninteractive Arguments of Knowledge. Cryptology ePrint Archive, Paper 2019\/953, 2019. Available online: https:\/\/eprint.iacr.org\/2019\/953."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Veeningen, M. (2017, January 24\u201326). Pinocchio-based adaptive zk-SNARKs and secure\/correct adaptive function evaluation. Proceedings of the International Conference on Cryptology in Africa, Dakar, Senegal.","DOI":"10.1007\/978-3-319-57339-7_2"},{"key":"ref_37","unstructured":"Virza, M. (2017). On Deploying Succinct Zero-Knowledge Proofs, Massachusetts Institute of Technology."},{"key":"ref_38","first-page":"1983","article-title":"Blockchain digital signature scheme with improved SM2 signature method","volume":"41","author":"Longhai","year":"2021","journal-title":"J. Comput. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., and Fisch, B. (2018, January 18\u201322). Verifiable delay functions. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-319-96884-1_25"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/16\/5951\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:06:14Z","timestamp":1760141174000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/16\/5951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,9]]},"references-count":39,"journal-issue":{"issue":"16","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["s22165951"],"URL":"https:\/\/doi.org\/10.3390\/s22165951","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2022,8,9]]}}}