A generalisation, a simplification and some applications of Paillier's probabilistic public-key system (2001)

by Ivan Damgård , Mads Jurik
Venue:LNCS
Citations:150 - 2 self

Active Bibliography

20 A Generalization of Paillier's Public-Key System with Applications to Electronic Voting – Ivan Damgård, Mads Jurik, Jesper Buus Nielsen - 2003
14 Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes – Ivan Damgård, Mads Jurik - 2001
9 The Theory and Implementation of an Electronic Voting System – Ivan Dåmgard, Jens Groth, Gorm Salomonsen - 2003
12 Extensions to the Paillier Cryptosystem with Applications to Cryptological Protocols – Mads J. Jurik - 2003
52 Practical threshold RSA signatures without a trusted dealer – Maciej Koprowski - 2001
11 Cryptographic Counters and Applications to Electronic Voting – Jonathan Katz, Steven Myers, Rafail Ostrovsky - 2001
19 Receipt-free homomorphic elections and write-in voter verified ballots – Alessandro Acquisti - 2004
8 Dupont: Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions – Kasper Dupont
1 Surveying and Improving Electronic Voting Schemes – Jonathan Goulet, Jeffrey Zitelli, Advisor Dr. Sampath Kannan
35 Almost Entirely Correct Mixing with Applications to Voting – Dan Boneh, Philippe Golle - 2002
124 Efficient generation of shared RSA keys – Dan Boneh, Matthew Franklin - 1997
49 Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products – Joy Algesheimer, Jan Camenisch, Victor Shoup - 2002
3 Revisiting the Distributed Key Generation for Discrete-Log Based Cryptosystems – Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin - 2003
Efficient Secure Multi-party Computation (Extended Abstract) – Martin Hirt, Ueli Maurer, Bartosz Przydatek - 2000
2 Secure and Private Online Collaboration – Keith Frikken, Keith Frikken, Keith B. Frikken - 2005
4 Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation – Martin Hirt, Jesper Buus Nielsen
8 Robust multiparty computation with linear communication complexity – Martin Hirt, Jesper Buus Nielsen - 2006
20 Y.: Constant-round multiparty computation using a black-box pseudorandom generator – Yuval Ishai - 2005
25 Robustness for free in unconditional multi-party computation – Martin Hirt, Ueli Maurer - 2001