Experimenting with Zero-Knowledge Proofs of Training
Open Access
- 15 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1880-1894
Abstract
No abstract availableFunding Information
- NSF (National Science Foundation) (CNS 1936826, CCF-FMitF-1836978, IIS- 2008559, SaTC-Frontiers-1804648, CCF-2046710, CCF-1652140, and 2039445, CCF-1910681, CNS1936799)
- ARO (W911NF-17-1-0405)
- DARPA (HR00112020026, GARD problem under agreement number 885000)
- Air Force Office of Scientific Research (FA9550-19-1-0200, FA9550-18-1-0166)
This publication has 42 references indexed in Scilit:
- Zerocash: Decentralized Anonymous Payments from Bitcoin2014
- On Definitions of Selective Opening Security2012
- Efficient Protocols for Set Membership and Range Proofs2008
- Zero-knowledge from secure multiparty computation2007
- Bit Commitment Using Pseudo-Randomness2001
- A note on efficient zero-knowledge proofs and arguments (extended abstract)1992
- Communication complexity of secure computation (extended abstract)1992
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- The knowledge complexity of interactive proof-systems1985
- How to share a secretCommunications of the ACM, 1979