Paper 2016/443 Original: eprint.iacr.org/2016/443 ↗

Thrifty Zero-Knowledge - When Linear Programming Meets Cryptography

Simon Cogliani
Houda Ferradi
Rémi Géraud
David Naccache
Abstract

We introduce “thrifty” zero-knowledge protocols, or TZK. These protocols are constructed by introducing a bias in the challenge send by the prover. This bias is chosen so as to maximize the security versus effort trade-off. We illustrate the benefits of this approach on several well-known zero-knowledge protocols.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2016-11-22: last updated
2016-05-06: published
Short URL
https://ia.cr/2016/443
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/443,
      author = {Simon Cogliani and Houda Ferradi and Rémi Géraud and David Naccache},
      title = {Thrifty Zero-Knowledge - When Linear Programming Meets Cryptography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/443},
      year = {2016},
      url = {https://eprint.iacr.org/2016/443}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.