[Resource Topic] 2008/181: Proofs of Knowledge with Several Challenge Values

Welcome to the resource topic for 2008/181

Proofs of Knowledge with Several Challenge Values

Authors: Grzegorz Stachowiak


In this paper we consider the problem of increasing the number of possible challenge values from 2 to s in various zero-knowledge cut and choose protocols. First we discuss doing this for graph isomorphism protocol. Then we show how increasing this number improves efficiency of protocols for double discrete logarithm and e-th root of discrete logarithm which are potentially very useful tools for constructing complex cryptographic protocols. The practical improvement given by our paper is 2-4 times in terms of both time complexity and transcript size.

ePrint: https://eprint.iacr.org/2008/181

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 .