Author:
Publisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages : 298
Book Description
Proceedings of the ... Annual ACM Symposium on Principles of Distributed Computing
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing
Author:
Publisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages :
Book Description
Publisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages :
Book Description
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing
Author:
Publisher: Association for Computing Machinery (ACM)
ISBN:
Category : Computers
Languages : en
Pages : 420
Book Description
Publisher: Association for Computing Machinery (ACM)
ISBN:
Category : Computers
Languages : en
Pages : 420
Book Description
PODC '94
Author: ACM Special Interest Group for Automata and Computability Theory
Publisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages : 406
Book Description
Publisher:
ISBN:
Category : Electronic data processing
Languages : en
Pages : 406
Book Description
Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed Computing
Author:
Publisher:
ISBN:
Category : Computer science
Languages : en
Pages : 388
Book Description
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of parties. Given two numbers x and e, the protocol computes y such that ye=x (mod N). A synchronous protocol for this task has been presented by Catalano, Gennaro, and Halevi (Eurocrypt 2000), but the standard approach for turning this into an asynchronous protocol would require a Byzantine-agreement sub-protocol. Our protocol adopts their approach, but exploits a feature of the problem in order to avoid the use of a Byzantine agreement primitive. Hence, it leads to efficient asynchronous protocols for threshold signatures and for Byzantine agreement based on the strong RSA assumption, without the use of random oracles.
Publisher:
ISBN:
Category : Computer science
Languages : en
Pages : 388
Book Description
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of parties. Given two numbers x and e, the protocol computes y such that ye=x (mod N). A synchronous protocol for this task has been presented by Catalano, Gennaro, and Halevi (Eurocrypt 2000), but the standard approach for turning this into an asynchronous protocol would require a Byzantine-agreement sub-protocol. Our protocol adopts their approach, but exploits a feature of the problem in order to avoid the use of a Byzantine agreement primitive. Hence, it leads to efficient asynchronous protocols for threshold signatures and for Byzantine agreement based on the strong RSA assumption, without the use of random oracles.
Proceedings of the Sixteenth ACM Symposium on Principles of Distributed Computing
Author:
Publisher: Association for Computing Machinery (ACM)
ISBN:
Category : Computers
Languages : en
Pages : 316
Book Description
Publisher: Association for Computing Machinery (ACM)
ISBN:
Category : Computers
Languages : en
Pages : 316
Book Description
PODC 2006
Author:
Publisher:
ISBN:
Category : Distributed databases
Languages : en
Pages : 340
Book Description
Publisher:
ISBN:
Category : Distributed databases
Languages : en
Pages : 340
Book Description
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, Atlanta, Georgia, USA, May 3-6, 1999
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing
Author: ACM Special Interest Group for Automata and Computability Theory
Publisher: Association for Computing Machinery (ACM)
ISBN:
Category : Computers
Languages : en
Pages : 372
Book Description
Publisher: Association for Computing Machinery (ACM)
ISBN:
Category : Computers
Languages : en
Pages : 372
Book Description