[ad_1]
In this post from Vincenzo Iovino we present the first set of cryptographic notes that we published here. The purpose of these notes is to provide a self-contained introduction to relevant concepts in cryptography with an eye on e-voting. We will present a toy e-voting system as as a motivational example to introduce several crypto primitives needed to implement it. In particular, we will touch basic number theory, encryption, digital signatures, hash functions, commitments, secret sharing, proof systems, zero-knowledge, secure function evaluation, and distributed key generation.
In particular, the topics we covered are the following.
-
Basic probability and complexity theory
-
Zero-knowledge Proof Systems
-
Secret Sharing and Threshold Cryptography
-
Proof of knowledge and Digital Signatures
-
Commitments and applications to ZK
-
Verifiable shuffles
-
Polynomial commitments and applications to distributed key generation
-
Conclusions
If youd like to read more feel free to check out the summary here or you can read the full report here
[ad_2]
Source link