You are looking at a specific version 20080827:151954 of this paper.
See the latest version.
Paper 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
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. unpublished
- Keywords
- Hamiltonian cycleargument protocolSchwartz-Zipel lemmazero knowledge
- Contact author(s)
- vf @ unity net
- History
- 2008-08-27: received
- Short URL
- https://ia.cr/2008/363
- License
-
CC BY
