Sciweavers

121
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
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...
Anne Canteaut, Michaël Trabbia
145
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions
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...
Anne Canteaut, Claude Carlet, Pascale Charpin, Car...
160
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
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...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
141
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
Exposure-Resilient Functions and All-or-Nothing Transforms
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...
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kus...
125
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
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...
Nicolas Courtois, Alexander Klimov, Jacques Patari...