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

被引：1
作者：
Kurosawa, Kaoru [1 ]
Nojima, Ryo [2 ]
Phong, Le Trieu [2 ]
机构：
[1] Ibaraki Univ, Dept Comp & Informat Sci, Mito, Ibaraki 3168511, Japan
[2] NICT, Secur Fundamental Lab, Network Secur Reseach Inst, Koganei, Tokyo 1848795, Japan
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2014年 / E97A卷 / 01期
关键词：
selectively convertible undeniable signatures; verifiable random function; standard model; ZERO-KNOWLEDGE; RANDOM ORACLES; ENCRYPTION; ANONYMITY; PROOFS;
D O I：
10.1587/transfun.E97.A.215
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Verifiable random functions (VRF), proposed in 1999, and selectively convertible undeniable signature (SCUS) schemes, proposed in 1990, are apparently thought as independent primitives in the literature. In this paper, we show that they are tightly related in the following sense: VRF is exactly SCUS; and the reverse also holds true under a condition. 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. We build efficient confirmation and disavowal protocols for the proposed SCUS schemes, based on what we call zero-knowledge protocols for generalized DDH and non-DDH. These zero-knowledge protocols are built either sequential, concurrent, or universally composable.
引用
收藏
页码：215 / 224
页数：10
相关论文
共 39 条
  • [1] Abdalla M, 2009, LECT NOTES COMPUT SC, V5479, P554, DOI 10.1007/978-3-642-01001-9_32
  • [2] Short signatures without random oracles and the SDH assumption in bilinear groups
    Boneh, Dan
    Boyen, Xavier
    [J]. JOURNAL OF CRYPTOLOGY, 2008, 21 (02) : 149 - 177
  • [3] Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade
    Boneh, Dan
    Montgomery, Hart W.
    Raghunathan, Ananth
    [J]. PROCEEDINGS OF THE 17TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'10), 2010, : 131 - 140
  • [4] BOYAR J, 1991, LECT NOTES COMPUT SC, V537, P189
  • [5] Boyd C, 1998, LECT NOTES COMPUT SC, V1514, P271
  • [6] Brakerski Z, 2009, LECT NOTES COMPUT SC, V5444, P558
  • [7] Camenisch J, 2003, LECT NOTES COMPUT SC, V2729, P126
  • [8] Chase M, 2007, LECT NOTES COMPUT SC, V4622, P303
  • [9] CHAUM D, 1990, LECT NOTES COMPUT SC, V435, P212
  • [10] Cramer R, 2000, LECT NOTES COMPUT SC, V1751, P354
1234