Skip to main content
SpringerLink
Log in
Book cover

Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009) pp 321–326Cite as

Signature from the Exponential Hard Lattices

  • Conference paper
  • First Online:

  • 1163 Accesses

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 117))

Abstract

We extend the lattice problem to the exponential lattice problem and construct signature schemes in the random oracle model and in the standard model based on the exponential hard lattice. Our signature schemes are strongly unforgeable under chosen message attacks if any one of factoring integer problem, computing discrete logarithm problem, and approximating standard worst-case lattice problems is hard.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security 3(3), 161–185 (1999); Preliminary version in CCS 1999

    Article  Google Scholar 

  3. El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  4. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proc. 40th ACM Symp. on Theory of Computing (STOC), pp. 197–206 (2008)

    Google Scholar 

  5. Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: CRYPTO, pp. 112–131 (1997)

    Google Scholar 

  6. Hoffstein, J., Pipher, J., Silverman, J.H.: NSS: An NTRU lattice-based signature scheme. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 211–228. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Peikert, C.: Bonsai trees (or, arboriculture in lattice-based cryptography). Cryptology ePrint Archive, Report 2009/359 (July 2009), http://eprint.iacr.org/

  8. Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523–552. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Rückert, M.: Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 182–200. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267–302 (2004); Preliminary version in FOCS 2004

    Article  MathSciNet  Google Scholar 

  11. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proc. 37th ACM Symp. on Theory of Computing (STOC), pp. 84–93 (2005)

    Google Scholar 

  12. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS, pp. 75–86 (2009)

    Google Scholar 

  13. Cash, D., Hofheinz, D., Kiltz, E.: How to delegate a lattice basis. Cryptology ePrint Archive, Report 2009/351 (July 2009), http://eprint.iacr.org/

Download references

Author information

Authors and Affiliations

  1. School of Computer Engineering, Jiangsu Teachers University of Technology, Changzhou, China, 213001

    Gu Chunsheng, Jing Zhengjun & Yu Zhiming

  2. Inst. of Image Communication & Information Processing, Shanghai Jiaotong University, Shanghai, China, 200030

    Gu Jixing

Authors
  1. Gu Chunsheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gu Jixing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jing Zhengjun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yu Zhiming
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gu Chunsheng .

Editor information

Editors and Affiliations

  1. Central China Normal University, Lvting Yajing, Hongshan Qu 10-3-102, Wuhan, 430079, China, People's Republic

    Yanwen Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Chunsheng, G., Jixing, G., Zhengjun, J., Zhiming, Y. (2012). Signature from the Exponential Hard Lattices. In: Wu, Y. (eds) Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009). Advances in Intelligent and Soft Computing, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25437-6_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25437-6_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25436-9

  • Online ISBN: 978-3-642-25437-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation