Sciweavers

175 search results - page 9 / 35
» A Directed Signature Scheme Based on RSA Assumption
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
NDSS
2003
IEEE
15 years 2 months ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the serverâ...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
71
Voted
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
15 years 3 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...
82
Voted
IJNSEC
2007
138views more  IJNSEC 2007»
14 years 9 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
ACNS
2004
Springer
167views Cryptology» more  ACNS 2004»
15 years 1 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