Fast distributed RSA key generation for semi-honest and malicious adversaries
From MaRDI portal
Publication:1784098
DOI10.1007/978-3-319-96881-0_12zbMATH Open1436.94061OpenAlexW2884593066MaRDI QIDQ1784098FDOQ1784098
Authors: Tore Kasper Frederiksen, Yehuda Lindell, Valery Osheter, Benny Pinkas 
Publication date: 26 September 2018
Full work available at URL: https://eprint.iacr.org/2018/577.pdf
Recommendations
Cited In (19)
- Multi-party revocation in sovrin: performance through distributed trust
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Reducing the Complexity in the Distributed Computation of Private RSA Keys
- On the security of distributed multiprime RSA
- Multiparty generation of an RSA modulus
- What security can we achieve within 4 rounds?
- Title not available (Why is that?)
- Practical statistically-sound proofs of exponentiation in any group
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Going beyond dual execution: MPC for functions with efficient verification
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Toward malicious constant-rate 2PC via arithmetic garbling
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Decentralized Evaluation of Quadratic Polynomials on Encrypted Data
- Title not available (Why is that?)
- How to verifiably encrypt many bits for an election?
- Title not available (Why is that?)
- A new approach to efficient and secure fixed-point computation
- Multiparty generation of an RSA modulus
This page was built for publication: Fast distributed RSA key generation for semi-honest and malicious adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784098)
