Article ID Journal Published Year Pages File Type
9506981 Applied Mathematics and Computation 2005 13 Pages PDF
Abstract
Recently, undeniable signature has received a significant attention and has been extensively researched in the cryptographic community. Many undeniable schemes have been proposed. However, most of previous proposed schemes are based on discrete logarithm cryptosystems. In this paper, we present conic analogy of the first undeniable RSA signature scheme proposed by Gennaro, Krawczyk and Rabin at Crypto'97, and propose the first threshold undeniable signature scheme based on conic.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, , ,