Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Joy Algesheimer , Jan Camenisch , Victor Shoup

Citations:

42 - 0 self

BibTeX

@MISC{Algesheimer02efficientcomputation,
    author = {Joy Algesheimer and Jan Camenisch and Victor Shoup},
    title = {Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products},
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We present a new protocol for ecient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1404	How to share a secret - Shamir - 1979
574	A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation - Ben-Or, Goldwasser, et al. - 1988
331	Security and Composition of Multiparty Cryptographic Protocols - Canetti - 2000
289	Zero Knowledge Proofs of Identity - Feige, Fiat, et al. - 1987
209	A practical and provably secure coalition-resistant group signature scheme - Ateniese, Camenisch, et al. - 2000
173	Practical threshold signatures - Shoup - 2000
127	Signature schemes based on the strong RSA assumption - Cramer, Shoup
112	Efficient generation of shared rsa keys - Boneh, Franklin
106	Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi, et al. - 1999
101	Non-cryptographic fault-tolerant computing in constant number of rounds of interaction - Bar-Ilan, Beaver - 1989
78	Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation - Camenisch, Lysyanskaya - 2001
78	A simplified approach to threshold and proactive rsa - Rabin - 1998
77	Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract - Ben-Or, Goldwasser - 1988
69	Simplified VSS and fast-track multiparty computations with applications to threshold cryptography - Gennaro, Rabin, et al. - 1998
66	Robust and efficient sharing of RSA functions - Gennaro, Jarecki, et al.
44	Practical threshold rsa signatures without a trusted dealer - Damg˚ard, Koprowski - 2001
44	Robust Efficient Distributed RSA-Key Generation - Frankel, MacKenzie, et al. - 1998
33	Experimenting with shared generation of rsa keys - Malkin, Wu, et al. - 1999
30	Joint encryption and message-efficient secure computation - Franklin, Haber - 1996
26	Computing inverses over a shared secret modulus - Catalano, Gennaro, et al. - 2000
19	E#cient generation of shared RSA keys - Boneh, Franklin - 1997
17	2001, ‘Fully Distributed Threshold RSA under Standard Assumptions - Foque, Stern
12	Robust ecient distributed RSA-key generation - Frankel, MacKenzie, et al. - 1998
9	Simplified vss and fast-track multiparty computations with applications to threshold cryptography - Genarro, Rabin, et al. - 1998
8	Joint encryption and message-ecient secure computation - Fraklin, Haber - 1996
1	The Design and Analyis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
1	Robust and ef sharing of RSA functions - Gennaro, Jarecki, et al. - 1996