Advertisement

Journal of Computer Science and Technology

, Volume 20, Issue 2, pp 270–275 | Cite as

Extended Methodology of RS Design and Instances Based on GIP

  • Qian-Hong WuEmail author
  • Bo Qin
  • Yu-Min Wang
Article

Abstract

Abe et al. proposed the methodology of ring signature (RS) design in 2002 and showed how to construct RS with a mixture of public keys based on factorization and/or discrete logarithms. Their methodology cannot be applied to knowledge signatures (KS) using the Fiat-Shamir heuristic and cut-and-choose techniques, for instance, the Goldreich KS. This paper presents a more general construction of RS from various public keys if there exists a secure signature using such a public key and an efficient algorithm to forge the relation to be checked if the challenges in such a signature are known in advance. The paper shows how to construct RS based on the graph isomorphism problem (GIP). Although it is unknown whether or not GIP is NP-Complete, there are no known arguments that it can be solved even in the quantum computation model. Hence, the scheme has a better security basis and it is plausibly secure against quantum adversaries.

Keywords

ring signature knowledge signature graph isomorphism problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Rivest R L, Shamir A, Tauman Y. How to leak a secret. In Proc. Asiacrypt’01, Gold Coast, Australia, December 9–13, 2001, pp.552–565.Google Scholar
  2. [2]
    Abe M, Ohkubo M, Suzuki K. 1-out-of-n signatures from a variety of keys. In Proc. Asiacrypt’02, Queenstown, New Zealand, December 1–5, 2002, pp.415–432.Google Scholar
  3. [3]
    Zhang F, Kim K. ID-based blind signature and ring signature from pairings. In Proc. Asiacrypt’02, Queenstown, New Zealand, December 1–5, 2002, pp.533–547.Google Scholar
  4. [4]
    Wong D S, Fung K, Liu J K, Wei V K. On the RS-code construction of ring signature schemes and a threshold setting of RST. In Proc. ICICS’03, Inner-Mongolia, October 10–13, 2003, pp.34–46.Google Scholar
  5. [5]
    Reed I S, Solomon G. Polynomial codes over finite field. SIAM J. Applied Math., 1960, 8(1): 300–304.Google Scholar
  6. [6]
    Bresson E, Stern J, Szydlo M. Threshold ring signature for ad hoc groups. In Proc. Crypto’02, Santa Barbara, California, August 18–22, 2002, pp.465–480.Google Scholar
  7. [7]
    Camenisch J. Efficient and generalized group signatures. In Proc. Eurocrypt’97, Konstanz, Germany, May 11–15, 1997, pp.465–479.Google Scholar
  8. [8]
    Abe M, Hoshino F. Remarks on mix-network based on permutation network. In Proc. PKC’01, Cheju Island, South Korea. February 13–15, 2001, pp.317–324.Google Scholar
  9. [9]
    Cramer R, Gennarro R, Schoenmakers B. A secure and optimally efficient multi-authority election scheme. In Proc. Eurocrypt’97, Konstanz, Germany, May 11–15, 1997, pp.103–118.Google Scholar
  10. [10]
    Cramer R, Damgård I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. Crypto’95, Santa Barbara, California, August 27–31, 1995, pp.174–187.Google Scholar
  11. [11]
    Chaum D, Heyst E. Group signatures. In Proc. Eurocrypt’91, Brighton, UK, April 8–11, 1991, pp.257–265.Google Scholar
  12. [12]
    Fiat A, Shamir A. How to prove yourself: Practical solutions of identification and signature problems. In Proc. Crypto’86, Santa Barbara, California, August 13–17, 1986, pp.186–194.Google Scholar
  13. [13]
    Shor P W. Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing, 1997, 26(2): 1484–1509.Google Scholar
  14. [14]
    Goldreich O, Micali S, Wigderson A. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design. In Proc. Crypto’86, Santa Barbara, California, August 13–17, 1986, pp.171–185.Google Scholar
  15. [15]
    Schnorr C P. Efficient signature generation for smart cards. J. Cryptology, 1991, 4(3): 239–252.Google Scholar
  16. [16]
    Blum M. How to prove a theorem so no one else can claim it. In Proc. International Congress of Mathematicians, Berkeley, CA, October 22–27, 1986, pp.1444–1451.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.State Key Laboratory of Integrated Services NetworksXidian UniversityXi’anP.R. China

Personalised recommendations