9,026 Hits in 3.2 sec

Robust efficient distributed RSA-key generation

Yair Frankel, Philip D. MacKenzie, Moti Yung
1998 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98  
In this work we solve the open problem of robust, efficient and secure generation of shared RSA keys (or more generally, keys based on multiplying two large primes and exponentiation).  ...  Another important step regarding "distributed cryptographic functions" is the (efficient) distributed generation of the function (the key shares).  ... 
doi:10.1145/277697.277779 dblp:conf/podc/FrankelMY98 fatcat:52qdyjspxja3dpyxiuilim43ry

Efficient, Robust and Constant-Round Distributed RSA Key Generation [chapter]

Ivan Damgård, Gert Læssøe Mikkelsen
2010 Lecture Notes in Computer Science  
We present the first protocol for distributed RSA key generation which is constant round, secure against malicious adversaries and has a negligibly small bound on the error probability, even using only  ...  Specifically for distributed RSA key generation, the main problem is to generate a modulus such that the prime factors are shared among the players.  ...  Introduction The idea of distributed key generation is to generate a key in secret shared form among a number players such that it is never available in a single location.  ... 
doi:10.1007/978-3-642-11799-2_12 fatcat:higzctev6vd2dcyjx7bpypinvy

Distributed Paillier Cryptosystem without Trusted Dealer [chapter]

