• Corpus ID: 19090412

Two Efficient R S A Mul t i s ignature S c h e m e s

@inproceedings{Park2005TwoER,
  title={Two Efficient R S A Mul t i s ignature S c h e m e s},
  author={Sangjoon Park and Sangwoo Park and Kwangjo Kim and Dongho Won},
  year={2005}
}
Abs t rac t . In this paper, we propose two efficient RSA multisignature schemes, one is an improved version of Okamoto's scheme [6] and the other is that of Kiesler-Harn's scheme [3]. The first one causes bit expansion in block size of a multisignature, but the bit length of the expansion is no more greater than the number of signers regardless of their RSA modulus. The second one has no bit expansion, in which all signers have a RSA modulus with the same bit size and the same most significant… 

References

SHOWING 1-9 OF 9 REFERENCES

A digital multisignature scheme using bijective public-key cryptosystems

TLDR
It is shown that the new scheme is considered as safe as the public-key cryptosystem used in this new scheme, and some variations based on the scheme are also presented.

New scheme for digital multisignatures

TLDR
A modified scheme is proposed, based on the RSA scheme, which will allow any number of users to sign a document and send it secretly to the receiver, where the length of ciphertext remains constant, no matter how great the number of signatories.

A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important

RSA blocking and multisignature schemes with no bit expansion

TLDR
Solutions to these latter two problems, which flow naturally from a solution to the root problem of bit expansion, are presented.

Some Cryptographic Applications of Permutation Polynomials

TLDR
Various ways to use permutation polynomials, defined on a finite field and more generally rational permutation functions, to construct cryptographic systems of a general mathematical nature are discussed.

A public-key cryptosystem suitable for digital multisignatures

Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key Cryptosystem

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or

On the signature reblocking problem in public-key cryptography", Uommun

  • AUM,
  • 1978

On the signature reblocking problem in public - key cryptography "

  • 1978