Yair Frankel, Philip D. MacKenzie, and Moti Yung. Robust e#cient distributed RSA-key generation. In Thirtieth Annual ACM Symposium on Theory of Computing -- STOC '98, pages 663--672. ACM Press, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Computation Modulo a Shared Secret with.. - Algesheimer.. (2002) (3 citations) (Correct)
.... et al. 5] As our protocols rely mainly on distributed multiplication over a prime field, rather than over the integers, one can easily make them robust using traditional techniques for verifiable secret sharing modulo a prime, avoiding the somewhat less e#cient techniques by Frankel et al. [16] for robust distributed multiplication over the integers. Moreover, using the optimistic approach mentioned above, even further improvements are possible, so that we can get robustness essentially for free. 2 Model We consider k players P 1 , P k that are mutually connected by secure ....
Y. Frankel, P. MacKenzie, and M. Yung. Robust e#cient distributed RSA key generation. In Proc. 30th Annual ACM STOC, pp. 663--672, 1998.
Blind, Auditable Membership Proofs - Sander, Ta-Shma, Yung (2000) (1 citation) Self-citation (Yung) (Correct)
No context found.
Y. Frankel, P. MacKenzie, and M. Yung. Robust e#cient distributed RSA-Key generation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing #STOC-98#, pages 663#672, New York, May 23#26 1998. ACM Press.
Threshold Cryptosystems Based on Factoring - Katz, Yung (2001) (1 citation) Self-citation (Yung) (Correct)
....for the entire system. Thus, it is often desirable to distribute the key generation phase of the protocol among the participants. This was first accomplished for discrete logbased cryptosystems in [29, 6] building on [40] and for RSA based cryptosystems in [3] for passive adversaries) and [24] (for the case of active adversaries) There is still a need to design threshold systems for many important specific cryptosystems and applications (note that most previous research on threshold cryptosystems was restricted to RSA and discrete log based schemes and e#ciency improvements ....
.... even though a previous solution existed [21] the protocol of [43] is substantially more practical (for N a product of strong primes) A final example is [8] which suggests a way to improve the e#ciency (and roundcomplexity) of an important step in the distributed key generation protocols of [3, 24]. For threshold cryptography to become truly practical, further e#orts to improve the e#ciency of existing solutions are needed. 1.1 Our Contributions Threshold homomorphic encryption. We present a threshold decryption scheme for Goldwasser Micali (GM) encryption based on the quadratic ....
[Article contains additional citation context not shown here]
Y. Frankel, P. MacKenzie, and M. Yung. Robust E#cient Distributed RSA Key Generation. STOC '98.
GBD Threshold Cryptography with an Application to RSA.. - Steketee, Brown.. (2005) (Correct)
No context found.
Yair Frankel, Philip D. MacKenzie, and Moti Yung. Robust e#cient distributed RSA-key generation. In Thirtieth Annual ACM Symposium on Theory of Computing -- STOC '98, pages 663--672. ACM Press, 1998.
Threshold Undeniable RSA Signature Scheme - Guilin Wang Sihan (2001) (Correct)
No context found.
Y. Frankel, P. D. MacKenzie, and M. Yung. Robust E#cient Distributed RSA-Key Generation. In 30th STOC, pp. 663-672. ACM, 1998.
Extensions to the Paillier Cryptosystem with Applications to.. - Jurik (2003) (Correct)
No context found.
Y. Frankel, P. MacKenzie, and M. Yung: Robust E#cient Distributed RSAkey Generation, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC 98), pp. 663-672. ACM Press, 1998.
Efficient Computation Modulo a Shared Secret with.. - Algesheimer.. (2002) (3 citations) (Correct)
No context found.
Yair Frankel, Phil MacKenzie, and Moti Yung. Robust e#cient distributed rsa key generation. In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pages 663--672, 1987.
A Generalization of Paillier's Public-Key System with.. - Damgard, Jurik, Nielsen (2003) (2 citations) (Correct)
No context found.
Y. Frankel, P. MacKenzie and M. Yung: Robust E#cient Distributed RSA-key Generation, proceedings of STOC 98, pp. 663-672.
Threshold Cryptography Secure Against the Adaptive Adversary.. - Lysyanskaya (2000) (1 citation) (Correct)
No context found.
Yair Frankel, Philip MacKenzie, and Moti Yung. Robust e- cient distributed rsa-key generation. In Proc. 30th ACM Symp. on Theory of Computing, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC