Paper 2008/357

A protocol for K-multiple substring matching

Vadym Fedyukovych and Vitaliy Sharapov

Abstract

A protocol is introduced to show $K$ copies of a pattern string are embedded is a host string. Commitments to both strings, and to offsets of copies of the pattern in the host is input of Verifier. Protocol does not leak useful information about strings, and is zero knowledge.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Extended abstract of ITaS'08 report.
Keywords
Substring matchingargument protocolSchwartz-Zippel lemmazero knowledge
Contact author(s)
vf @ unity net
History
2008-08-18: received
Short URL
https://ia.cr/2008/357
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/357,
      author = {Vadym Fedyukovych and Vitaliy Sharapov},
      title = {A protocol for K-multiple substring matching},
      howpublished = {Cryptology ePrint Archive, Paper 2008/357},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/357}},
      url = {https://eprint.iacr.org/2008/357}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.