Multiparty generation of an RSA modulus

DOI10.1007/978-3-030-56877-1_3MaRDI QIDQ5918574zbMATH OpenOpenAlexFDO

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

Publication date 7 December 2022

Published in Advances in Cryptology – CRYPTO 2020 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-56877-1_3

zbMATH Keywords

malicious behaviorsampling-and-sieving technique

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Multiparty generation of an RSA modulus
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• scientific article; zbMATH DE number 1418291
• On the security of distributed multiprime RSA
• Efficient and robust two-party RSA key generation

Cites work

• scientific article; zbMATH DE number 1302782 (Why is no real title available?)
• scientific article; zbMATH DE number 1088251 (Why is no real title available?)
• scientific article; zbMATH DE number 1182504 (Why is no real title available?)
• scientific article; zbMATH DE number 1942435 (Why is no real title available?)
• scientific article; zbMATH DE number 1775456 (Why is no real title available?)
• scientific article; zbMATH DE number 1418291 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient generation of shared RSA keys
• Efficient verifiable delay functions
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Fairness versus guaranteed output delivery in secure multiparty computation
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Foundations of Cryptography
• Low cost constant round MPC combining BMR and oblivious transfer
• Probabilistic algorithm for testing primality
• RSA Chips (Past/Present/Future) (Extended abstract)
• Riemann's hypothesis and tests for primality
• Secure multi-party computation with identifiable abort
• Simple verifiable delay functions

Cited in

(17)

• Multi-party revocation in sovrin: performance through distributed trust
• On the security of distributed multiprime RSA
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• scientific article; zbMATH DE number 1950328 (Why is no real title available?)
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Multiparty generation of an RSA modulus
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• On the impossibility of actively secure distributed samplers
• scientific article; zbMATH DE number 1182504 (Why is no real title available?)
• Practical statistically-sound proofs of exponentiation in any group
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Cryptanalysis of algebraic verifiable delay functions
• Secure multiparty computation with identifiable abort via vindicating release
• scientific article; zbMATH DE number 1186946 (Why is no real title available?)
• Minimizing setup in broadcast-optimal two round MPC
• A new approach to efficient and secure fixed-point computation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918574)