Guessing Based on Compressed Side Information
A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The tension between the description rate and the exponential growth rate of the power mean of the required number of guesses is quantified. This can be viewe...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2022-07, Vol.68 (7), p.4244-4256 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4256 |
|---|---|
| container_issue | 7 |
| container_start_page | 4244 |
| container_title | IEEE transactions on information theory |
| container_volume | 68 |
| creator | Graczyk, Robert Lapidoth, Amos Merhav, Neri Pfister, Christoph |
| description | A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The tension between the description rate and the exponential growth rate of the power mean of the required number of guesses is quantified. This can be viewed as the guessing version of the classical indirect-rate-distortion problem of Dobrushin-Tsybakov'62 and Witsenhausen'80. Judicious choices of the correlated sequence, the description rate, and the fidelity criterion recover a number of recent and classical results on guessing. In the context of security, the paper provides conservative estimates on a password's remaining security after a number of bits from a correlated database have been leaked. |
| doi_str_mv | 10.1109/TIT.2022.3158475 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2022_3158475</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9733269</ieee_id><sourcerecordid>2677855802</sourcerecordid><originalsourceid>FETCH-LOGICAL-c159t-ff5aabdf5d8b369227dae8c8bc1228170e644c803ce8b0d68cb17c47377dae073</originalsourceid><addsrcrecordid>eNo9kEtLxDAURoMoWEf3gpuC69a8H0stzlgYcGFdhzRNpYNtatJZ-O_N0MHV5buc--AAcI9giRBUT03dlBhiXBLEJBXsAmSIMVEozuglyCBEslCUymtwE-MhRcoQzkCxO7oYh-krfzHRdbmf8sqPc0jNlD6GzuX11PswmmXw0y246s13dHfnugGf29emeiv277u6et4XFjG1FH3PjGm7nnWyJVxhLDrjpJWtRRhLJKDjlFoJiXWyhR2XtkXCUkHECYSCbMDjuncO_ic9uOiDP4YpndSYCyEZkxAnCq6UDT7G4Ho9h2E04VcjqE9SdJKiT1L0WUoaeVhHBufcP64EIZgr8gdlj1xY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2677855802</pqid></control><display><type>article</type><title>Guessing Based on Compressed Side Information</title><source>IEEE Electronic Library (IEL)</source><creator>Graczyk, Robert ; Lapidoth, Amos ; Merhav, Neri ; Pfister, Christoph</creator><creatorcontrib>Graczyk, Robert ; Lapidoth, Amos ; Merhav, Neri ; Pfister, Christoph</creatorcontrib><description>A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The tension between the description rate and the exponential growth rate of the power mean of the required number of guesses is quantified. This can be viewed as the guessing version of the classical indirect-rate-distortion problem of Dobrushin-Tsybakov'62 and Witsenhausen'80. Judicious choices of the correlated sequence, the description rate, and the fidelity criterion recover a number of recent and classical results on guessing. In the context of security, the paper provides conservative estimates on a password's remaining security after a number of bits from a correlated database have been leaked.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2022.3158475</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Accuracy ; Compression ; Correlation ; Distortion ; Entropy ; guessing ; helper ; Information processing ; Passwords ; Rate-distortion ; remote helper ; Remote sensing ; Security ; side information</subject><ispartof>IEEE transactions on information theory, 2022-07, Vol.68 (7), p.4244-4256</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c159t-ff5aabdf5d8b369227dae8c8bc1228170e644c803ce8b0d68cb17c47377dae073</cites><orcidid>0000-0001-6422-1433 ; 0000-0003-3761-3161 ; 0000-0002-9547-3243 ; 0000-0002-4742-5124</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9733269$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9733269$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Graczyk, Robert</creatorcontrib><creatorcontrib>Lapidoth, Amos</creatorcontrib><creatorcontrib>Merhav, Neri</creatorcontrib><creatorcontrib>Pfister, Christoph</creatorcontrib><title>Guessing Based on Compressed Side Information</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The tension between the description rate and the exponential growth rate of the power mean of the required number of guesses is quantified. This can be viewed as the guessing version of the classical indirect-rate-distortion problem of Dobrushin-Tsybakov'62 and Witsenhausen'80. Judicious choices of the correlated sequence, the description rate, and the fidelity criterion recover a number of recent and classical results on guessing. In the context of security, the paper provides conservative estimates on a password's remaining security after a number of bits from a correlated database have been leaked.</description><subject>Accuracy</subject><subject>Compression</subject><subject>Correlation</subject><subject>Distortion</subject><subject>Entropy</subject><subject>guessing</subject><subject>helper</subject><subject>Information processing</subject><subject>Passwords</subject><subject>Rate-distortion</subject><subject>remote helper</subject><subject>Remote sensing</subject><subject>Security</subject><subject>side information</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kEtLxDAURoMoWEf3gpuC69a8H0stzlgYcGFdhzRNpYNtatJZ-O_N0MHV5buc--AAcI9giRBUT03dlBhiXBLEJBXsAmSIMVEozuglyCBEslCUymtwE-MhRcoQzkCxO7oYh-krfzHRdbmf8sqPc0jNlD6GzuX11PswmmXw0y246s13dHfnugGf29emeiv277u6et4XFjG1FH3PjGm7nnWyJVxhLDrjpJWtRRhLJKDjlFoJiXWyhR2XtkXCUkHECYSCbMDjuncO_ic9uOiDP4YpndSYCyEZkxAnCq6UDT7G4Ho9h2E04VcjqE9SdJKiT1L0WUoaeVhHBufcP64EIZgr8gdlj1xY</recordid><startdate>20220701</startdate><enddate>20220701</enddate><creator>Graczyk, Robert</creator><creator>Lapidoth, Amos</creator><creator>Merhav, Neri</creator><creator>Pfister, Christoph</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-6422-1433</orcidid><orcidid>https://orcid.org/0000-0003-3761-3161</orcidid><orcidid>https://orcid.org/0000-0002-9547-3243</orcidid><orcidid>https://orcid.org/0000-0002-4742-5124</orcidid></search><sort><creationdate>20220701</creationdate><title>Guessing Based on Compressed Side Information</title><author>Graczyk, Robert ; Lapidoth, Amos ; Merhav, Neri ; Pfister, Christoph</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c159t-ff5aabdf5d8b369227dae8c8bc1228170e644c803ce8b0d68cb17c47377dae073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Accuracy</topic><topic>Compression</topic><topic>Correlation</topic><topic>Distortion</topic><topic>Entropy</topic><topic>guessing</topic><topic>helper</topic><topic>Information processing</topic><topic>Passwords</topic><topic>Rate-distortion</topic><topic>remote helper</topic><topic>Remote sensing</topic><topic>Security</topic><topic>side information</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Graczyk, Robert</creatorcontrib><creatorcontrib>Lapidoth, Amos</creatorcontrib><creatorcontrib>Merhav, Neri</creatorcontrib><creatorcontrib>Pfister, Christoph</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Graczyk, Robert</au><au>Lapidoth, Amos</au><au>Merhav, Neri</au><au>Pfister, Christoph</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Guessing Based on Compressed Side Information</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2022-07-01</date><risdate>2022</risdate><volume>68</volume><issue>7</issue><spage>4244</spage><epage>4256</epage><pages>4244-4256</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The tension between the description rate and the exponential growth rate of the power mean of the required number of guesses is quantified. This can be viewed as the guessing version of the classical indirect-rate-distortion problem of Dobrushin-Tsybakov'62 and Witsenhausen'80. Judicious choices of the correlated sequence, the description rate, and the fidelity criterion recover a number of recent and classical results on guessing. In the context of security, the paper provides conservative estimates on a password's remaining security after a number of bits from a correlated database have been leaked.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2022.3158475</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0001-6422-1433</orcidid><orcidid>https://orcid.org/0000-0003-3761-3161</orcidid><orcidid>https://orcid.org/0000-0002-9547-3243</orcidid><orcidid>https://orcid.org/0000-0002-4742-5124</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2022-07, Vol.68 (7), p.4244-4256 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TIT_2022_3158475 |
| source | IEEE Electronic Library (IEL) |
| subjects | Accuracy Compression Correlation Distortion Entropy guessing helper Information processing Passwords Rate-distortion remote helper Remote sensing Security side information |
| title | Guessing Based on Compressed Side Information |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T20%3A53%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Guessing%20Based%20on%20Compressed%20Side%20Information&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Graczyk,%20Robert&rft.date=2022-07-01&rft.volume=68&rft.issue=7&rft.spage=4244&rft.epage=4256&rft.pages=4244-4256&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2022.3158475&rft_dat=%3Cproquest_RIE%3E2677855802%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2677855802&rft_id=info:pmid/&rft_ieee_id=9733269&rfr_iscdi=true |