You are looking at a specific version 20080601:120723 of this paper.
See the latest version.
Paper 2008/181
Proofs of Knowledge with Several Challenge Values
Grzegorz Stachowiak
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.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- gst @ cs uni wroc pl
- History
- 2008-06-01: last of 3 revisions
- 2008-04-21: received
- See all versions
- Short URL
- https://ia.cr/2008/181
- License
-
CC BY