Niv Gilboa  Home/Search
Context Related
| cs.technion.ac.il/~gilboa/rsa2805.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/~gilboa/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible. 1 Introduction We show how two parties can jointly generate RSA public and private keys.... (Update)
Cited by: More
Invited Survey Paper - Directions In Polynomial (Correct)
Fast Three-Party Shared Generation of RSA Keys without.. - Ibrahim, Ibrahim.. (2004) (Correct)
Two-Party Private Vector Dominance: The All-Or-Nothing Deal - Maged Hamada Ibrahim (Correct)
Active bibliography (related documents): More All
0.4: Fast Fully-Distributed and Threshold RSA Function Sharing - Ibrahim, Ibrahim, El-Sawy (2004) (Correct)
0.3: Fully Distributed Threshold RSA under Standard Assumptions - Fouque, Stern (Correct)
0.3: Efficient Two Party Multi-Prime RSA Key Generation - Straub (2003) (Correct)
Similar documents based on text: More All
0.2: Secure Sessions from Weak Secrets - Roe, Christianson, Wheeler (1998) (Correct)
0.2: Key-Insulated Public-Key Cryptosystems - Dodis, Katz, Xu, Yung (2002) (Correct)
0.1: Case-Based Knowledge And Induction - Gilboa, Schmeidler (1996) (Correct)
Related documents from co-citation: More All
10: Oblivious Transfer and Polynomial Evaluation (context) - Naor, Pinkas - 1998
10: Efficient generation of shared RSA keys - Boneh, Franklin
10: Generation of shared rsa keys by two parties - Poupard, Stern - 1998
BibTeX entry: (Update)
N. Gilboa, Two Party RSA Key Generation, Proc of Crypto '99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 116--129, 1999. http://citeseer.ist.psu.edu/gilboa99two.html More
@inproceedings{ gilboagilboatwo,
author = "Niv Gilboa",
title = "Two Party {RSA} Key Generation",
pages = "116--129",
url = "citeseer.ist.psu.edu/gilboa99two.html" }
Citations (may not include all citations):404 Journal of Computer and systems science (context) - Goldwasser, Micali - 1984
287 Multiparty unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988
250 How to play any mental game (context) - Goldreich, Micali et al. - 1987
219 Completeness theorems for noncryptographic fault-tolerant di.. (context) - Ben-OR, Goldwasser et al. - 1988
185 How to generate and exchange secrets (context) - Yao - 1986
174 Private information retrieval - Chor, Goldreich et al. - 1995
102 Oblivious transfer and polynomial evaluation (context) - Naor, Pinkas - 1999
98 Computationally private information retrieval with polylogar.. - Cachin, Micali et al. - 1999
83 Protecting data privacy in private information retrieval sch.. - Gertner, Ishai et al. - 1998
55 Efficient generation of shared rsa keys - Boneh, Franklin - 1997
53 Verifiable Secret-Ballot Elections (context) - Benaloh - 1987
25 A new and efficient all--or-nothing disclosure of secrets pr.. - Stern - 1998
22 Robust efficient distributed rsa-key generation - Frankel, MacKenzie et al. - 1998
21 Split knowledge generation of rsa parameters (context) - Cocks - 1997
15 Generation of shared rsa keys by two parties - Poupard, Stern - 1998
12 European Transactions on Telecommunications and Related Tech.. (context) - Desmedt - 1994
12 Single-database computationally private information retrieva.. (context) - Kushilevitz, Ostrovsky - 1997
5 Split generation of rsa parameters with multiple participant.. (context) - Cocks - 1998
1 Storing a sparse table in o (context) - Fredman, Komlos et al. - 1984
1 How to share a function securly (context) - DeSantis, Desmedt et al. - 1994
1 the number of uncancelled elements in the sieve of eratosthe.. (context) - DeBruijn - 1950
1 Dense probabilstic encryption (context) - Benaloh - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.technion.ac.il/~gilboa/):
Compressing Cryptographic Resources (Extended Abstract) - Gilboa, Ishai (Correct)
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