A survey on exotic signatures for post-quantum blockchain: Challenges and research directions

M Buser, R Dowsley, M Esgin, C Gritti… - ACM Computing …, 2023 - dl.acm.org
Blockchain technology provides efficient and secure solutions to various online activities by
utilizing a wide range of cryptographic tools. In this article, we survey the existing literature …

A survey on zero-knowledge authentication for internet of things

Z Chen, Y Jiang, X Song, L Chen - Electronics, 2023 - mdpi.com
The Internet of Things (IoT) is ubiquitous in our lives. However, the inherent vulnerability of
IoT smart devices can lead to the destruction of networks in untrustworthy environments …

Ligero: Lightweight sublinear arguments without a trusted setup

S Ames, C Hazay, Y Ishai… - Proceedings of the 2017 …, 2017 - dl.acm.org
We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field

K Yang, P Sarkar, C Weng, X Wang - Proceedings of the 2021 ACM …, 2021 - dl.acm.org
Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of
attention, because such protocols can easily prove very large computation with a small …

Experimenting with zero-knowledge proofs of training

S Garg, A Goel, S Jha, S Mahloujifar… - Proceedings of the …, 2023 - dl.acm.org
How can a model owner prove they trained their model according to the correct
specification? More importantly, how can they do so while preserving the privacy of the …

zkllm: Zero knowledge proofs for large language models

H Sun, J Li, H Zhang - Proceedings of the 2024 on ACM SIGSAC …, 2024 - dl.acm.org
The recent surge in artificial intelligence (AI), characterized by the prominence of large
language models (LLMs), has ushered in fundamental transformations across the globe …

Zero-knowledge proofs of training for deep neural networks

K Abbaszadeh, C Pappas, J Katz… - Proceedings of the 2024 …, 2024 - dl.acm.org
A zero-knowledge proof of training (zkPoT) enables a party to prove that they have correctly
trained a committed model based on a committed dataset without revealing any additional …

BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes

H Zeilberger, B Chen, B Fisch - Annual International Cryptology …, 2024 - Springer
This works introduces BaseFold, a new field-agnostic Polynomial Commitment Scheme
(PCS) for multilinear polynomials that has O (log 2 (n)) verifier costs and O (n log n) prover …