Christian Cachin, Claude Crepeau, and Julien Marcil. Oblivious transfer with a memorybounded receiver. In 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 493-502, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Tight Security Proofs for the Bounded-Storage Model - Stefan Dziembowski Dziembowski (2002) (7 citations) (Correct)
.... it is everlasting see [1] for more on this) and (2) as shown in [9, 10] one initial key can be reused in several independent schemes (even if the adversary can adaptively learn the derived keys) The bounded storage model was also studied in the context of secure two party computations (see [9, 8, 5]) message authentication and non malleable encryption [9, 10] 1.6 Contributions of this Paper The main open question of [14, 2, 1] is whether keyexpansion with constant randomness eciency is possible. We solve this problem which has both theoretical and possibly practical implications. The ....
C. Cachin, C. Crepeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), pages 493-502. IEEE Computer Society, 1998.
Private Information Retrieval for Streaming Data - Anonymous Author October (Correct)
.... the negative result that it is unlikely to base OT on the existence of one way functions [IR89] Kilian s result that every secure 2 party and multi party computation can be reduced to OT [K88] informationtheoretically secure OT under the bounded storage model by Cachin, Cr epeau, and Marcil [CCM98] and Ding [D01] The reader is referred to [G98] for a systematic and up to date description. The main difference between researches in PIR SPIR and OT is that OT is more concerned about security under different computational complexity assumptions and OT as a cryptographical primitive, and ....
C. Cachin, C. Cr'epeau, and J. Marcil, Oblivious Transfer With a Memory-Bounded Receiver, In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS'98), pp. 493-502, 1998.
One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (1 citation) (Correct)
....g . ffl Each function g 2 GK is a permutation over f0; 1g K and is computable in polynomial time (that is, there exists an algorithm that given g 2 G, and x 2 f0; 1g computes the value of g(x) in time polynomial in jxj) 5 Interactive hashing has found many applications in cryptography (cf. [33, 29, 14, 34, 35, 18, 10, 6]) since, in some settings, it can replace collision resistant hash functions but it can be implemented from general cryptographic assumptions. The drawback of this primitive is its high round complexity (our protocol for a malicious server inherits this drawback; the question of how to reduce the ....
....that property 3 does not guarantee that specific bits of x are hard to find. Instead we will make use of hard core bits. We shall use in an essential way an interactive hashing protocol of Ostrovsky, Venkatesan and Yung [33] Interactive hashing found many applications in cryptography (cf. [33, 14, 29, 34, 35, 18, 10, 6]) This is a protocol between two players Alice and Bob, where both Alice and Bob are probabilistic polynomial time machines. Alice is given as an input 1 K , a function g 2 GK and an input x 2 f0; 1g K ; Bob is given 1 K . The interactive hashing protocol proceeds as follows: ffl Bob ....
C. Cachin, C. Crepeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 493-502, 1998.
Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000) (16 citations) (Correct)
....a sequence of random indices) and in response Alice sends to Bob her two secret bits appropriately masked, so that Bob can reconstruct only one of them. A formal description of protocol (Alice; Bob) is in Figure 1. We note that some related techniques to those in our construction have appeared in [5]; however, we remark that the protocol of [5] cannot be used in our case, mainly because of the differences in the models. We next prove that (Alice; Bob) is a honest Bob i 2 1 j OT protocol. Correctness. In order to prove the correctness of (Alice; Bob) we need to show that Bob outputs b ....
....Alice sends to Bob her two secret bits appropriately masked, so that Bob can reconstruct only one of them. A formal description of protocol (Alice; Bob) is in Figure 1. We note that some related techniques to those in our construction have appeared in [5] however, we remark that the protocol of [5] cannot be used in our case, mainly because of the differences in the models. We next prove that (Alice; Bob) is a honest Bob i 2 1 j OT protocol. Correctness. In order to prove the correctness of (Alice; Bob) we need to show that Bob outputs b c with probability at least 1 Gamma k ....
C. Cachin, C. Crepeau, and S. Marcil. Oblivious Transfer with a Memory Bounded Receiver. In Proc. of 39th FOCS, 1998.
Oblivious Transfer and Balanced Functions - Damgård, Fehr, Salvail.. (2005) (Correct)
No context found.
Christian Cachin, Claude Crepeau, and Julien Marcil. Oblivious transfer with a memorybounded receiver. In 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 493-502, 1998.
Cryptography in the Bounded Quantum-Storage Model - Damgård, Fehr.. (2005) (Correct)
No context found.
C. Cachin, C. Cr epeau, and J. Marcil. Oblivious Transfer with a Memory-Bounded Receiver. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science --- FOCS 1998.
One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (1 citation) (Correct)
No context found.
C. Cachin, C. Crepeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 493-502, 1998.
Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000) (16 citations) (Correct)
No context found.
C. Cachin, C. Crepeau, and S. Marcil. Oblivious Transfer with a Memory Bounded Receiver. In Proc. of 39th FOCS, 1998.
Efficient k-out-of-n Oblivious Transfer Schemes with Adaptive.. - Chu, Tzeng (2004) (Correct)
No context found.
Christian Cachin, Claude Crepeau, and Julien Marcil. Oblivious transfer with a memory-bounded receiver. In Proceedings of 39th Annual Symposium on Foundations of Computer Science (FOCS '98), pages 493--502. IEEE, 1998. 11
Optimal Randomizer Efficiency in the Bounded-Storage Model - Dziembowski, Maurer (Correct)
No context found.
C. Cachin, C. Cr'epeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), pp. 493--502. IEEE Computer Society, 1998.
Efficient k-out-of-n Oblivious Transfer Schemes with Adaptive.. - Chu, Tzeng (2004) (Correct)
No context found.
Christian Cachin, Claude Crepeau, and Julien Marcil. Oblivious transfer with a memory-bounded receiver. In Proceedings of 39th Annual Symposium on Foundations of Computer Science (FOCS '98), pages 493--502. IEEE, 1998.
Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000) (16 citations) (Correct)
No context found.
C. Cachin, C. Crepeau, and S. Marcil. Oblivious Transfer with a Memory Bounded Receiver. In Proc. of 39th FOCS, 1998.
Non-Interactive Timestamping In The Bounded Storage Model - Moran, Shaltiel, Ta-Shma (2004) (Correct)
No context found.
Christian Cachin, Claude Crepeau, and Julien Marcil. Oblivious transfer with a memory-bounded receiver. In IEEE Symposium on Foundations of Computer Science, pages 493--502, 1998.
On Symmetrically Private Information Retrieval - Mishra (2000) (Correct)
No context found.
C. Cachin, C. Crepeau, and S. Marcil. Oblivious transfer with a memory bounded receiver. In Proceedings of 39th FOCS, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC