CRISP_go

README

CRISP-Go

This Repository comprises the implementation of ZKCE with preprocessing in Go using ZKB++¹ and KKW² with an application to CRISP³. This has been realized by Simon Wicky and Daniel Filipe Nunes Silva under the supervision of Sylvain Chatel at EPFL LDSEC lab.

Run

1. Compile with go build -o zkce.
2. Run with ./zkce.
3. You can now choose between running the CRISP³ circuit by pressing 1 or a dummy alternative computing a law of cosines inspired function by pressing 2.
4. Finally the whole programm will execute for multiple iterations. You can observe the results from the preprocessing, proof generation and verification as well as a few sanity checks, i.e. decryptions, integrity and comittments.

Overview

• main.go: basic code to run any of the two provided circuits
• main_test.go: a few basic tests and benchmarks
• circuit_crisp.go: description of the CRISP³ circuit
• circuit_dummy.go: description of the dummy circuit computing a law of cosines inspired function
• CRISP-private/ring: basic modular ring implementation with addition, substraction, multiplication and negation operations
• CRISP-private/zkbpp: implementation of the whole ZKCE machinery, i.e. preprocessing, proofs generation and verification as well as all the available gates, CRISP³ specific material and a MPC SHA-256 to describe further arithmetic or binary circuits.

Documentation

1. Generate documentation local server wiht godoc -http=localhost:6060.
2. Visit http://localhost:6060/pkg/github.com/ldsec/CRISP-private/ for the full documentation.

Dependencies

• The Go programming language from https://golang.org/
• The lattigo/ring package from https://github.com/ldsec/lattigo/ to use ring parameters and polynomials
• The lattigo/utils package from https://github.com/ldsec/lattigo/ to use pseudorandom number generators

Disclaimer

This implementation is for research purposes only.

Miscellaneous

The branch NoPreprocessing contains a ZKCE without preprocessing, along with benchmarks. The code is the result of an intermediate work and might not be cleaned and well documented.

References

1. M. Chase, D. Derler, S. Goldfeder, C. Orlandi, S. Ramacher, C. Rechberger, D. Slamanig, and G. Zaverucha, “Post-Quantum Zero- Knowledge and Signatures from Symmetric-Key Primitives,” CCS ’17.
2. Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang. 2018. “Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures”, CCS '18.
3. S. Chatel, A. Pyrgelis, J.R. Troncoso-Pastoriza, and J.-P. Hubaux. “Privacy and Integrity Preserving Computations with CRISP”. arXiv preprint arXiv:2007.04025, 2020.