53 search results - page 1 / 11 » The RSA Group is Pseudo-Free |
EUROCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
We explore the notion of a pseudo-free group, first introduced by Hohenberger [Hoh03], and provide an alternative stronger definition. We show that if Z∗ n is a pseudo-free abe...
RSA
2011
12 years 12 months ago
2011
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--We consider the use of threshold signatures in adhoc and dynamic groups such as MANETs ("mobile ad-hoc networks"). We first show that known threshold RSA signat...
TCC
2012
Springer
12 years 1 months ago
2012
Springer
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...