## A Practical Digital Multisignature Scheme Based on Discrete Logarithms (Extended Abstract) (1993)

### Cached

### Download Links

- [pscit-www.fcit.monash.edu.au]
- [www.sis.uncc.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in AUSCRYPT’92 |

Citations: | 10 - 1 self |

### BibTeX

@INPROCEEDINGS{Hardjono93apractical,

author = {Thomas Hardjono and Yuliang Zheng},

title = {A Practical Digital Multisignature Scheme Based on Discrete Logarithms (Extended Abstract)},

booktitle = {in AUSCRYPT’92},

year = {1993},

pages = {122--132},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

) Thomas Hardjono 1 ? and Yuliang Zheng 2 ?? 1 ATR Communications Research Laboratories 2-2 Hikaridai, Seika-Cho, Soraku-gun, Kyoto 619-02, Japan 2 Department of Computer Science, University of Wollongong, Australia Abstract. This paper proposes a practical digital multisignature scheme based on the C ? sig cryptosystem derived from the Csig cryptosystem of Zheng and Seberry (1993). The simple scheme consists of three phases. In the first phase the issuer of the document prepares the document, the list of prospective signatories and a pad on which signatories are to write their signatures. In the second phase each signatory verifies the document, signs it and forwards it to the next signatory. In the third phase a trusted verifier or notary decides on the validity of the signatures. The scheme prevents cheating by dishonest signatories from going undetected. The scheme is practical and offers at least the same security level afforded by its underlying cryptosystem against extern...

### Citations

2902 | A method for obtaining digital signatures and public-key cryptosystems
- Rivest, Shamir, et al.
- 1978
(Show Context)
Citation Context ...ital Multisignatures. 1 Introduction The problem of providing digital signatures and digital multisignatures for electronic documents has been addressed by a number of researchers over the past years =-=[1, 2, 3, 4, 5]-=-. The aim of electronically signing an electronic document is in principle the same as handwritten signatures on paper documents. A useful analogy is that of the signing of a two-party contract. The p... |

2701 | New Directions in Cryptography
- Diffie, Hellman
- 1976
(Show Context)
Citation Context ... Notation The notation used in this paper is taken from the original work in [6], and is presented briefly in this section. The cryptosystems of [6] are reminiscent of the Diffie-Hellman cryptosystem =-=[8]-=- and El Gamal cryptosystem [9] in their use of a n-bit prime p (public) and a generator g (public) of the multiplicative group GF (p) of the finite field GF (p). Here n is a security parameter which i... |

1110 |
A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- El-Gamal
- 1985
(Show Context)
Citation Context ... this paper is taken from the original work in [6], and is presented briefly in this section. The cryptosystems of [6] are reminiscent of the Diffie-Hellman cryptosystem [8] and El Gamal cryptosystem =-=[9]-=- in their use of a n-bit prime p (public) and a generator g (public) of the multiplicative group GF (p) of the finite field GF (p). Here n is a security parameter which is greater that 512 bits, while... |

829 | How to prove yourself: practical solutions to identification and signature problems
- Fiat, Shamir
- 1986
(Show Context)
Citation Context ...ital Multisignatures. 1 Introduction The problem of providing digital signatures and digital multisignatures for electronic documents has been addressed by a number of researchers over the past years =-=[1, 2, 3, 4, 5]-=-. The aim of electronically signing an electronic document is in principle the same as handwritten signatures on paper documents. A useful analogy is that of the signing of a two-party contract. The p... |

598 |
How to generate cryptographically strong sequences of pseudo-random bits. Sicomp
- Blum, Micali
- 1984
(Show Context)
Citation Context ...lement x randomly and uniformly from set S is denoted by x2RS. G is a cryptographically strong pseudo-random string generator based on the difficulty of computing discrete logarithms in finite fields =-=[11, 12, 13]-=-. G stretches an n-bit input string into an output string whose length can be an arbitrary polynomial in n. This generator produces O(log n) bits output at each exponentiation. The function h is a one... |

248 |
New directions in cryptography
- e, Hellman
- 1976
(Show Context)
Citation Context ... 5 2 Notation The notation used in this paper is taken from the original work in [6], and is presented brie y in this section. The cryptosystems of [6] are reminiscent ofthe Di e-Hellman cryptosystem =-=[8]-=- and El Gamal cryptosystem [9] in their use of a n-bit prime p (public) and a generator g (public) of the multiplicative group GF (p) of the nite eld GF (p). Here n is a security parameter which is gr... |

38 | Computation of discrete logarithms in prime fields
- LaMacchia, Odlyzko
- 1991
(Show Context)
Citation Context ...ic) of the multiplicative group GF (p) of the nite eld GF (p). Here n is a security parameter which is greater that 512 bits, while the prime p must be chosen such that p ; 1 has a large prime factor =-=[10]-=-. In this paper the alphabet = f0� 1g will be employed, andsjxj denotes length of a string x over . Concatenation of string are denoted using the \jj" symbol and the bit-wise XOR operations of two str... |

