Sciweavers

EUROCRYPT
2007
Springer
14 years 5 months ago
Feistel Networks Made Public, and Applications
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
Yevgeniy Dodis, Prashant Puniya
EUROCRYPT
2007
Springer
14 years 5 months ago
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...
Willi Geiselmann, Rainer Steinwandt
EUROCRYPT
2007
Springer
14 years 5 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
EUROCRYPT
2007
Springer
14 years 5 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
EUROCRYPT
2007
Springer
14 years 5 months ago
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...
Krzysztof Pietrzak, Johan Sjödin
EUROCRYPT
2007
Springer
14 years 5 months ago
Divisible E-Cash Systems Can Be Truly Anonymous
This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2L that he can parceled and spend anonymously and unlinkably. ...
Sébastien Canard, Aline Gouget
EUROCRYPT
2007
Springer
14 years 5 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
EUROCRYPT
2007
Springer
14 years 5 months ago
Ate Pairing on Hyperelliptic Curves
Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has...
Robert Granger, Florian Hess, Roger Oyono, Nicolas...
EUROCRYPT
2007
Springer
14 years 5 months ago
Non-interactive Proofs for Integer Multiplication
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
Ivan Damgård, Rune Thorbek