컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0605 |
|---|---|
| 분류(Section) | Invited Talk |
| 분과(Session) | Combinatorics / Graph Theory / Cryptography / Coding Theory (SS-05) |
| 영문제목 (Title(Eng.)) |
Private information retrieval |
| 저자(Author(s)) |
Huaxiong Wang1 Nanyang Technological University, Singapore1 |
| 초록본문(Abstract) | The widespread use of the World-Wide Web and Internet application make publicly accessible databases an indispensable resource for retriving up-to-date information. However, accessing such databases poses significant risks to user privacy. Private Information Retrieval (PIR) is a cryptographic solution that allows a user to retrieve a data item of their choice from a database, such that the server storing the database does not gain any information on the identity of the item being retrieved. A trivial solution to the PIR problem is to send the entire database to the user. In this perfect privacy solution, the communication complexity is prohibitively large. For example, consider retrieval from a Web search-engine. One of the most significant goals of PIR-related research has been to minimise the communication overhead imposed by the privacy constraint. Since the PIR problem was first formulated by Chor, Goldreich, Kushilevitz and Sudan in 1995, it has been an area of active research and various settings and extensions have been considered. In this talk, we will give a brief introduction to this exciting topic. |
| 분류기호 (MSC number(s)) |
94A60 |
| 키워드(Keyword(s)) | locally decodable codes, Private information retrieval, Cryptography. |
| 강연 형태 (Language of Session (Talk)) |
English |