Sciweavers

56 search results - page 6 / 12
» Realizing Hash-and-Sign Signatures under Standard Assumption...
Sort
View
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
14 years 3 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 5 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
NDSS
2003
IEEE
14 years 3 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...
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
14 years 1 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...