You are looking at a specific version 20120422:224404 of this paper. See the latest version.

Paper 2012/213

Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions

Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong

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
Published elsewhere. Unknown where it was published
Keywords
verifiable random functionstandard model
Contact author(s)
letrieu letrieuphong @ gmail com
History
2012-04-22: received
Short URL
https://ia.cr/2012/213
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.