Sciweavers

EUROCRYPT
1999
Springer
14 years 3 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 3 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 3 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 3 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 3 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 3 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
EUROCRYPT
1999
Springer
14 years 3 months ago
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Eli Biham, Alex Biryukov, Adi Shamir
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
14 years 3 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
CRYPTO
1999
Springer
63views Cryptology» more  CRYPTO 1999»
14 years 3 months ago
Information-Theoretic Cryptography
Ueli M. Maurer
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
14 years 3 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai