Commitment scheme
A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen statement) while keeping it hidden to others, with the ability to reveal the committed value later. Commitment schemes are designed so that a party cannot change the value or statement after they have committed to it: that is, commitment schemes are binding. Commitment schemes have important applications in a number of cryptographic protocols including secure coin flipping, zero-knowledge proofs, and secure computation.
Commitment scheme - Wikipedia Jump to content From Wikipedia, the free encyclopedia Cryptographic scheme For the use of committed identities on Wikipedia, see Template:Committed identity . This article needs more citations . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . Find sources: "Commitment scheme" – news · newspapers · books · scholar · JSTOR ( October 2014 ) ( Learn how and when to remove this message ) A commitment scheme is a cryptographic primitive that allows one to commit to a chosen value (or chosen st
Explore this link on the map →related reading
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- KZG polynomial commitments · Dankrad Feistdankradfeist.de
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Applied Crypto #2: Polynomial Commitments | ZK Learning Resourceslearn.0xparc.org
- Pedersen Commitments, Divide-and-Conquer, and the Inner Product Argument - notes.0xparc.orgnotes.0xparc.org
- The Polynomial Commitment - notes.0xparc.orgnotes.0xparc.org
- thesis.pdfaayushg.com
- Functional Commitments for All Functions, with Transparent Setup and from SISeprint.iacr.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Math & Engineeringxn--2-umb.com
- Secure multi-party computation - Wikipediaen.wikipedia.org
- Inner Product Arguments · Dankrad Feistdankradfeist.de