11 search results - page 1 / 3 » Fully Distributed Threshold RSA under Standard Assumptions |
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
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...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
PODC
2003
ACM
13 years 9 months ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
CRYPTO
2010
Springer
13 years 1 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
IACR
2011
12 years 4 months ago
2011
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...