EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We introduce the concept of concurrent signatures. These allow two entities to produce two signatures in such a way that, from the point of view of any third party, both signatures...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer