Efficient, Robust and Constant-Round Distributed RSA Key Generation
From MaRDI portal
Publication:3408194
DOI10.1007/978-3-642-11799-2_12zbMath1274.94059MaRDI QIDQ3408194
Ivan B. Damgård, Gert Læssøe Mikkelsen
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_12
Related Items
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Efficient Secure Two-Party Exponentiation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic algorithm for testing primality
- How to share a secret
- Average Case Error Estimates for the Strong Probable Prime Test
- On the Theory and Practice of Personal Digital Signatures
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Efficient generation of shared RSA keys
- Theory of Cryptography
- Public Key Cryptography - PKC 2006
- Advances in Cryptology - ASIACRYPT 2003