2000 character limit reached
Towards a zk-SNARK compiler for Wolfram language (2401.02935v1)
Published 5 Jan 2024 in cs.CR
Abstract: Zero-knowledge proofs (zk-Proofs) are communication protocols by which a prover can demonstrate to a verifier that it possesses a solution to a given public problem without revealing the content of the solution. Arbitrary computations can be transformed into an interactive zk-Proof so anyone is convinced that it was executed correctly without knowing what was executed on, having huge implications for digital currency. Despite this, interactive proofs are not suited for blockchain applications but novel protocols such as zk-SNARKs have made zero-knowledge ledgers like Zcash possible. This project builds upon Wolfram's ZeroKnowledgeProofs paclet and implements a zk-SNARK compiler based on Pinocchio protocol.
- Parno, B., Howell, J., Gentry, C., Raykova, M. “Pinocchio: Nearly Practical Verifiable Computation.” In 2013 IEEE Symposium on Security and Privacy 238–252 (2013) 10.1109/SP.2013.47.
- Cruz, A. “ZeroKnowledgeProofs, Implementation of Zero Knowledge proof interactive and non-interactive protocols.” (2022) URL https://resources.wolframcloud.com/PacletRepository/resources/ArmandoCruz/ZeroKnowledgeProofs/.
- Gamboa, R., Cowles, J. “A Mechanical Proof of the Cook-Levin Theorem.” In K. Slind, A. Bunker, G. Gopalakrishnan (Eds.), Theorem Proving in Higher Order Logics Berlin, Heidelberg: Springer Berlin Heidelberg 99–116 (2004) .
- Groth, J. “Short Pairing-Based Non-interactive Zero-Knowledge Arguments.” In M. Abe (Ed.), Advances in Cryptology - ASIACRYPT 2010 Berlin, Heidelberg: Springer Berlin Heidelberg 321–340 (2010) .
- Gennaro, R., Gentry, C., Parno, B., Raykova, M. “Quadratic Span Programs and Succinct NIZKs without PCPs.” In T. Johansson, P. Q. Nguyen (Eds.), Advances in Cryptology – EUROCRYPT 2013 Berlin, Heidelberg: Springer Berlin Heidelberg 626–645 (2013) .
- Ben Sasson, E., et al. “Zerocash: Decentralized Anonymous Payments from Bitcoin.” In 2014 IEEE Symposium on Security and Privacy 459–474 (2014) 10.1109/SP.2014.36.
- Banerjee, A., Clear, M., Tewari, H. “Demystifying the Role of zk-SNARKs in Zcash.” 2020 IEEE Conference on Application, Information and Network Security (AINS) 12–19 URL https://api.semanticscholar.org/CorpusID:220936616.
- Bellare, M., Palacio, A. “The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols.” In M. Franklin (Ed.), Advances in Cryptology – CRYPTO 2004 Berlin, Heidelberg: Springer Berlin Heidelberg 273–289 (2004) .
- Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M. “Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture.” In 23rd USENIX Security Symposium (USENIX Security 14) San Diego, CA: USENIX Association 781–796 (2014) .
- Blum, M., De Santis, A., Micali, S., Persiano, G. “Noninteractive Zero-Knowledge.” SIAM Journal on Computing 20.6 1084–1118 (1991) 10.1137/0220068 https://doi.org/10.1137/0220068 URL https://doi.org/10.1137/0220068.
- Gennaro, R., Gentry, C., Parno, B. https://eprint.iacr.org/2009/547 “Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers.” (2009) Cryptology ePrint Archive, Paper 2009/547 URL https://eprint.iacr.org/2009/547.
- Zcash “The halo2 book.” URL https://zcash.github.io/halo2/.
- Koblitz, N., Menezes, A., Vanstone, S. “The State of Elliptic Curve Cryptography.” In Designs, Codes and Cryptography 19 173–193 (2000) URL https://doi.org/10.1023/A:1008354106356.
- Parno, B., Raykova, M., Vaikuntanathan, V. “How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption.” In R. Cramer (Ed.), Theory of Cryptography Berlin, Heidelberg: Springer Berlin Heidelberg 422–439 (2012) .