Sciweavers

186 search results - page 12 / 38
» Signature Schemes Based on the Strong RSA Assumption
Sort
View
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
15 years 5 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...
IJNSEC
2007
138views more  IJNSEC 2007»
14 years 11 months ago
ID-based Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings
In 2001, Rivest et al. rstly introduced the concept of ring signatures. A ring signature is a simpli ed group signature without any manager. It protects the anonymity of a signer....
Amit K. Awasthi, Sunder Lal
JCST
2008
120views more  JCST 2008»
14 years 11 months ago
Generic Transformation from Weakly to Strongly Unforgeable Signatures
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
Qiong Huang, Duncan S. Wong, Jin Li, Yiming Zhao
ACNS
2004
Springer
167views Cryptology» more  ACNS 2004»
15 years 3 months ago
A Fully-Functional Group Signature Scheme over Only Known-Order Group
The concept of group signature allows a group member to sign message anonymously on behalf of the group. In the event of a dispute, a designated entity can reveal the identity of a...
Atsuko Miyaji, Kozue Umeda