International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A protocol for K-multiple substring matching

Authors:
Vadym Fedyukovych
Vitaliy Sharapov
Download:
URL: http://eprint.iacr.org/2008/357
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2008-18034,
  title={A protocol for K-multiple substring matching},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / Substring matching, argument protocol, Schwartz-Zippel lemma, zero knowledge},
  url={http://eprint.iacr.org/2008/357},
  note={Extended abstract of ITaS'08 report. vf@unity.net 14109 received 17 Aug 2008},
  author={Vadym Fedyukovych and Vitaliy Sharapov},
  year=2008
}