G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Breaking the O(n^(1/(2k-1))) Barrier for.. - Beimel, Ishai.. (Correct)
.... termed symmetric PIR (SPIR) 17, 29] and other extensions [30, 16, 13, 6, 9, 7] PIR was also studied in a computational setting where privacy should only hold against computationally bounded servers; computational PIR was studied in both the multi server setting [10] and a single server setting [25, 27, 32, 8, 26, 14, 24]. In contrast to information theoretic PIR, computational PIR protocols with sublinear communication exist even in the singleserver case (under standard cryptographic assumptions) From a practical point of view, single server PIR protocols are preferable to multi server ones for obvious reasons: ....
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In EUROCRYPT 2000.
Breaking the O(n^(1/(2k-1))) Barrier for.. - Beimel, Ishai.. (2002) (Correct)
.... termed symmetric PIR (SPIR) 17, 29] and other extensions [30, 16, 13, 6, 9, 7] PIR was also studied in a computational setting where privacy should only hold against computationally bounded servers; computational PIR was studied in both the multi server setting [10] and a single server setting [25, 27, 32, 8, 26, 14, 24]. In contrast to information theoretic PIR, computational PIR protocols with sublinear communication exist even in the singleserver case (under standard cryptographic assumptions) From a practical point of view, single server PIR protocols are preferable to multi server ones for obvious reasons: ....
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In EUROCRYPT 2000.
Breaking the O(n^(1/(2k-1))) Barrier for.. - Beimel, Ishai.. (Correct)
.... termed symmetric PIR (SPIR) 17, 29] and other extensions [30, 16, 13, 6, 9, 7] PIR was also studied in a computational setting where privacy should only hold against computationally bounded servers; computational PIR was studied in both the multi server setting [10] and a single server setting [25, 27, 32, 8, 26, 14, 24]. In contrast to information theoretic PIR, computational PIR protocols with sublinear communication exist even in the singleserver case (under standard cryptographic assumptions) From a practical point of view, single server PIR protocols are preferable to multi server ones for obvious reasons: ....
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In EUROCRYPT 2000.
Security Issues and Requirements for Internet-Scale.. - Wang, Carzaniga.. (14 citations) (Correct)
....circuit evaluation function [2] In practice, however, it is difficult and often impractical to encode the function as an input to a universal circuit; the proposed schemes often involve an expensive protocol. Another related subject of interest is Private Information Retrieval (PIR) 11][12]. PIR mechanisms allow a user to retrieve records from a database, and in the meantime, hide what she retrieves from the database. Studies on PIR schemes showed that PIR is at least as hard as Oblivious Transfer [12] which implies the existence of one way functions. A close examination of ....
....Another related subject of interest is Private Information Retrieval (PIR) 11] 12] PIR mechanisms allow a user to retrieve records from a database, and in the meantime, hide what she retrieves from the database. Studies on PIR schemes showed that PIR is at least as hard as Oblivious Transfer [12], which implies the existence of one way functions. A close examination of subscription confidentiality suggests that close relations exist between PIR and subscription confidentiality. For example, one can easily construct a PIR mechanism using a black box that implements subscription ....
. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. "Singledatabase private information retrieval implies oblivious transfer". In Advances in Cryptology-- EUROCRYPT'00.
Security Issues and Requirements for Internet-Scale.. - Wang, Carzaniga.. (14 citations) (Correct)
....circuit evaluation function [2] In practice, however, it is difficult and often impractical to encode the function as an input to a universal circuit; the proposed schemes often involve an expensive protocol. Another related subject of interest is Private Information Retrieval (PIR) 11][12]. PIR mechanisms allow a user to retrieve records from a database, and in the meantime, hide what she retrieves from the database. Studies on PIR schemes showed that PIR is at least as hard as Oblivious Transfer [12] which implies the existence of one way functions. A close examination of ....
....Another related subject of interest is Private Information Retrieval (PIR) 11] 12] PIR mechanisms allow a user to retrieve records from a database, and in the meantime, hide what she retrieves from the database. Studies on PIR schemes showed that PIR is at least as hard as Oblivious Transfer [12], which implies the existence of one way functions. A close examination of subscription confidentiality suggests that close relations exist between PIR and subscription confidentiality. For example, one can easily construct a PIR mechanism using a black box that implements subscription ....
. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. "Single-database private information retrieval implies oblivious transfer". In Advances in Cryptology---EUROCRYPT'00.
Efficient Oblivious Transfer Schemes - Tzeng (2001) (Correct)
....scheme. The number (size) of exchanged messages is not as e#cient as ours. For example, if k is close to the security parameter, our k bit string OT 1 2 scheme exchanges O(k) bits and that of [34] exchanges O(k 2 ) bits. Transforming any PIR scheme to a symmetric PIR scheme has been studied in [19, 26]. Naor and Pinkas [26] show such a reduction using one call to the base PIR scheme and a logarithmic number of calls to a string OT 1 2 scheme. Crescenzo, etc [19] show a reduction using communication poly(k) times of that of the base PIR scheme, where k is the security parameter. In comparison, ....
....O(k) bits and that of [34] exchanges O(k 2 ) bits. Transforming any PIR scheme to a symmetric PIR scheme has been studied in [19, 26] Naor and Pinkas [26] show such a reduction using one call to the base PIR scheme and a logarithmic number of calls to a string OT 1 2 scheme. Crescenzo, etc [19], show a reduction using communication poly(k) times of that of the base PIR scheme, where k is the security parameter. In comparison, our reduction uses only one extra communication cost. 2 1 out n Oblivious Transfer An OT 1 n scheme is a two party protocol in which the sender S possesses n ....
G.Di Crescenzo, T. Malkin, R. Ostrovsky, "Single database private information retrieval implies oblivious transfer," In Proceedings of Advances in Cryptology - Eurocrypt 00, Lecture Notes in Computer Science , pp.122-138, Springer-Verlag, 2000.
On Symmetrically Private Information Retrieval - Mishra (2000) (Correct)
....OWF. Furthermore , proving any such black box construction is as hard as separating P from NP. Thus [57] gives a strong evidence that OWF are currently not sucient to construct OT and consequently SPIR, i.e. OT or SPIR is a strictly stronger assumption. Recently, Cresenzo, Malkin, and Ostrovsky [45] proved that PIR cannot be based on weak computational assumptions. PIR is also a complete primitive, and any nontrivial implementation of single server PIR may be used to construct any other secure protocol. They also suggested transformation of communication ecient single server PIR to ....
....of his query. Here we like to add that zero knowledge proof although add a communication overhead only polynomial in query size but need in multiround of communication. Also communication overhead even polynomially related to query size is too costly in practical uses. Recently, Crescenzo et al. [45] provided a general transformation of a single server PIR scheme with communication complexity C(n) n, where n is the length of the database, into a SPIR scheme with security parameter K and communication complexity C(n) q(K) for some polynomial q, but even there scheme use multiround of ....
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. In Proceedings of EUROCRYPT'00, 2000.
Private Searching On Streaming Data - Rafail Ostrovsky William (2005) (4 citations) Self-citation (Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000.
Private Searching On Streaming Data - Rafail Ostrovsky William (2005) (4 citations) Self-citation (Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000.
One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (1 citation) Self-citation (Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000.
Public Key Encryption with Keyword Search - Boneh, Di Crescenzo, Ostrovsky, .. (2004) (15 citations) Self-citation (Di crescenzo Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000.
Batch Codes and Their Applications - Yuval Ishai Yuvali (2004) Self-citation (Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single Database Private Information Retrieval Implies Oblivious Transfer. In Proc. EUROCRYPT 2000, pages 122-138.
Public Key Encryption with Keyword Search - Boneh, Di Crescenzo, Ostrovsky, .. (2003) (15 citations) Self-citation (Di crescenzo Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000.
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) Self-citation (Ostrovsky) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single Database Private Information Retrieval Implies Oblivious Transfer. In Proc. EUROCRYPT 2000, pages 122-138.
Reducing the Servers Computation in Private Information.. - Beimel, Ishai, Malkin (19 citations) Self-citation (Malkin) (Correct)
....make the problem more concrete, the database is modeled as an n bit string x, and the user has some index i and is interested in privately retrieving the value of x i . Since its introduction, PIR has been an area of active research, and various settings and extensions have been considered (e.g. [2, 25, 10, 20, 18,17, 14, 9, 8, 19, 15, 21, 1]) Most of the initial work on PIR has focused on the goal of minimizing the communication, which was considered the most expensive resource. However, despite considerable success in realizing this goal, the real life applicability of the proposed solutions remains questionable. One of the most ....
....every constant # 0, a single server protocol with communication complexity of O (n ) bits. Cachin, Micali, and Stadler [9] present a single server protocol with polylogarithmic communication complexity, based on a new number theoretic intractability assumption. Other works in this setting are [25, 24, 27, 8, 15, 21, 1]. The only previous work that has addressed the servers computation is that of Gertner, Goldwasser, and Malkin [17] see also [23] who present a model for PIR utilizing special purpose privacy servers, achieving stronger privacy guarantees and small computation for the original server holding ....
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In EUROCRYPT 2000, volume 1807 of LNCS, pages 122 --138, 2000.
On the Hardness of Information-Theoretic Multiparty Computation - Ishai, Kushilevitz (2004) (Correct)
No context found.
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Proc. of EUROCRYPT 2000.
Private Inference Control - Woodruff, Staddon (2004) (1 citation) (Correct)
No context found.
G. Di Crescenzo, T. Malkin and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. In Advances in Cryptology -- Eurocrypt 2000. 17
Private Inference Control - Woodruff, Staddon (2004) (1 citation) (Correct)
No context found.
G. Di Crescenzo, T. Malkin and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. In Advances in Cryptology -- Eurocrypt `00.
An Efficient Scheme for Preserving Confidentiality in.. - Li, Lu, Shi (2004) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Proceedings of Advances in Cryptology -- EUROCRYPT'00, 2000.
The Computational Complexity Column - Lance Fortnow Department (Correct)
No context found.
G. DiCrescenzo, T. Malkin, and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. In EUROCRYPT00, 2000.
A t-Private k-Database Private Information Retrieval Scheme - Blundo, D'Arco, De Santis (2002) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky, Single Database Private Information Retrieval Implies Oblivious Transfer, Proc. of Eurocrypt '00, Lecture Notes in Computer Science, vol. 1807, Springer-Verlag, pp. 122-138, 2000.
A Survey on Private Information Retrieval - Gasarch (2004) (1 citation) (Correct)
No context found.
G. DiCrescenzo, T. Malkin, and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. In EUROCRYPT00, 2000.
Breaking the O(n^(1/(2k-1))) Barrier for.. - Amos, Beimel.. (Correct)
No context found.
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In EUROCRYPT 2000.
On Unconditionally Secure Distributed Oblivious Transfer - Blundo, D'Arco, De.. (2003) (Correct)
No context found.
G. Di Crescenzo, T. Malkin, and R. Ostrovsky, Single Database Private Information Retrieval Implies Oblivious Transfer, Advances in Cryptology: Proceedings of Eurocrypt 2000.
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