31 |
A digital multisignature scheme using bijective public-key cryptosystems
- Okamoto
- 1988
(Show Context)
Citation Context ...ital Multisignatures. 1 Introduction The problem of providing digital signatures and digital multisignatures for electronic documents has been addressed by a number of researchers over the past years =-=[1, 2, 3, 4, 5]-=-. The aim of electronically signing an electronic document is in principle the same as handwritten signatures on paper documents. A useful analogy is that of the signing of a two-party contract. The p... |

27 | Immunizing public key cryptosystems against chosen ciphertext attacks
- Zheng, Seberry
- 1993
(Show Context)
Citation Context ...nowledge about the object ciphertext that he or she wishes to cryptanalyze. In this paper we present a practical digital multisignature scheme based on a modified version of the C sig cryptosystem of =-=[6]-=-. The C sig is one of a family of cryptosystems proposed in [6] which grew out of the earlier work in [7]. The family of cryptosystems represents an important step in public-key cryptography since the... |

22 |
A digital multisignature scheme based on the Fiat-Shamir scheme”, Asiacrypt 91
- Ohta, Okamoto
- 1991
(Show Context)
Citation Context |

18 |
Simultaneous security of bits in the discrete log
- Peralta
- 1986
(Show Context)
Citation Context ...lement x randomly and uniformly from set S is denoted by x2RS. G is a cryptographically strong pseudo-random string generator based on the difficulty of computing discrete logarithms in finite fields =-=[11, 12, 13]-=-. G stretches an n-bit input string into an output string whose length can be an arbitrary polynomial in n. This generator produces O(log n) bits output at each exponentiation. The function h is a one... |

12 |
The discrete logarithm hides O(log n) bits
- Long, Wigderson
- 1988
(Show Context)
Citation Context ...lement x randomly and uniformly from set S is denoted by x2RS. G is a cryptographically strong pseudo-random string generator based on the difficulty of computing discrete logarithms in finite fields =-=[11, 12, 13]-=-. G stretches an n-bit input string into an output string whose length can be an arbitrary polynomial in n. This generator produces O(log n) bits output at each exponentiation. The function h is a one... |

10 |
Applying the RSA Digital Signature to Electronic Mail
- Davies
- 1983
(Show Context)
Citation Context |

4 |
Odlyzko, "Computation of discrete logarithms in prime fields
- LaMacchia, M
- 1991
(Show Context)
Citation Context ...e multiplicative group GF (p) of the finite field GF (p). Here n is a security parameter which is greater that 512 bits, while the prime p must be chosen such that p \Gamma 1 has a large prime factor =-=[10]. In this -=-paper the alphabet \Sigma = f0; 1g will be employed, and jxj denotes length of a string x over \Sigma . Concatenation of string are denoted using the "jj" symbol and the bit-wise XOR operati... |

3 | A practical non-malleable public key cryptosystem - Zheng, Hardjono, et al. - 1991 |

1 |
A digital multi-signature scheme based on the atshamir scheme
- Ohta, Okamoto
- 1991
(Show Context)
Citation Context ...gital Multisignatures. 1 Introduction The problem of providing digital signatures and digital multisignatures for electronic documents has been addressed by anumber of researchers over the past years =-=[1, 2,3,4, 5]-=-. The aim of electronically signing an electronic document is in principle the same as handwritten signatures on paper documents. A useful analogy is that of the signing of a two-party contract. The p... |