Fast distributed RSA key generation for semi-honest and malicious adversaries
From MaRDI portal
(Redirected from Publication:1784098)
Recommendations
Cited in
(21)- What security can we achieve within 4 rounds?
- Going beyond dual execution: MPC for functions with efficient verification
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient RSA key generation and threshold Paillier in the two-party setting
- On the security of distributed multiprime RSA
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Reducing the Complexity in the Distributed Computation of Private RSA Keys
- scientific article; zbMATH DE number 16481 (Why is no real title available?)
- scientific article; zbMATH DE number 1740041 (Why is no real title available?)
- scientific article; zbMATH DE number 1775456 (Why is no real title available?)
- Multiparty generation of an RSA modulus
- Multiparty generation of an RSA modulus
- Practical statistically-sound proofs of exponentiation in any group
- How to verifiably encrypt many bits for an election?
- Decentralized Evaluation of Quadratic Polynomials on Encrypted Data
- A new approach to efficient and secure fixed-point computation
- Toward malicious constant-rate 2PC via arithmetic garbling
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- On the impossibility of actively secure distributed samplers
- Multi-party revocation in sovrin: performance through distributed trust
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)
