Literatura académica sobre el tema "Codes for Private Information Retrieval"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Codes for Private Information Retrieval".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Codes for Private Information Retrieval"
Zhang, Yiwei, Xin Wang, Hengjia Wei y Gennian Ge. "On Private Information Retrieval Array Codes". IEEE Transactions on Information Theory 65, n.º 9 (septiembre de 2019): 5565–73. http://dx.doi.org/10.1109/tit.2019.2920635.
Texto completoKrishnan K. H., Murali y Jagadeesh Harshan. "On the Existence of XOR-Based Codes for Private Information Retrieval with Private Side Information". Entropy 23, n.º 10 (30 de septiembre de 2021): 1287. http://dx.doi.org/10.3390/e23101287.
Texto completoFreij-Hollanti, Ragnar, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David Karpuk y Ivo Kubjas. "$t$-private information retrieval schemes using transitive codes". IEEE Transactions on Information Theory 65, n.º 4 (abril de 2019): 2107–18. http://dx.doi.org/10.1109/tit.2018.2871050.
Texto completoLi, Jie, David Karpuk y Camilla Hollanti. "Towards Practical Private Information Retrieval From MDS Array Codes". IEEE Transactions on Communications 68, n.º 6 (junio de 2020): 3415–25. http://dx.doi.org/10.1109/tcomm.2020.2980833.
Texto completoLavauzelle, Julien, Razane Tajeddine, Ragnar Freij-Hollanti y Camilla Hollanti. "Private Information Retrieval Schemes With Product-Matrix MBR Codes". IEEE Transactions on Information Forensics and Security 16 (2021): 441–50. http://dx.doi.org/10.1109/tifs.2020.3003572.
Texto completoTian, Chao, Hua Sun y Jun Chen. "A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems". Information 14, n.º 1 (11 de enero de 2023): 44. http://dx.doi.org/10.3390/info14010044.
Texto completoZhou, Ruida, Chao Tian, Hua Sun y Tie Liu. "Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size". IEEE Transactions on Information Theory 66, n.º 8 (agosto de 2020): 4904–16. http://dx.doi.org/10.1109/tit.2020.2977073.
Texto completoKumar, Siddhartha, Hsuan-Yin Lin, Eirik Rosnes y Alexandre Graell i Amat. "Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes". IEEE Transactions on Information Theory 65, n.º 7 (julio de 2019): 4243–73. http://dx.doi.org/10.1109/tit.2019.2900313.
Texto completoGoldreich, Oded, Howard Karloff, Leonard J. Schulman y Luca Trevisan. "Lower bounds for linear locally decodable codes and private information retrieval". computational complexity 15, n.º 3 (octubre de 2006): 263–96. http://dx.doi.org/10.1007/s00037-006-0216-3.
Texto completoLavauzelle, Julien y Jade Nardi. "Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval". IEEE Transactions on Information Theory 67, n.º 1 (enero de 2021): 111–23. http://dx.doi.org/10.1109/tit.2020.3020752.
Texto completoTesis sobre el tema "Codes for Private Information Retrieval"
Yekhanin, Sergey. "Locally Decodable Codes and Private Information Retrieval Schemes". Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42242.
Texto completoIncludes bibliographical references (leaves 90-99).
This thesis studies two closely related notions, namely Locally Decodable Codes (LDCs) and Private Information Retrieval Schemes (PIRs). Locally decodable codes are error-correcting codes that allow extremely efficient, "sublinear-time" decoding procedures. More formally, a k-query locally decodable code encodes n-bit messages x in such a way that one can probabilistically recover any bit xi of the message by querying only k bits of the (possibly corrupted) code-word, where k can be as small as 2. LDCs were initially introduced in complexity theory in the context of worst-case to average-case reductions and probabilistically checkable proofs. Later they have found applications in numerous other areas including information theory, cryptography and the theory of fault tolerant computation. The major goal of LDC related research is to establish the optimal trade-off between length N and query complexity k of such codes, for a given message length n. Private information retrieval schemes are cryptographic protocols developed in order to protect the privacy of the user's query, when accessing a public database. In such schemes a database (modelled by an n-bit string x) is replicated between k non-communicating servers. The user holds an index i and is interested in obtaining the value of the bit xi. To achieve this goal, the user queries each of the servers and gets replies from which the desired bit xi can be computed. The query to each server is distributed independently of i and therefore each server gets no information about what the user is after. The main parameter of interest in a PIR scheme is its communication complexity, namely the number of bits exchanged by the user accessing an n-bit database and the servers. In this thesis we provide a fresh algebraic look at the theory of locally decodable codes and private information retrieval schemes.
(cont.) We obtain new families of LDCs and PIRs that have much better parameters than those of previously known constructions. We also prove limitations of two server PIRs in a restricted setting that covers all currently known schemes. Below is a more detailed summary of our contributions. * Our main result is a novel (point removal) approach to constructing locally decodable codes that yields vast improvements upon the earlier work. Specifically, given any Mersenne prime p = 2t - 1, we design three query LDCs of length N = exp (nl/t), for every n. Based on the largest known Mersenne prime, this translates to a length of less than exp (n10-7), compared to exp (n1/2) in the previous constructions. It has often been conjectured that there are infinitely many Mersenne primes. Under this conjecture, our constructions yield three query locally decodable codes of length N = exp n(oglog)) for infinitely many n. * We address a natural question regarding the limitations of the point-removal approach. We argue that further progress in the unconditional bounds via this method (under a fairly broad definition of the method) is tied to progress on an old number theory question regarding the size of the largest prime factors of Mersenne numbers. * Our improvements in the parameters of locally decodable codes yield analogous improvements for private information retrieval schemes. We give 3-server PIR schemes with communication complexity of O (n10-7) to access an n-bit database, compared to the previous best scheme with complexity 0(n1/5.25).
(cont.) Assuming again that there are infinitely many Mersenne primes, we get 3-server PIR schemes of communication complexity n(1/ loglog n) for infinitely many n. * Our constructions yield tremendous improvements for private information retrieval schemes involving three or more servers, and provide no insights on the two server case. This raises a natural question regarding whether the two server case is truly intrinsically different. We argue that this may well be the case. We introduce a novel combinatorial approach to PIR and establish the optimality of the currently best known two server schemes a restricted although fairly broad model
by Sergey Yekhanin.
Ph.D.
Harvey, Brett D. "A code of practice for practitioners in private healthcare: a privacy perspective". Thesis, Nelson Mandela Metropolitan University, 2007. http://hdl.handle.net/10948/521.
Texto completoNardi, Jade. "Quelques retombées de la géométrie des surfaces toriques sur un corps fini sur l'arithmétique et la théorie de l'information". Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30051.
Texto completoA part of this thesis, at the interface between Computer Science and Mathematics, is dedicated to the study of the parameters ans properties of Goppa codes over Hirzebruch surfaces. From an arithmetical perspective, the question about number of rational points of a variety defined over a finite field, which seemed dealt with by Lefchetz formula, regained interest thanks to error correcting codes. The minimum distance of an algebraic-geometric codes provides an upper bound of the number of rational points of a hypersurface of a given variety and with a fixed Picard class. Since reducible curves are most likely to reach this bound, one can focus on irreducible curves to get sharper bounds. A global strategy to bound the number of points on a variety depending on its ambient space and some of its geometric invariants is exhibited here. Moreover we develop a method for curves on toric surfaces by adapting F.J. Voloch et K.O. Sthör's idea on toric varieties. Finally, we interest in Private Information Retrivial protocols, which aim to ensure that a user can access an entry of a database without revealing any information on it to the database owner. A PIR protocol based on codes over weighted projective planes is displayed here. It enhances other protocols by offering a resistance to servers collusions, at the expense of a loss of storage capacity. This issue is fixed by a lifting process, which leads to asymptotically good families of codes, with the same local properties
Malek, Behzad. "Efficient private information retrieval". Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/26966.
Texto completoChen, Junjie. "Learning hash codes for multimedia retrieval". HKBU Institutional Repository, 2019. https://repository.hkbu.edu.hk/etd_oa/684.
Texto completoLiu, Tianren S. M. Massachusetts Institute of Technology. "On basing private information retrieval on NP-hardness". Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/106093.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (pages 17-19).
The possibility of basing the security of cryptographic objects on the (minimal) assumption that NP ... BPP is at the very heart of complexity-theoretic cryptography. Most known results along these lines are negative, showing that assuming widely believed complexity-theoretic conjectures, there are no reductions from an NP-hard problem to the task of breaking certain cryptographic schemes. We make progress along this line of inquiry by showing that the security of single-server single-round private information retrieval schemes cannot be based on NP-hardness, unless the polynomial hierarchy collapses. Our main technical contribution is in showing how to break the security of a PIR protocol given an SZK oracle. Our result is tight in terms of both the correctness and the privacy parameter of the PIR scheme.
by Tianren Liu.
S.M.
Lincoln, Laura Beth. "Symmetric private information retrieval via additive homomorphic probabilistic encryption /". Online version of thesis, 2006. https://ritdml.rit.edu/dspace/handle/1850/2792.
Texto completoRaymond, Jean-Francois 1974. "Private information retrieval : improved upper bound, extension and applications". Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30830.
Texto completoMiceli, Michael. "Private Information Retrieval in an Anonymous Peer-to-Peer Environment". ScholarWorks@UNO, 2011. http://scholarworks.uno.edu/td/1331.
Texto completoZhou, Yanliang. "Efficient Linear Secure Computation and Symmetric Private Information Retrieval Protocols". Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1752381/.
Texto completoLibros sobre el tema "Codes for Private Information Retrieval"
Yekhanin, Sergey. Locally Decodable Codes and Private Information Retrieval Schemes. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14358-8.
Texto completoLocally decodable codes and private information retrieval schemes. Berlin: Springer, 2010.
Buscar texto completoYi, Xun, Russell Paulet y Elisa Bertino. Private Information Retrieval. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-031-02337-8.
Texto completoAgency, International Atomic Energy, ed. INIS: Terminology and codes for countries and international organizations. 7a ed. Vienna: International Atomic Energy Agency, 1991.
Buscar texto completoUnited States. Department of Education. Student Financial Assistance Programs. FASA school codes search. [Washington, D.C.]: U.S. Dept. of Education, 1999.
Buscar texto completoAhituv, Niv. Protecting statistical data bases against retrieval of private information. Tel Aviv, Israel: Tel Aviv University, Faculty of Management, Leon Recanati Graduate School of Business Administration, 1987.
Buscar texto completoNestel, Barry L. Revenue and cost codes for use with INFORM. The Hague, Netherlands: isnar, International Service for National Agricultural Service, 1991.
Buscar texto completoAsonov, Dmitri. Querying databases privately: A new approach to private information retrieval. Berlin: Springer, 2004.
Buscar texto completoService, United States Internal Revenue. Transction codes pocket guide. [Washington, D.C.?]: Dept. of the Treasury, Internal Revenue Service, 2001.
Buscar texto completoComputer Systems Laboratory (U.S.), ed. Codes for the identification of federal and federally assisted organizations. Gaithersburg, MD: Computer Systems Laboratory, National Institute of Standards and Technology, 1993.
Buscar texto completoCapítulos de libros sobre el tema "Codes for Private Information Retrieval"
Bodur, Şeyma, Edgar Martínez-Moro y Diego Ruano. "Private Information Retrieval Schemes Using Cyclic Codes". En Arithmetic of Finite Fields, 194–207. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-22944-2_12.
Texto completoWehner, Stephanie y Ronald de Wolf. "Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval". En Automata, Languages and Programming, 1424–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_115.
Texto completoYi, Xun. "Private Information Retrieval". En Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_80752-1.
Texto completoBlundo, Carlo. "Private Information Retrieval". En Encyclopedia of Cryptography and Security, 974–76. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_762.
Texto completoYekhanin, Sergey. "Private information retrieval". En Information Security and Cryptography, 61–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14358-8_4.
Texto completoYi, Xun. "Private Information Retrieval". En Encyclopedia of Database Systems, 2825–30. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_80752.
Texto completoBlundo, Carlo. "Private Information Retrieval". En Encyclopedia of Cryptography, Security and Privacy, 1–4. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-642-27739-9_762-2.
Texto completoYi, Xun, Russell Paulet y Elisa Bertino. "Privacy-Preserving Location-Based Queries". En Private Information Retrieval, 63–81. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-031-02337-8_4.
Texto completoYi, Xun, Russell Paulet y Elisa Bertino. "Classic Private Information Retrieval". En Private Information Retrieval, 1–17. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-031-02337-8_1.
Texto completoYi, Xun, Russell Paulet y Elisa Bertino. "FHE-Based Private Information Retrieval". En Private Information Retrieval, 19–35. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-031-02337-8_2.
Texto completoActas de conferencias sobre el tema "Codes for Private Information Retrieval"
Qian, Chengyuan, Ruida Zhou, Chao Tian y Tie Liu. "Improved Weakly Private Information Retrieval Codes". En 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022. http://dx.doi.org/10.1109/isit50566.2022.9834396.
Texto completoVajha, Myna, Vinayak Ramkumar y P. Vijay Kumar. "Binary, shortened projective reed muller codes for coded private information retrieval". En 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8007009.
Texto completoBanawan, Karim y Sennur Ulukus. "Private information retrieval from coded databases". En ICC 2017 - 2017 IEEE International Conference on Communications. IEEE, 2017. http://dx.doi.org/10.1109/icc.2017.7997393.
Texto completoChan, Terence H., Siu-Wai Ho y Hirosuke Yamamoto. "Private information retrieval for coded storage". En 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282975.
Texto completoZhou, Ruida, Chao Tian, Tie Liu y Hua Sun. "Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size". En 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849542.
Texto completoKazemi, Fatemeh, Esmaeil Karimi, Anoosheh Heidarzadeh y Alex Sprintson. "Private Information Retrieval with Private Coded Side Information: The Multi-Server Case". En 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2019. http://dx.doi.org/10.1109/allerton.2019.8919808.
Texto completoKumar, Siddhartha, Alexandre Graell i Amat y Eirik Rosnes. "Private Information Retrieval in Wireless Coded Caching". En 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2019. http://dx.doi.org/10.1109/spawc.2019.8815548.
Texto completoTajeddine, Razane y Salim El Rouayheb. "Robust private information retrieval on coded data". En 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006860.
Texto completoKazemi, Fatemeh, Esmaeil Karimi, Anoosheh Heidarzadeh y Alex Sprintson. "Multi-Server Private Information Retrieval with Coded Side Information". En 2019 16th Canadian Workshop on Information Theory (CWIT). IEEE, 2019. http://dx.doi.org/10.1109/cwit.2019.8929933.
Texto completoVithana, Sajani, Karim Banawan y Sennur Ulukus. "Semantic Private Information Retrieval From MDS-Coded Databases". En 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517765.
Texto completoInformes sobre el tema "Codes for Private Information Retrieval"
Jha, Somesh, Vitaly Shmatikov y Matthew Fredrikson. Private Information Retrieval. Fort Belvoir, VA: Defense Technical Information Center, diciembre de 2010. http://dx.doi.org/10.21236/ada536856.
Texto completoKagal, Lalana. Policy Compliance of Queries for Private Information Retrieval. Fort Belvoir, VA: Defense Technical Information Center, noviembre de 2010. http://dx.doi.org/10.21236/ada533742.
Texto completoBlock, Juan I. y David K. Levine. Codes of Conduct, Private Information, and Repeated Games. Federal Reserve Bank of St. Louis, 2012. http://dx.doi.org/10.20955/wp.2012.031.
Texto completoSaint-Jean, Felipe. Java Implementation of a Single-Database Computationally Symmetric Private Information Retrieval (cSPIR) Protocol. Fort Belvoir, VA: Defense Technical Information Center, julio de 2005. http://dx.doi.org/10.21236/ada459016.
Texto completoMehmood, Hamid, Surya Karthik Mukkavilli, Ingmar Weber, Atsushi Koshio, Chinaporn Meechaiya, Thanapon Piman, Kenneth Mubea, Cecilia Tortajada, Kimberly Mahadeo y Danielle Liao. Strategic Foresight to Applications of Artificial Intelligence to Achieve Water-related Sustainable Development Goals. United Nations University Institute for Water, Environment and Health, abril de 2020. http://dx.doi.org/10.53328/lotc2968.
Texto completoPayment Systems Report - June of 2021. Banco de la República, febrero de 2022. http://dx.doi.org/10.32468/rept-sist-pag.eng.2021.
Texto completo