An argument for Hamiltonicity

Vadym Fedyukovych

Paper 2008/363 Original: eprint.iacr.org/2008/363 ↗

An argument for Hamiltonicity

Vadym Fedyukovych

Abstract

A constant-round interactive argument is introduced to show existence of a Hamiltonian cycle in a directed graph. Graph is represented with a characteristic polynomial, top coefficient of a verification polynomial is tested to fit the cycle, soundness follows from Schwartz-Zippel lemma.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2008-08-27: last updated; 2008-08-27: published
Short URL: https://ia.cr/2008/363
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2008/363,
      author = {Vadym Fedyukovych},
      title = {An argument for Hamiltonicity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/363},
      year = {2008},
      url = {https://eprint.iacr.org/2008/363}
}