D. Beaver, "Security, Fault-Tolerance, and Communication Complexity for Distributed Systems," Harvard University Ph.D. Thesis, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Generation of Shared RSA keys (Extended Abstract) - Boneh, Franklin (Correct)
....reduce directly to our solution for two parties with a helper. The idea is essentially the same as for the distributed computation of N in the preceding paragraph. For k 3, trial division can be done dk=2e Gamma 1 privately, but a different protocol must be used. We adapt an idea due to Beaver [2]. Let q = q 1 : q k be an integer shared among the k parties. Let p be a small prime. To test if p divides q each party picks a random number r i 2 ZZ p . Using the BGW protocol they compute qr = P q i ) P r i ) mod p. If qr 6= 0 then p does not divide q. Furthermore, since r is ....
D. Beaver, "Security, fault tolerance, and communication complexity in distributed systems," Ph.D. thesis, Harvard University, May 1990.
The Round Complexity of Secure Protocols - Beaver, Micali, Rogaway (1990) (45 citations) (Correct)
No context found.
D. Beaver, "Security, Fault-Tolerance, and Communication Complexity for Distributed Systems," Harvard University Ph.D. Thesis, 1990.
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