Skip to main content
SpringerLink
Log in

How traveling salespersons prove their identity

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1995)

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

Included in the following conference series:

Abstract

In this paper a new identification protocol is proposed. Its security is based on the Exact Traveling Salesperson Problem (XTSP). The XTSP is a close relative of the famous TSP and consists of finding a Hamiltonian circuit of a given length, given a complete directed graph and the distances between all vertices. Thus, the set of tools for use in public-key cryptography is enlarged.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. B. Damgård, A Design Principle for Hash Functions, in: Proc Crypto '89, Springer LNCS 435, 416–427.

    Google Scholar 

  2. M. Girault, J. Stern, On the length of cryptographic hash-values used in identification schemes, in: Proc. Crypto '94, Springer LNCS 839, 202–215.

    Google Scholar 

  3. M. Jünger, G. Reinelt, S. Thienel, Provably good solutions for the traveling salesman problem, in: Zeitschrift für Operations Research 40 (1994), 183–217.

    Google Scholar 

  4. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, D. B. Shmoys (eds.), The Traveling Salesman Problem, Wiley, 1985.

    Google Scholar 

  5. S. Lucks, How to Exploit the Intractability of Exact TSP for Cryptography, to appear in: Proc. Fast Software Encryption (1994), Springer LNCS.

    Google Scholar 

  6. R. C. Merkle, A Certified Digital Signature (That Antique Paper from 1979), in: Crypto '89, Springer LNCS 435, 218–238.

    Google Scholar 

  7. M. Padberg, G. Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, in: Siam Review 33, No. 1 (1991), 60–100.

    Article  Google Scholar 

  8. J. Patarin, P. Chauvaud, Improved Algorithms for the Permuted Kernel Problem, in: Proc. Crypto '93, Springer LNCS 773, 391–402.

    Google Scholar 

  9. D. Pointcheval, A New Identification Scheme Based on the Perceptrons Problem, in: Proc. Eurocrypt '95, Springer LNCS 921, 319–328.

    Google Scholar 

  10. A. Shamir, An Identification Scheme based on Permuted Kernels, in: Proc. Crypto '89, Springer LNCS 435, 606–609.

    Google Scholar 

  11. J. Stern, A new identification scheme based on syndrome decoding, in: Proc. Crypto '93, Springer LNCS 773, 13–20.

    Google Scholar 

  12. J. Stern, Designing Identification Schemes with Keys of Short Size, in: Proc. Crypto '94, Springer LNCS 839, 164–173.

    Google Scholar 

  13. S. Thienel, private communication, July 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Numerische und Angewandte Mathematik, Georg-August-Universität Göttingen, Lotzestr. 16-18, D-37083, Göttingen, Germany

    Stefan Lucks

Authors
  1. Stefan Lucks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lucks, S. (1995). How traveling salespersons prove their identity. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-60693-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60693-2

  • Online ISBN: 978-3-540-49280-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation