Sciweavers

6 search results - page 1 / 2
» On the Instantiability of Hash-and-Sign RSA Signatures
Sort
View
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 10 days 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
13 years 10 months ago
Sequential Aggregate Signatures from Trapdoor Permutations
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham) is a method for combining n signatures from n different signers on n different messages int...
Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Ho...
PKC
2007
Springer
160views Cryptology» more  PKC 2007»
13 years 11 months ago
Anonymous Signatures Made Easy
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
Marc Fischlin
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen