Efficient generation of shared RSA keys. (Extended abstract)
From MaRDI portal
Recommendations
Cited in
(35)- Experimental performance of shared {RSA} modulus generation
- Generation of key predistribution schemes using secret sharing schemes
- Short RSA keys and their generation
- Delay encryption
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Selected application of the Chinese remainder theorem in multiparty computation
- A new construction of threshold cryptosystems based on RSA
- scientific article; zbMATH DE number 1583952 (Why is no real title available?)
- On the security of distributed multiprime RSA
- Adaptively secure non-interactive threshold cryptosystems
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Efficient and robust two-party RSA key generation
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- Reducing the Complexity in the Distributed Computation of Private RSA Keys
- Generating a product of three primes with an unknown factorization
- scientific article; zbMATH DE number 16481 (Why is no real title available?)
- Generation of shared RSA keys by two parties
- scientific article; zbMATH DE number 1942435 (Why is no real title available?)
- scientific article; zbMATH DE number 2081073 (Why is no real title available?)
- scientific article; zbMATH DE number 1775456 (Why is no real title available?)
- Two party RSA key generation. (Extended abstract)
- Robust protocol for generating shared RSA parameters
- Weaknesses in shared RSA key generation protocols
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Efficient generation of shared RSA keys
- Efficient distributed computation modulo a shared secret
- Multiparty generation of an RSA modulus
- Efficient verifiable delay functions
- Multiparty generation of an RSA modulus
- A Trustless GQ Multi-signature Scheme with Identifiable Abort
- Cryptanalysis of algebraic verifiable delay functions
- Tiresias: large scale, UC-secure threshold Paillier
This page was built for publication: Efficient generation of shared RSA keys. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364568)
