|
441
|
Public-key cryptosystems based on composite degree residuosity classes
– Pascal Paillier
- 1999
|
|
81
|
Priced Oblivious Transfer: How to Sell Digital Goods
– Bill Aiello, Yuval Ishai, Omer Reingold
- 2001
|
|
1404
|
How to leak a secret
– Ronald L. Rivest, Adi Shamir, Yael Tauman
- 2001
|
|
180
|
A Secure and Optimally Efficient Multi-Authority Election Scheme
– Ronald Cramer, Rosario Gennaro, Berry Schoenmakers
- 1997
|
|
1001
|
Probabilistic encryption
– S Goldwasser, S Micali
- 1984
|
|
58
|
Sharing decryption in the context of voting or lotteries
– Pierre-alain Fouque, Guillaume Poupard, Jacques Stern
- 2000
|
|
173
|
Practical Threshold Signatures
– Victor Shoup
- 1999
|
|
187
|
Computationally private information retrieval with polylogarithmic communication
– Christian Cachin, Silvio Micali, Markus Stadler
- 1999
|
|
33
|
A generalization, a simplification and some applications of Paillier’s probabilistic public-key system
– I DAMG˚ARD, M JURIK
- 2001
|
|
114
|
Efficient oblivious transfer protocols
– M NAOR, B PINKAS
- 2001
|
|
44
|
Practical threshold RSA signatures without a trusted dealer
– Maciej Koprowski
- 2001
|
|
706
|
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
– Amos Fiat, Adi Shamir
- 1987
|
|
62
|
Practical Multi-Candidate Election System
– O. Baudron, P.-A. Fouque, D. Pointcheval, G. Poupard, J. Stern
- 2001
|
|
1023
|
Untraceable electronic mail, return addresses, and digital pseudonyms
– David Chaum, Communications Of The Acm, R. Rivest, David L. Chaum
- 1981
|
|
961
|
A public key cryptosystem and a signature scheme based on discrete logarithms
– T ElGamal
- 1985
|
|
105
|
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
– Ronald Cramer, Victor Shoup
- 2001
|
|
574
|
A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation
– M Ben-Or, S Goldwasser, Wigderson
- 1988
|
|
76
|
Efficient Private Bidding and Auctions with an Oblivious Third Party
– Christian Cachin
- 1999
|
|
484
|
Universally composable security: A new paradigm for cryptographic protocols
– Ran Canetti
- 2005
|