EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
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...
EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
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...
EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
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...
EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
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 ...
EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
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...
EUROCRYPT
1999
Springer
14 years 27 days ago
1999
Springer
CRYPTO
1999
Springer
14 years 27 days ago
1999
Springer
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...
CRYPTO
1999
Springer
14 years 27 days ago
1999
Springer
CRYPTO
1999
Springer
14 years 27 days ago
1999
Springer
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...