Welcome to the resource topic for 2008/357
Title:
A protocol for K-multiple substring matching
Authors: Vadym Fedyukovych, 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.
ePrint: https://eprint.iacr.org/2008/357
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .