Efficient generation of shared RSA keys
From MaRDI portal
Recommendations
Cited in
(30)- Experimental performance of shared {RSA} modulus generation
- Threshold undeniable signature scheme based on conic
- Short RSA keys and their generation
- New methods and abstractions for RSA-based forward secure signatures
- Efficient RSA key generation and threshold Paillier in the two-party setting
- A robust \((k,n)+1\) threshold proxy signature scheme based on factoring
- scientific article; zbMATH DE number 1583952 (Why is no real title available?)
- Efficient set intersection with simulation-based security
- Efficient ZHFE Key Generation
- Efficient RSA key generation and threshold Paillier in the two-party setting
- On the security of distributed multiprime RSA
- A signature scheme for a dynamic coalition defence environment without trusted third parties
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Efficient and robust two-party RSA key generation
- scientific article; zbMATH DE number 16481 (Why is no real title available?)
- 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 1424179 (Why is no real title available?)
- Efficient distributed computation modulo a shared secret
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Multiparty generation of an RSA modulus
- Multiparty generation of an RSA modulus
- Secure multiparty computation with identifiable abort via vindicating release
- How (not) to hash into class groups of imaginary quadratic fields?
- Compact zero-knowledge arguments for Blum integers
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
This page was built for publication: Efficient generation of shared RSA keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441356)