Sciweavers

39 search results - page 2 / 8
» eurocrypt 2001
Sort
View
EUROCRYPT
2001
Springer
13 years 9 months ago
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
Masayuki Abe
EUROCRYPT
2001
Springer
13 years 9 months ago
Cryptanalysis of Reduced-Round MISTY
Abstract. The block ciphers MISTY1 and MISTY2 proposed by Matsui are based on the principle of provable security against differential and linear cryptanalysis. This paper presents...
Ulrich Kühn
EUROCRYPT
2001
Springer
13 years 9 months ago
Practical Threshold RSA Signatures without a Trusted Dealer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
Ivan Damgård, Maciej Koprowski
EUROCRYPT
2001
Springer
13 years 9 months ago
How Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
Nigel P. Smart
EUROCRYPT
2001
Springer
13 years 9 months ago
Lower Bounds for Multicast Message Authentication
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
Dan Boneh, Glenn Durfee, Matthew K. Franklin