EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We investigate the link between the nonlinearity of a Boolean function and its propagation characteristics. We prove that highly nonlinear functions usually have good propagation p...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We exhibit an attack against a signature scheme recently proposed by Gennaro, Halevi and Rabin [9]. The scheme's security is based on two assumptions namely the strong RSA ass...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
