Sciweavers

186 search results - page 8 / 38
» Signature Schemes Based on the Strong RSA Assumption
Sort
View
112
Voted
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
13 years 7 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
EUROCRYPT
2004
Springer
15 years 3 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
137
Voted
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
15 years 5 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
102
Voted
CHES
2006
Springer
131views Cryptology» more  CHES 2006»
15 years 3 months ago
Why One Should Also Secure RSA Public Key Elements
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
Eric Brier, Benoît Chevallier-Mames, Mathieu...