Fetching the paper…
Reading the bibliography…
Collision-resistant cryptographic hash functions (CRHs) are crucial for security, particularly for message authentication in Zero-knowledge Proof (ZKP) applications.
L. C. K. Hui and K.-Y. Lam, “Fast square-and-multiply exponentiation for rsa,” Electronics Letters , 1994
1994
Earlier work this paper cites.
N. Sklavos and O. Koufopavlou, “On the hardware implementations of the sha-2 (256, 384, 512) hash functions,” in Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS’03. , vol. 5. IEEE, 2003, pp. V–V
2003
Earlier work this paper cites.
P. S. Barreto and M. Naehrig, “Pairing-friendly elliptic curves of prime order,” in International workshop on selected areas in cryptography . Springer, 2005, pp. 319–331
2005
Earlier work this paper cites.
G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Sponge functions,” in ECRYPT hash workshop , vol. 2007, no. 9, 2007
2007
Earlier work this paper cites.
L. Lu, J. Han, Y. Liu, L. Hu, J.-P. Huai, L. Ni, and J. Ma, “Pseudo trust: Zero-knowledge authentication in anonymous p2ps,” IEEE Transactions on Parallel and Distributed Systems , vol. 19, no. 10, pp. 1325–1337, 2008
2008
Earlier work this paper cites.
H. Liu and H. Ning, “Zero-knowledge authentication protocol based on alternative mode in rfid systems,” IEEE Sensors Journal , vol. 11, no. 12, pp. 3235–3245, 2011
2011
Earlier work this paper cites.
S. M. Sim, K. Khoo, F. Oggier, and T. Peyrin, “Lightweight mds involution matrices,” in Fast Software Encryption: 22nd International Workshop, FSE 2015, Istanbul, Turkey, March 8-11, 2015, Revised Selected Papers 22 . Springer, 2015, pp. 471–493
2015
Earlier work this paper cites.
M. Albrecht, L. Grassi, C. Rechberger, A. Roy, and T. Tiessen, “Mimc: Efficient encryption and cryptographic hashing with minimal multiplicative complexity,” in International Conference on the Theory and Application of Cryptology and Information Security . Springer, 2016, pp. 191–219
2016
Earlier work this paper cites.
E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev, “Scalable, transparent, and post-quantum secure computational integrity,” Cryptology ePrint Archive , 2018
2018
Earlier work this paper cites.
J. Bootle, A. Cerulli, J. Groth, S. Jakobsen, and M. Maller, “Arya: Nearly linear-time zero-knowledge proofs for correct program execution,” in International Conference on the Theory and Application of Cryptology and Information Security . Springer, 2018, pp. 595–626
2018
Earlier work this paper cites.
A. Szepieniec, T. Ashur, and S. Dhooghe, “Rescue-prime: a standard specification (sok),” Cryptology ePrint Archive , 2020
2020
Earlier work this paper cites.
A. Nitulescu, “zk-snarks: a gentle introduction,” Ecole Normale Superieure , 2020
2020
Earlier work this paper cites.
A. Gabizon and Z. J. Williamson, “plookup: A simplified polynomial protocol for lookup tables,” Cryptology ePrint Archive , 2020
2020
Earlier work this paper cites.
T. Liu, X. Xie, and Y. Zhang, “Zkcnn: Zero knowledge proofs for convolutional neural network predictions and accuracy,” in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security , 2021, pp. 2968–2985
2021
Cited alongside, same era.
C. Weng, K. Yang, X. Xie, J. Katz, and X. Wang, “Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning,” in 30th USENIX Security Symposium (USENIX Security 21) , 2021, pp. 501–518
2021
Cited alongside, same era.
Y. Zhang, S. Wang, X. Zhang, J. Dong, X. Mao, F. Long, C. Wang, D. Zhou, M. Gao, and G. Sun, “Pipezk: Accelerating zero-knowledge proof with a pipelined architecture,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2021, pp. 416–428
2021
Cited alongside, same era.
C. Delpech de Saint Guilhem, E. Orsini, and T. Tanguy, “Limbo: efficient zero-knowledge mpcith-based arguments,” in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security , 2021, pp. 3022–3036
Z. Ghodsi, M. Javaheripi, N. Sheybani, X. Zhang, K. Huang, and F. Koushanfar, “zprobe: Zero peek robustness checks for federated learning,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2023, pp. 4860–4870
2023
Later among the works it cites.
W. Ma, Q. Xiong, X. Shi, X. Ma, H. Jin, H. Kuang, M. Gao, Y. Zhang, H. Shen, and W. Hu, “Gzkp: A gpu accelerated zero-knowledge proof system,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 , 2023, pp. 340–353
2023
Later among the works it cites.
L. Grassi, Y. Hao, C. Rechberger, M. Schofnegger, R. Walch, and Q. Wang, “Horst meets fluid-spn: Griffin for zero-knowledge applications,” in Annual International Cryptology Conference . Springer, 2023, pp. 573–606
2023
Later among the works it cites.
S. Deng and B. Du, “zktree: A zero-knowledge recursion tree with zkp membership proofs,” Cryptology ePrint Archive , 2023
2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
A. Golovnev, J. Lee, S. T. Setty, J. Thaler, and R. S. Wahby, “Brakedown: Linear-time and post-quantum snarks for r1cs.” IACR Cryptol. ePrint Arch. , vol. 2021, p. 1043, 2021
2021
Cited alongside, same era.
S. Jing, X. Zheng, and Z. Chen, “Review and investigation of merkle tree’s technical principles and related application fields,” in 2021 International Conference on Artificial Intelligence, Big Data and Algorithms (CAIBDA) . IEEE, 2021, pp. 86–90
2021
Cited alongside, same era.
L. Grassi, D. Khovratovich, C. Rechberger, A. Roy, and M. Schofnegger, “Poseidon: A new hash function for { \{ Zero-Knowledge } \} proof systems,” in 30th USENIX Security Symposium (USENIX Security 21) , 2021, pp. 519–535
2021
Cited alongside, same era.
“Hash functions for zero-knowledge applications zoo,” https://extgit.iaik.tugraz.at/krypto/zkfriendlyhashzoo , Aug. 2021, IAIK, Graz University of Technology
2021
Cited alongside, same era.
A. Kothapalli, S. Setty, and I. Tzialla, “Nova: Recursive zero-knowledge arguments from folding schemes,” in Annual International Cryptology Conference . Springer, 2022, pp. 359–388
2022
Cited alongside, same era.
Ingonyama, “Systemization of knowledge: Zk-friendly hash functions,” Nov 2022. [Online]. Available: https://medium.com/@ingonyama/system-of-knowledge-zk-friendly-hash-functions-ab825616c9f1
2022
Cited alongside, same era.
L. Grassi, D. Khovratovich, R. Lüftenegger, C. Rechberger, M. Schofnegger, and R. Walch, “Reinforced concrete: a fast hash function for verifiable computation,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security , 2022, pp. 1323–1335
2022
Cited alongside, same era.
2022
Cited alongside, same era.
Later among the works it cites.
L. Grassi, D. Khovratovich, R. Lüftenegger, C. Rechberger, M. Schofnegger, and R. Walch, “Hash functions monolith for zk applications: May the speed of sha-3 be with you.” IACR Cryptol. ePrint Arch. , vol. 2023, p. 1025, 2023
2023
Later among the works it cites.
T. Lu, C. Wei, R. Yu, C. Chen, W. Fang, L. Wang, Z. Wang, and W. Chen, “Cuzk: Accelerating zero-knowledge proof with a faster parallel multi-scalar multiplication algorithm on gpus,” IACR Transactions on Cryptographic Hardware and Embedded Systems , vol. 2023, no. 3, pp. 194–220, 2023
2023
Later among the works it cites.
M. Petkus, “Efficient (non-) membership tree from multicollision-resistance with applications to zero-knowledge proofs,” Cryptology ePrint Archive , 2024
2024
Later among the works it cites.
TACEO, “What’s the deal with hash functions in zero knowledge?” https://blog.taceo.io/whats-the-deal-with-hashes-in-zk/ , 2023, accessed: November 18, 2024
2024
Later among the works it cites.
“GitHub - datenlord/TRIDENT: A Hardware Implemented Poseidon Hasher — github.com,” https://github.com/datenlord/TRIDENT.git , [Accessed 03-05-2024]
2024
Later among the works it cites.
A. Ahmed, N. Sheybani, D. Moreno, N. B. Njungle, T. Gong, M. Kinsy, and F. Koushanfar, “Amaze: Accelerated mimc hardware architecture for zero-knowledge applications on the edge,” 2024 ACM/IEEE International Conference on Computer-Aided Design (ICCAD) , 2024
2024
Later among the works it cites.
ZK Hash Bounties, “Zk hash bounties,” https://www.zkhashbounties.info/ , 2024, accessed: November 18, 2024
2024
Later among the works it cites.
J. Ernstberger, S. Chaliasos, G. Kadianakis, S. Steinhorst, P. Jovanovic, A. Gervais, B. Livshits, and M. Orrù, “zk-bench: A toolset for comparative evaluation and performance benchmarking of snarks,” in International Conference on Security and Cryptography for Networks . Springer, 2024, pp. 46–72
2024
Later among the works it cites.