Takashi Nishide, Kouichi Sakurai
2011 Lecture Notes in Computer Science  
setup can be done -by a trusted party • Single point of attack -by MPC again w/o trusted party (dealer) • Called Distributed Key Generation (DKG) 5 Key Setup & Threshold Decryption 6 P  ...  techniques -We use the different robustness techniques -The private key of Paillier is different from that of RSA , so we need to construct a different robust protocol 8 Related Work (Cont'd  ... 
doi:10.1007/978-3-642-17955-6_4 fatcat:klxdd4y5xzh6zlyhbry3tuv2te

"Pseudorandom Intermixing": A Tool for Shared Cryptography [chapter]

Yair Frankel, Philip MacKenzie, Moti Yung
2000 Lecture Notes in Computer Science  
Designing distributed cryptographic protocols that combine correctness, security, efficiency and practical constraints can be very difficult.  ...  We concentrate on the area of "distributed public key systems," which has been a very active area of research in the last decade, and for which there is a great interest in practical implementations of  ...  The (centralized/distributed) dealer generates an RSA with a public key (e, n) and a private key d. 2.  ... 
doi:10.1007/978-3-540-46588-1_21 fatcat:4bk7n5hyd5a5hf6bekpx6ilcfe

A simplified approach to threshold and proactive RSA [chapter]

Tal Rabin
1998 Lecture Notes in Computer Science  
These results are derived from a new general technique for transforming distributed computations for which there is a known n-out-n solution into threshold and robust computations.  ...  We present a solution to both the robust threshold RSA and proactive RSA problems. Our solutions are conceptually simple, and allow for an easy design of the system.  ...  an RSA key in a distributed manner.  ... 
doi:10.1007/bfb0055722 fatcat:br5gnkaoizbtbcicpsiq3jghs4

Fully Distributed Threshold RSA under Standard Assumptions [chapter]

Pierre-Alain Fouque, Jacques Stern
2001 Lecture Notes in Computer Science  
However, Shoup's protocol assumes a trusted dealer to generate and distribute the keys.  ...  The only practical result to generate RSA moduli in a distributive manner is Boneh and Franklin's protocol but it seems difficult to modify it in order to generate the kind of RSA moduli that Shoup's protocol  ...  There exist protocols that generate RSA keys in a distributive manner [4, 18, 9, 10, 3, 30, 23] .  ... 
doi:10.1007/3-540-45682-1_19 fatcat:vifsdwy5mvgmfd6eqpkqyriqri

Further Simplifications in Proactive RSA Signatures [chapter]

Stanisław Jarecki, Nitesh Saxena
2005 Lecture Notes in Computer Science  
We present a new robust proactive (and threshold) RSA signature scheme secure with the optimal threshold of t < n/2 corruptions.  ...  The new scheme is conceptually simple because all the sharing and proactive re-sharing of the RSA secret key is done modulo a prime, while the reconstruction of the RSA signature employs an observation  ...  The dealer generates RSA private/public key pair, i.e. an RSA modulus N , public exponent e, and private key d = e −1 mod φ(N ).  ... 
doi:10.1007/978-3-540-30576-7_28 fatcat:cthznnve4jbwriii5e7d25h3da

A Distributed Pseudonym Management Scheme in VANETs

Xiaoling Zhu, Yang Lu, Benhong Zhang, Zhengfeng Hou
2013 International Journal of Distributed Sensor Networks  
The distributed tracking protocol is proposed to enhance the robustness for tracking, which is based on the improved scheme for shared generation of RSA keys.  ...  Moreover, the performance analysis shows that it is efficient in VANETs.  ...  Based on the improved share generation scheme of the RSA keys, the distributed tracking protocol is proposed to avoid a single point of failure.  ... 
doi:10.1155/2013/615906 fatcat:m5l3sq4b3nbc5i2jwqwmhda3jq

Robust and Efficient Sharing of RSA Functions [chapter]

Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, Tal Rabin
1996 Lecture Notes in Computer Science  
In addition, these techniques apply to shared RSA decryption as well, thus leading to efficient key escrow schemes for RSA.  ...  Our robust protocols achieve optimal resiliency as they can tolerate up to ( N -1)/2 faults, and their efficiency is comparable to the efficiency of the underlying threshold RSA signature scheme.  ...  Thus, achieving an efficient, robust, threshold-RSA signature scheme.  ... 
doi:10.1007/3-540-68697-5_13 fatcat:i6enacw4czdq3cbbao3v4bwidm

An Efficient Encryption Algorithm for P2P Networks Robust Against Man-in-the-Middle Adversary [article]

Roohallah Rastaghi
2013 arXiv   pre-print
In this paper, we propose a new public-key cryptosystem for P2P networks that is robust against Man-in-the-Middle adversary. This cryptosystem is based on RSA and knapsack problems.  ...  We show that comparing to other proposed cryptosystems, our algorithm is more efficient and it is fully secure against an active adversary.  ...  Altogether, the efficiency of our scheme is comparable to the classical RSA cryptosystem, while our construction is IND-CCA2.  ... 
arXiv:1211.2338v3 fatcat:xxnjyp3auvfxlcaauownkdfsba

GBD Threshold Cryptography with an Application to RSA Key Recovery [chapter]

Chris Steketee, Jaimee Brown, Juan M. González Nieto, Paul Montague
2005 Lecture Notes in Computer Science  
GBD threshold key generation is based on adaptations of protocols for RSA key generation by Boneh and Franklin, and Catalano et al, and includes a new protocol for efficiently computing the inverse of  ...  This shows that it is possible to perform GBD computations in a distributed manner during both key generation and decryption, without revealing the private key to any party.  ...  Boneh and Franklin [BF97] [BF01] presented protocols for distributive RSA key generation by allowing a number of parties to jointly generate an RSA key.  ... 
doi:10.1007/11506157_33 fatcat:2ogxuiosvvacdoaph7gh7k6s4m

Security Vulnerability and Robust Security Requirements using Key Management in Sensor Network

Jaykumar Shantilal Patel, Vijaykumar Chavda
2014 International Journal of Grid and Distributed Computing  
Unfortunately, the resource limitation of sensor nodes poses a great challenge for designing an efficient and effective key establishment scheme for WSNs [5] .  ...  Addressing: Sensor network is generally deployed with large number of sensor nodes.  ...  Key management using ECC: The key management using ECC is efficient in terms of speed, memory requirement and security level.  ... 
doi:10.14257/ijgdc.2014.7.3.03 fatcat:bmpkikvtxrbxnj46c72vb5hbum

Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions [chapter]

Ivan Damgård, Kasper Dupont
2005 Lecture Notes in Computer Science  
We propose techniques that allow construction of robust threshold RSA signature schemes that can work without a trusted dealer using known key generation protocols and is as efficient as the best previous  ...  We do not need special conditions on the RSA modulus, extra complexity or set-up assumptions or random oracles. An "optimistic" variant of the scheme is even more efficient in case no faults occur.  ...  When Shoup proposed his scheme, it was not known how to generate efficiently such an RSA key in a distributed way, i.e., such that the servers generate the key from scratch without the secret key ever  ... 
doi:10.1007/978-3-540-30580-4_24 fatcat:axusykaytfh4zfiifq2cn62bci

Hybrid Key Management Scheme for Wireless Sensor Networks

R Sharmila, V Vijayalakshmi
2015 International Journal of Security and Its Applications  
The simulation results show that the hybrid scheme is more robustness, efficient energy with reduced key size.  ...  Initial input for the genetic algorithm is the seed key generated by Hyperelliptic Curve Cryptography (HECC).The proposed scheme addresses the energy efficiency, resilience against node capture attack,  ...  The key management is a technique to generate the cryptographic keys, distributed, exchanged between the nodes, used, abolished and refreshed the keys.  ... 
doi:10.14257/ijsia.2015.9.11.13 fatcat:bgbfnlnctva6ne22snrgptfuee

An Enhanced Cryptosystem based on Shorter Keys and New Security Component

Alaa Alslaity, Thomas Tran
2017 International Journal of Computer Applications  
The key size of RSA is an important factor that determines its robustness.  ...  General Terms Security, Algorithms, Encryption.  ...  on the key distribution mechanisms and the key size to be used for encryption and decryption.  ... 
doi:10.5120/ijca2017914150 fatcat:54gfyt4qvzdklolzkdr2m5kuba
« Previous Showing results 1 — 15 out of 9,026 results