Multiparty generation of an RSA modulus

DOI10.1007/s00145-021-09395-yzbMath1486.94085OpenAlexW3049486278MaRDI QIDQ5970801

Schuyler Rosefield, Yashvanth Kondi, Jack Doerner, Eysa Lee, Megan Chen, Abhi Shelat, Ran Cohen

Publication date: 4 April 2022

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-021-09395-y

zbMATH Keywords

RSAconcrete efficiencymultiparty computationthreshold cryptographybiprime sampling

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• Fairness versus guaranteed output delivery in secure multiparty computation
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Efficient pseudorandom correlation generators: silent OT extension and more
• Probabilistic termination and composability of cryptographic protocols
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Secure multi-party computation without agreement
• Efficient cryptographic schemes provably as secure as subset sum
• Approximate formulas for some functions of prime numbers
• Secure Multi-Party Computation with Identifiable Abort
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
• Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Actively Secure OT Extension with Optimal Overhead
• Universally composable two-party and multi-party secure computation
• A method for obtaining digital signatures and public-key cryptosystems
• Foundations of Cryptography
• RSA Chips (Past/Present/Future) (Extended abstract)
• Simple verifiable delay functions
• Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
• Resilient-optimal interactive consistency in constant time
• Efficient generation of shared RSA keys
• Theory of Cryptography
• Public Key Cryptography - PKC 2006
• From fairness to full security in multiparty computation
• Multiparty generation of an RSA modulus
• Efficient verifiable delay functions
• Low cost constant round MPC combining BMR and oblivious transfer

This page was built for publication: Multiparty generation of an RSA modulus