密码学报（中英文）2025，Vol.12Issue(1)：19-38,20.DOI:10.13868/j.cnki.jcr.000747
零知识证明友好的杂凑函数研究综述
An Overview of ZK-Friendly Hash Functions
摘要
Abstract
Zero-knowledge protocols are crucial tools for privacy protection.With the development of privacy protection techniques,more and more scenarios of combining zero-knowledge protocols with hash functions have emerged,such as proving that hash functions are evaluated correctly in a zero-knowledge manner.Yet,traditional hash functions are unsuitable for this scenario and significantly lower the overall efficiency.Therefore,designing zero-knowledge-friendly hash functions for higher overall efficiency has aroused extensive concern from both industry and academia.This study in-troduces three typical arithmetization methods used in the zero-knowledge protocols and summarizes the characteristics and development stages of ZK-friendly hash functions.Following the development stages,the current ZK-friendly hash functions are overviewed,including MiMC,POSEIDON,Rescue,Reinforced Concrete,NEPTUNE,Anemoi,and GRIFFIN algorithms,and the structure and arithmetic parameters are compared.Finally,the challenges and potential research directions are provided for ZK-friendly hash functions.关键词
零知识证明友好的杂凑函数/算术化/SNARK/STARKKey words
ZK-friendly hash functions/arithmetization/SNARK/STARK分类
计算机与自动化引用本文复制引用
林茜,李永强,王明生..零知识证明友好的杂凑函数研究综述[J].密码学报（中英文）,2025,12(1):19-38,20.基金项目
国家自然科学基金(12371525)National Natural Science Foundation of China(12371525) （12371525）
