Tore Kasper Frederiksen
Research Subjects
Research Interests
Tore Kasper Frederiksen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Bernardo David
IT University of Copenhagen
1 shared publication - Carsten Baum
Technical University of Denmark
1 shared publication - Claudio Orlandi
Aarhus University
1 shared publication - Ivan Damgård
Aarhus University
1 shared publication - Jakob Burkhardt
Aarhus University, Aarhus, Denmark
1 shared publication - James Hsin-Yu Chiang
Technical University of Denmark
1 shared publication
Latest Publications
- 1 December 2023
- Published by Springer Nature
- p. 270-288
Eagle: Efficient Privacy Preserving Smart Contracts
- 1 December 2023
- Published by Springer Nature
- p. 270-288
Eagle: Efficient Privacy Preserving Smart Contracts
- Open Access
- 15 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 2501-2515
Improved Distributed RSA Key Generation Using the Miller-Rabin Test
Secure distributed generation of RSA moduli (e.g., generating N=pq where none of the parties learns anything about p or q) is an important cryptographic task, that is needed both in threshold implementations of RSA-based cryptosystems and in other, advanced cryptographic protocols that assume that all the parties have access to a trusted RSA modulo. In this paper, we provide a novel protocol for secure distributed RSA key generation based on the Miller-Rabin test. Compared with the more commonly used Boneh-Franklin test (which requires many iterations), the Miller-Rabin test has the advantage of providing negligible error after even a single iteration of the test for large enough moduli (e.g., 4096 bits). From a technical point of view, our main contribution is a novel divisibility test which allows to perform the primality test in an efficient way, while keeping p and q secret. Our semi-honest RSA generation protocol uses any underlying secure multiplication protocol in a black-box way, and our protocol can therefore be instantiated in both the honest or dishonest majority setting based on the chosen multiplication protocol. Our semi-honest protocol can be upgraded to protect against active adversaries at low cost using existing compilers. Finally, we provide an experimental evaluation showing that for the honest majority case, our protocol is much faster than Boneh-Franklin.
- 15 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 2501-2515
Open AccessImproved Distributed RSA Key Generation Using the Miller-Rabin Test
Secure distributed generation of RSA moduli (e.g., generating N=pq where none of the parties learns anything about p or q) is an important cryptographic task, that is needed both in threshold implementations of RSA-based cryptosystems and in other, advanced cryptographic protocols that assume that all the parties have access to a trusted RSA modulo. In this paper, we provide a novel protocol for secure distributed RSA key generation based on the Miller-Rabin test. Compared with the more commonly used Boneh-Franklin test (which requires many iterations), the Miller-Rabin test has the advantage of providing negligible error after even a single iteration of the test for large enough moduli (e.g., 4096 bits). From a technical point of view, our main contribution is a novel divisibility test which allows to perform the primality test in an efficient way, while keeping p and q secret. Our semi-honest RSA generation protocol uses any underlying secure multiplication protocol in a black-box way, and our protocol can therefore be instantiated in both the honest or dishonest majority setting based on the chosen multiplication protocol. Our semi-honest protocol can be upgraded to protect against active adversaries at low cost using existing compilers. Finally, we provide an experimental evaluation showing that for the honest majority case, our protocol is much faster than Boneh-Franklin.