https://github.com/10d9e/fiat-shamir.sol
Zero Knowledge Proofs with Fiat-Shamir Heuristic in Solidity
https://github.com/10d9e/fiat-shamir.sol
cryptography solidity zero-knowledge zkp
Last synced: 11 months ago
JSON representation
Zero Knowledge Proofs with Fiat-Shamir Heuristic in Solidity
- Host: GitHub
- URL: https://github.com/10d9e/fiat-shamir.sol
- Owner: 10d9e
- Created: 2020-02-13T12:12:51.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2024-11-25T15:59:19.000Z (over 1 year ago)
- Last Synced: 2025-04-12T12:16:40.077Z (about 1 year ago)
- Topics: cryptography, solidity, zero-knowledge, zkp
- Language: Solidity
- Homepage:
- Size: 35.2 KB
- Stars: 14
- Watchers: 3
- Forks: 3
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Solidity Zero Knowledge Proofs with Fiat-Shamir Heuristic
### ( aka. Interactive Random Oracle Access for Zero-Knowledge Proofs )
*WIP*
Fiat-Shamir dark alchemy implemented in Solidity as a way for users to provide proofs of secret offchain knowledge without sending hashes vulnerable to dictionary attacks. Instead of a trusted setup ceremony as with a zk-snark, the "zk-niro" users derive proofs with a secret random nonce and and public random challenge from the contract during each proof verification.
### Applications
* Offchain password/data verification. Users can manage their own data locally and offchain and verify it's existance against a smart contract.
### How to use
For concrete example see [test](https://github.com/jlogelin/crypto/blob/master/test/testFiatShamir.js)
1. Generate a random prime number (n) and generator value(g).
2. Hash secret data offchain (x) Calculate (y) value as: y = gx (mod n)
3. Send (n, g, y) as seed values to the `FiatShamirZKP.registerSeed()` function.
4. Later, when the user wishes to verify offchain data, retrieve random challenge (c) from contract with `FiatShamirZKP.getChallenge()`
5. User generates a random number (v) between 0 and n and calculates (t) as: t = gv (mod n)
6. User calculates (r) as: r = v - c * x
7. User sends t and r as the zkproof to `FiatShamirZKP.verify()`. (At no point is x or v sent to the contract)
8. The contract calculates ( gr (mod n) * yc (mod n) ) verifying the resulting value with t.
The proof works because:
gr yc = g v-cx (gx)c
= gv-cx gxc
= gv-cx+cx
= gv
### To Do
Currently the library works well within the confines of solidity's 256 bit word sizes. This is ok for the purposes of research and experimentation, however it is more desirable to have a smart contract system that plays well with very large primes. Fortunately, new iterations of the EVM have included opcodes that map to bignumber precompile operations (mod, expmod, etc.) and there has been some research and development integrating these functions into solidity.
[Zcoin BigNumber Library](https://github.com/zcoinofficial/solidity-BigNumber)
### References
[How To Prove Yourself: Practical Solutions to Identification and Signature Problems ](https://link.springer.com/content/pdf/10.1007/3-540-47721-7_12.pdf)
Special thanks to [Professor Bill Buchanan, OBE](https://www.youtube.com/watch?v=n2WUJyk9cHA)