Skip to main content

A Proxy Signature Scheme Based on Coding Theory

  • Conference paper
Global Security, Safety, and Sustainability (ICGS3 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 92))

Abstract

Proxy signature helps the proxy signer to sign messages on behalf of the original signer. This signature is used when the original signer is not available to sign a specific document. In this paper, we introduce a new proxy signature scheme based on Stern’s identification scheme whose security depends on syndrome decoding problem. The proposed scheme is the first code-based proxy signature and can be used in a quantum computer. In this scheme, the operations to perform are linear and very simple thus the signature is performed quickly and can be implemented using smart card in a quite efficient way. The proposed scheme also satisfies unforgeability, undeniability, non-transferability and distinguishability properties which are the security requirements for a proxy signature.

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. Berlekamp, E., McEliece, R., Tilborg, H.: On the Inherent Intractability of Certain Coding Problems. IEEE Transactions on Information Theory 24, 384–386 (1978)

    Article  MATH  Google Scholar 

  2. Cayrel, P.-L., Gaborit, P., Prouff, E.: Secure Implementation of the Stern Authentication and Signature Schemes for Low Resource Devices. In: Grimaud, G., Standaert, F.-X. (eds.) CARDIS 2008. LNCS, vol. 5189, pp. 191–205. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a MCEliece-based Digital Signature Scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157–174. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Google Scholar 

  5. Hamdi, O., Harari, S., Bouallegue, A.: Secure and Fast Digital Signatures using BCH Codes. International Journal of Computer Science and Network Security 6(10), 220–226 (2006)

    Google Scholar 

  6. Jannati, H., Salmasizadeh, M., Mohajeri, J.: New Proxy Signature, Proxy Blind Signature and Blind Proxy Signature Based on the Okamoto Signature. In: International Conference on Security and Management, pp. 238–242. SAM, Las Vegas (2008)

    Google Scholar 

  7. Lu, R., Cao, Z., Zhou, Y.: Proxy Blind Multi-Signature Scheme Without a Secure Channel. Journal of Applied Mathematics and Computation 164(1), 179–187 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mambo, M., Usuda, K., Okamoto, E.: Proxy Signatures for Delegating Signing Operation. In: Conference on Computer and Communications Security - CCS 1996, pp. 48–57. ACM Press, New York (1996)

    Chapter  Google Scholar 

  9. McEliece, R.-J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. DSN Prog. Rep., Jet Propulsion Laboratory, California Inst. Technol., Pasadena, CA, pp. 114-116 (January 1978)

    Google Scholar 

  10. Melchor, C.-A., Cayrel, P.-L., Gaborit, P.: A New Efficient Threshold Ring Signature Scheme based on Coding Theory. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 1–16. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Stern, J.: A New Identification Scheme Based on Syndrome Decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13–21. Springer, Heidelberg (1994)

    Google Scholar 

  12. Wang, G., Bao, F., Zhou, J., Deng, R.-H.: Comments on a Practical (t,n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem. IEEE Transaction on Knowledge and data Engineering 16(10), 1309–1311 (2004)

    Article  Google Scholar 

  13. Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jannati, H., Falahati, A. (2010). A Proxy Signature Scheme Based on Coding Theory. In: Tenreiro de Magalhães, S., Jahankhani, H., Hessami, A.G. (eds) Global Security, Safety, and Sustainability. ICGS3 2010. Communications in Computer and Information Science, vol 92. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15717-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15717-2_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15716-5

  • Online ISBN: 978-3-642-15717-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics