47 search results - page 4 / 10 » eurocrypt 2004 |
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
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...
EUROCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
IACR
2011
12 years 5 months ago
2011
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...