000 02890nam a22004455i 4500
001 978-3-642-14358-8
003 DE-He213
005 20140220084542.0
007 cr nn 008mamaa
008 101109s2010 gw | s |||| 0|eng d
020 _a9783642143588
_9978-3-642-14358-8
024 7 _a10.1007/978-3-642-14358-8
_2doi
050 4 _aQA76.9.D35
072 7 _aUMB
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM031000
_2bisacsh
082 0 4 _a005.74
_223
100 1 _aYekhanin, Sergey.
_eauthor.
245 1 0 _aLocally Decodable Codes and Private Information Retrieval Schemes
_h[electronic resource] /
_cby Sergey Yekhanin.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXII, 82 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aInformation Security and Cryptography,
_x1619-7100
505 0 _aLocally decodable codes via the point removal method -- Limitations of the point removal method -- Private information retrieval.
520 _aLocally decodable codes (LDCs) are codes that simultaneously provide efficient random access retrieval and high noise resilience by allowing reliable reconstruction of an arbitrary bit of a message by looking at only a small number of randomly chosen codeword bits. Local decodability comes with a certain loss in terms of efficiency – specifically, locally decodable codes require longer codeword lengths than their classical counterparts. Private information retrieval (PIR) schemes are cryptographic protocols designed to safeguard the privacy of database users. They allow clients to retrieve records from public databases while completely hiding the identity of the retrieved records from database owners. In this book the author provides a fresh algebraic look at the theory of locally decodable codes and private information retrieval schemes, obtaining new families of each which have much better parameters than those of previously known constructions, and he also proves limitations of two server PIRs in a restricted setting that covers all currently known schemes. The author's related thesis won the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 1 4 _aComputer Science.
650 2 4 _aData Structures, Cryptology and Information Theory.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642143571
830 0 _aInformation Security and Cryptography,
_x1619-7100
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-14358-8
912 _aZDB-2-SCS
999 _c112459
_d112459