EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We present an RSA threshold signature scheme. The scheme enjoys the following properties:
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider in...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....