Multiparty generation of an RSA modulus
From MaRDI portal
Publication:5918574
DOI10.1007/978-3-030-56877-1_3zbMath1504.94121OpenAlexW3021703869MaRDI QIDQ5918574
Ran Cohen, Megan Chen, Yashvanth Kondi, Abhi Shelat, Schuyler Rosefield, Eysa Lee, Jack Doerner
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
Related Items
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Multiparty generation of an RSA modulus
Cites Work
- 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 RSA key generation and threshold Paillier in the two-party setting
- Secure Multi-Party Computation with Identifiable Abort
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- A method for obtaining digital signatures and public-key cryptosystems
- Foundations of Cryptography
- RSA Chips (Past/Present/Future) (Extended abstract)
- Simple verifiable delay functions
- Efficient generation of shared RSA keys
- From fairness to full security in multiparty computation
- Efficient verifiable delay functions
- Low cost constant round MPC combining BMR and oblivious transfer
