Sciweavers

Share
22 search results - page 1 / 5
» Experimenting with Shared Generation of RSA Keys
Sort
View
NDSS
1999
IEEE
12 years 1 months ago
Experimenting with Shared Generation of RSA Keys
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...
Michael Malkin, Thomas D. Wu, Dan Boneh
AAECC
2004
Springer
76views Algorithms» more  AAECC 2004»
11 years 9 months ago
On the Security of RSA with Primes Sharing Least-Significant Bits
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
Ron Steinfeld, Yuliang Zheng
ESAS
2007
Springer
12 years 1 months ago
The Candidate Key Protocol for Generating Secret Shared Keys from Similar Sensor Data Streams
Secure communication over wireless channels necessitates authentication of communication partners to prevent man-in-the-middle attacks. For spontaneous interaction between independ...
Rene Mayrhofer
ASIACRYPT
2001
Springer
12 years 2 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
INFOCOM
2010
IEEE
11 years 8 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra
books