International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Proofs of Knowledge with Several Challenge Values

Authors:
Grzegorz Stachowiak
Download:
URL: http://eprint.iacr.org/2008/181
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2008-17858,
  title={Proofs of Knowledge with Several Challenge Values},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols /},
  url={http://eprint.iacr.org/2008/181},
  note={ gst@cs.uni.wroc.pl 14031 received 18 Apr 2008, last revised 1 Jun 2008},
  author={Grzegorz Stachowiak},
  year=2008
}