Skip to main content
Springer Nature Link
Log in

Extended Methodology of RS Design and Instances Based on GIP

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  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.

  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.

  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.

  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.

  5. Reed I S, Solomon G. Polynomial codes over finite field. SIAM J. Applied Math., 1960, 8(1): 300–304.

    Google Scholar 

  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.

  7. Camenisch J. Efficient and generalized group signatures. In Proc. Eurocrypt’97, Konstanz, Germany, May 11–15, 1997, pp.465–479.

  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.

  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.

  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.

  11. Chaum D, Heyst E. Group signatures. In Proc. Eurocrypt’91, Brighton, UK, April 8–11, 1991, pp.257–265.

  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.

  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. 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.

  15. Schnorr C P. Efficient signature generation for smart cards. J. Cryptology, 1991, 4(3): 239–252.

    Google Scholar 

  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.

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, 710071, P.R. China

    Qian-Hong Wu, Bo Qin & Yu-Min Wang

Authors
  1. Qian-Hong Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Bo Qin
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yu-Min Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Qian-Hong Wu.

Additional information

Supported by the National Natural Science Foundation of China under Grant No.60073052, the National High Technology Development 863 Program of China under Grant No.2002AA143021, and the National Grand Fundamental Research 973 Program of China under Grant No.G1999035801.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, QH., Qin, B. & Wang, YM. Extended Methodology of RS Design and Instances Based on GIP. J Comput Sci Technol 20, 270–275 (2005). https://doi.org/10.1007/s11390-005-0270-3

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0270-3

Keywords