Skip to main content

Shared-Key Signature and Its Application to Anonymous Authentication in Ad Hoc Group

  • Conference paper
Information Security (ISC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3225))

Included in the following conference series:

Abstract

We formalize the notion of shared-key signatures, which makes it possible to anonymously sign any message with verification by a shared common public key. Unlike group signatures, shared-key signatures require no group manager or other third party to help the group members to generate signing keys. Also unlike ring signatures, shared-key signatures have no special structure such as a ring and the signing and verification procedures are the same as those of the ordinary signatures. In addition, they can be easily transformed into interactive authentication protocols while the ring signatures cannot. A concrete construction of such signatures is proposed based on Weak Dependence Problem (WDP). Since WDP is NP-complete and many researchers believe that NPC problems are intractable even in the quantum computation model, our scheme may be used to sign the documents requiring a longer-term validity with anonymity.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)

    Google Scholar 

  2. Cramer, R., Damgård, I.B., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)

    Google Scholar 

  3. Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Abe, M., Ohkubo, M., Suzuki, K.: 1-out -of-n Signatures from a Variety of Keys. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 415–432. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Zhang, F., Kim, K.: ID-Based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 533–547. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. 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: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 34–46. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Reed, S., Solomon, G.: Polynomial Codes over finite field. SIAM J. Applied Math. 8, 300–304 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143–154. Springer, Heidelberg (1996)

    Google Scholar 

  9. Fiat, A., Shamir, A.: How to prove yourself: practical solutions of identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Google Scholar 

  10. Blum, M.: How to prove a theorem so no one else can claim it. In: Proc. of the International Congress of Mathematicians, Berkeley, CA, pp. 1444–1451 (1986)

    Google Scholar 

  11. Goldreich, O., Micali, S., Wigderson, A.: How to prove all NP statements in zero- knowledge and a methodology of cryptographic protocol design. In: Proc. of Crypto 1986, pp. 171–185. Springer, Heidelberg (1987)

    Google Scholar 

  12. Shor, P.W.: Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing 26, 1484–1509 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510–1523 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Okamoto, T., Tanaka, K., Uchiyama, S.: Quantum Public-Key Cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 147–165. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Dwork, C.: Lattices and their application to cryptography. Stanford University, Springer Quarter Press (1998)

    Google Scholar 

  16. Lenstra Jr., K., Lenstra, H.W., Lovasz: Factorization polynomials with rational coefficients. Mathematische Annalen 261, 515–534 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, Q., Chen, X., Wang, C., Wang, Y. (2004). Shared-Key Signature and Its Application to Anonymous Authentication in Ad Hoc Group. In: Zhang, K., Zheng, Y. (eds) Information Security. ISC 2004. Lecture Notes in Computer Science, vol 3225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30144-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30144-8_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23208-7

  • Online ISBN: 978-3-540-30144-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics