Decentralized Threshold Key Generation & Decryption
1795
Polynomial Interpolation Method
The French Academy of Sciences
1979
How to Share a Secret
Turing Award Winner, Weizmann Institute and Massachusetts Institute of Technology
1991
Verifiable Secret Sharing Scheme
MIT Computer Science & Artificial Intelligence Laboratory
1992
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Aarhus University, Denmark
Discrete Logarithm Encryption
1976
New Directions in Cryptography
Turing Award Winners, Stanford University
1978
Secure communications over insecure channels
University of California Berkeley & Georgia Institute of Technology
1985
A public key cryptosystem and a signature scheme based on discrete logarithms
Stanford University
Anonymization Mixnet
1986
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Tel Aviv University, Weizmann Institute of Science, and Massachusetts Institute of Technology
2001
A Verifiable Secret Shuffle and its Application to E-Voting
Princeton University
Elliptic Curve Cryptography
1987
Speeding the Pollard and Elliptic Curve Methods of Factorization
University of California, Los Angeles
2006
Curve25519: new Diffie-Hellman speed records
University of Illinois at Chicago, Eindhoven University of Technology
2018
Ristretto 255: Prime Order Groups
Stanford University