44 search results - page 2 / 9 » eurocrypt 2006 |
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious tran...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We introduce a practical synchronous stream cipher with provable security named QUAD. The cipher relies on the iteration of a multivariate quadratic system of m equations in n <...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived fr...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolvin...