Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EUROCRYPT
2000
Springer
12 years 1 months ago
Computing Inverses over a Shared Secret Modulus
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...
Dario Catalano, Rosario Gennaro, Shai Halevi
EUROCRYPT
2000
Springer
12 years 1 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
EUROCRYPT
2000
Springer
12 years 1 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...
EUROCRYPT
2000
Springer
12 years 1 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
EUROCRYPT
2000
Springer
12 years 1 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...
EUROCRYPT
2000
Springer
12 years 1 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...
EUROCRYPT
2000
Springer
12 years 1 months ago
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
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...
Jean-Sébastien Coron, David Naccache
EUROCRYPT
2000
Springer
12 years 1 months ago
Confirmer Signature Schemes Secure against Adaptive Adversaries
Jan Camenisch, Markus Michels
EUROCRYPT
2000
Springer
12 years 1 months ago
New Attacks on PKCS#1 v1.5 Encryption
Jean-Sébastien Coron, Marc Joye, David Nacc...
EUROCRYPT
2000
Springer
12 years 1 months ago
Factorization of a 512-Bit RSA Modulus
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra,...
books