Paper 2018/1157 Original: eprint.iacr.org/2018/1157 ↗
Special Soundness Revisited
Abstract
We generalize and abstract the problem of extracting a witness from a prover of a special sound protocol into a combinatorial problem induced by a sequence of matroids and a predicate, and present a parametrized algorithm for solving this problem. The parametrization provides a tight tradeoff between the running time and the extraction error of the algorithm, which allows optimizing the parameters to minimize: the soundness error for interactive proofs, or the extraction time for proofs of knowledge. In contrast to previous work we bound the distribution of the running time and not only the expected running time. Tail bounds give a tighter analysis when applied recursively and concentrated running time.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2018-12-03: last updated
- 2018-12-03: published
- Short URL
- https://ia.cr/2018/1157
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/1157,
author = {Douglas Wikström},
title = {Special Soundness Revisited},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/1157},
year = {2018},
url = {https://eprint.iacr.org/2018/1157}
}