Sciweavers

EUROCRYPT
1999
Springer
14 years 4 months ago
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Thomas Johansson, Fredrik Jönsson
EUROCRYPT
1999
Springer
14 years 4 months ago
A Note on the Limits of Collusion-Resistant Watermarks
In one proposed use of digital watermarks, the owner of a document D sells slightly different documents, D1 , D2 , . . . to each buyer; if a buyer posts his/her document Di to the...
Funda Ergün, Joe Kilian, Ravi Kumar
EUROCRYPT
1999
Springer
14 years 4 months ago
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Distributed key generation is a main component of threshold cryptosystems and distributed cryptographic computing in general. Solutions to the distributed generation of private key...
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,...
EUROCRYPT
1999
Springer
14 years 4 months ago
Secure Hash-and-Sign Signatures Without the Random Oracle
Rosario Gennaro, Shai Halevi, Tal Rabin
EUROCRYPT
1999
Springer
14 years 4 months ago
Lower Bounds for Oblivious Transfer Reductions
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
Yevgeniy Dodis, Silvio Micali
EUROCRYPT
1999
Springer
14 years 4 months ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail
EUROCRYPT
1999
Springer
14 years 4 months ago
Conditional Oblivious Transfer and Timed-Release Encryption
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...
Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramak...
EUROCRYPT
1999
Springer
14 years 4 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
EUROCRYPT
1999
Springer
14 years 4 months ago
Computationally Private Information Retrieval with Polylogarithmic Communication
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
Christian Cachin, Silvio Micali, Markus Stadler
EUROCRYPT
1999
Springer
14 years 4 months ago
S-boxes with Controllable Nonlinearity
Abstract. In this paper, we give some relationship between the nonlinearity of rational functions over F2n and the number of points of associated hyperelliptic curve. Using this, w...
Jung Hee Cheon, Seongtaek Chee, Choonsik Park