Paper 2012/213 Original: eprint.iacr.org/2012/213 ↗
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions
Abstract
Verifiable random functions (VRF) and selectively-convertible undeniable signature (SCUS) schemes were proposed independently in the literature. In this paper, we observe that they are tightly related. This directly yields several deterministic SCUS schemes based on existing VRF constructions. In addition, we create a new probabilistic SCUS scheme, which is very compact. The confirmation and disavowal protocols of these SCUS are efficient, and can be run either sequentially, concurrently, or arbitrarily. These protocols are based on what we call zero-knowledge protocols for generalized DDH and non-DDH, which are of independent interest.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2012-04-22: last updated
- 2012-04-22: published
- Short URL
- https://ia.cr/2012/213
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/213,
author = {Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong},
title = {Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/213},
year = {2012},
url = {https://eprint.iacr.org/2012/213}
}