53 search results - page 4 / 11 » The RSA Group is Pseudo-Free |
158
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
ded abstract of this paper is to appear in Advances in Cryptology—CRYPTO 2004, Springer-Verlag. We construct a short group signature scheme. Signatures in our scheme are approxi...
159
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
168
click to vote
PODC
2003
ACM
15 years 11 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...
272
click to vote
ACISP
2011
Springer
14 years 9 months ago
2011
Springer
We propose a generic three-pass key agreement protocol that is based on a certain kind of trapdoor one-way function family. When specialized to the RSA setting, the generic protoco...
153
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...