Geodesic
Degeneracy bounds for private information retrieval protocols
Diskretnaya Matematika, Tome 18 (2006) no. 2, pp. 98-110
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Protocols to retrieve information which hide the query allows a user to get the desired information bit from a database replicated on several noncommunicating servers in such a way that the administrator of the database knows nothing about the index of the bit the user queries. A protocol is said to be degenerate if the user, as the result of the query, gets the whole database. We find bounds for protocol parameters where the degeneracy can be obviated. 
@article{DM_2006_18_2_a6,
     author = {G. A. Mailybaeva},
     title = {Degeneracy bounds for private information retrieval protocols},
     journal = {Diskretnaya Matematika},
     pages = {98--110},
     year = {2006},
     volume = {18},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2006_18_2_a6/}
}
TY  - JOUR
AU  - G. A. Mailybaeva
TI  - Degeneracy bounds for private information retrieval protocols
JO  - Diskretnaya Matematika
PY  - 2006
SP  - 98
EP  - 110
VL  - 18
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_2006_18_2_a6/
LA  - ru
ID  - DM_2006_18_2_a6
ER  - 
%0 Journal Article
%A G. A. Mailybaeva
%T Degeneracy bounds for private information retrieval protocols
%J Diskretnaya Matematika
%D 2006
%P 98-110
%V 18
%N 2
%U http://geodesic.mathdoc.fr/item/DM_2006_18_2_a6/
%G ru
%F DM_2006_18_2_a6
G. A. Mailybaeva. Degeneracy bounds for private information retrieval protocols. Diskretnaya Matematika, Tome 18 (2006) no. 2, pp. 98-110. http://geodesic.mathdoc.fr/item/DM_2006_18_2_a6/

[1] Chor B., Goldreich O., Kushilevitz E., Sudan M., “Private information retrieval”, J. ACM, 45:6 (1998), 965–982 | DOI | MR | Zbl

[2] Gasanov E. E., Mailybaeva G. A., “Dostup k bazam dannykh bez raskrytiya zaprosa”, Materialy konferentsii «Matematika i bezopasnye informatsionnye tekhnologii», Moskva, 2003, 393–395