Strong primes are easy to find
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Zero-knowledge proofs of identity
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A modification of the Fiat-Shamir scheme
CRYPTO '88 Proceedings on Advances in cryptology
A practical protocol for large group oriented networks
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Fast signature generation with a Fiat Shamir—like scheme
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communications of the ACM
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Split Knowledge Generation of RSA Parameters
Proceedings of the 6th IMA International Conference on Cryptography and Coding
Generating a Product of Three Primes with an Unknown Factorization
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Optimal-resilience proactive public-key cryptosystems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Security, fault tolerance, and communication complexity in distributed systems
Security, fault tolerance, and communication complexity in distributed systems
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computing inverses over a shared secret modulus
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Fine-grained control of security capabilities
ACM Transactions on Internet Technology (TOIT)
Efficient and secure self-escrowed public-key infrastructures
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Mobile device protection from loss and capture
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On the Theory and Practice of Personal Digital Signatures
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Maintaining object ordering in a shared P2P storage environment
Maintaining object ordering in a shared P2P storage environment
PACISSO: P2P access control incorporating scalability and self-organization for storage systems
PACISSO: P2P access control incorporating scalability and self-organization for storage systems
Efficient ring signatures without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Distributed paillier cryptosystem without trusted dealer
WISA'10 Proceedings of the 11th international conference on Information security applications
TATA: towards anonymous trusted authentication
iTrust'06 Proceedings of the 4th international conference on Trust Management
GBD threshold cryptography with an application to RSA key recovery
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Efficient, robust and constant-round distributed RSA key generation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Optimizing robustness while generating shared secret safe primes
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Server-aided RSA key generation against collusion attack
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient RSA key generation and threshold paillier in the two-party setting
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Collusion-resistant outsourcing of private set intersection
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
We describe efficient techniques for a number of parties to jointly generate an RSA key. At the end of the protocol an RSA modulus N = pq is publicly known. None of the parties know the factorization of N. In addition a public encryption exponent is publicly known and each party holds a share of the private exponent that enables threshold decryption. Our protocols are efficient in computation and communication. All results are presented in the honest but curious scenario (passive adversary).