1 |
L. Kissner and D. Song: Privacy-preserving set operations, CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pp.241-257, Springer-Verlag, 2005.
|
2 |
R. Cleve: Limits on the security of coin flips when half the processors are faulty(extended abstract), in STOC, pp.364-369, 1986.
|
3 |
J. Hong, J. Kim, J. Kim, M. K. Franklin, K. Park: Fair Threshold Decryption with Semi-Trusted Third Parties, in ACISP 2009, pp.309-326, 2009.
|
4 |
R. Gennaro, S. Halevi, H. Krawczyk, T. Rabin: Threshold RSA for dynamic and ad-hoc groups, In Eurocrypt 2008, LNCS, vol.4965, pp.88-107, Springer, 2008.
|
5 |
P. Fouque, G. Poupard, J. Stern: Sharing decryption in the context of voting of lotteries, Financial Cryptography 2000, 2000.
|
6 |
V. Shoup: Practical threshold signatures, In Eurocrypt 2000, 2000.
|
7 |
G. Danezis, C. Diaz: A Survey of Anonymous Communication Channels, Microsoft Technical Report MSR-TR-2008-35, 2008.
|
8 |
B. Pinkas: Fair secure two-party computation, Eurocrypt 2003, 2003.
|
9 |
J. A. Garay, P. D. MacKenzie, M. Prabhakaran, K. Yang: Resource Fairness and Composability of Cryptographic Protocols, TCC 2006.
|
10 |
D. Chaum: Untraceable electronic mail, return addresses, and digital pseudo-nyms, Communications of the ACM, 4(2), February 1982.
|
11 |
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin: Secure distributed key generation for discrete-log based cryptosystems, J. Cryptology, 20(1):51-83, 2007.
DOI
ScienceOn
|