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. © 2012 Springer-Verlag.
CITATION STYLE
Kurosawa, K., Nojima, R., & Phong, L. T. (2012). Relation between verifiable random functions and convertible undeniable signatures, and new constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7372 LNCS, pp. 235–246). https://doi.org/10.1007/978-3-642-31448-3_18
Mendeley helps you to discover research relevant for your work.