Theory of linear and integer programming
Theory of linear and integer programming
On using RSA with low exponent in a public key network
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A secure and privacy-protecting protocol for transmitting personal information between organizations
Proceedings on Advances in cryptology---CRYPTO '86
Efficient offline electronic checks (extended abstract)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Disposable zero-knowledge authentications and their applications to untraceable electronic cash
CRYPTO '89 Proceedings on Advances in cryptology
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Provably Unforgeable Signatures
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.00 |
We consider protocols in which a signature authority issues RSA-signatures to an individual. These signatures are in general products of rational powers of residue classes modulo the composite number of the underlying RSA-system. These residue classes are chosen at random by the signature authority. Assuming that it is infeasible for the individual to compute RSA-roots on randomly chosen residue classes by himself, we give, as a consequence of our main theorem, necessary and sufficient conditions describing whether it is feasible for the individual to compute RSA-signatures of a prescribed type from signatures of other types that he received before from the authority.