Since the introduction of nominative signature (NS) in 1996, there have been a handful of schemes proposed and almost all of them have been found flawed. The only one which is secure requires multi-round of communications between the nominator and the nominee for signature generation. In this paper, we propose a novel construction which is efficient and requires only one-move communication for signature generation. We also show that the construction is secure under the strongest security model currently available and the reductionist proofs only rely on standard number-theoretic assumptions. As of independent interest, our construction illustrates an interesting use of ring signature.
机构:
Department of Computer Science,City University of Hong Kong,Hong Kong,ChinaDepartment of Computer Science,City University of Hong Kong,Hong Kong,China
廖忻宏
廖啟瑞
论文数: 0引用数: 0
h-index: 0
机构:
Institute for Infocomm Research(I~2R),21 Heng Mui Keng Terrace,Singapore 119613Department of Computer Science,City University of Hong Kong,Hong Kong,China
廖啟瑞
论文数: 引用数:
h-index:
机构:
穆怡
Willy Susilo
论文数: 0引用数: 0
h-index: 0
机构:
Centre for Computer and Information Security Research,School of Computer Science and Software Engineering University of Wollongong,WoUongong,NSW 2522,AustraliaDepartment of Computer Science,City University of Hong Kong,Hong Kong,China
Willy Susilo
王石
论文数: 0引用数: 0
h-index: 0
机构:
Department of Computer Science,City University of Hong Kong,Hong Kong,ChinaDepartment of Computer Science,City University of Hong Kong,Hong Kong,China