Efficient Interactive Coding against Adversarial Noise

In this work, we study the problem of constructing interactive protocols that are robust to noise, a problem that was originally considered in the seminal works of Schulman (FOCS '92, STOC '93), and has recently regained popularity. Robust interactive communication is the interactive analo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2012 IEEE 53rd Annual Symposium on Foundations of Computer Science s. 160 - 166
Hlavní autori: Brakerski, Z., Kalai, Y. T.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.10.2012
Predmet:
Computational complexity
Error analysis
Noise
Protocols
Robustness
Synchronization
ISBN:1467343838, 9781467343831
ISSN:0272-5428
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this work, we study the problem of constructing interactive protocols that are robust to noise, a problem that was originally considered in the seminal works of Schulman (FOCS '92, STOC '93), and has recently regained popularity. Robust interactive communication is the interactive analogue of error correcting codes: Given an interactive protocol which is designed to run on an error-free channel, construct a protocol that evaluates the same function (or, more generally, simulates the execution of the original protocol) over a noisy channel. As in (non-interactive) error correcting codes, the noise can be either stochastic, i.e. drawn from some distribution, or adversarial, i.e. arbitrary subject only to a global bound on the number of errors. We show how to efficiently simulate any interactive protocol in the presence of constant-rate adversarial noise, while incurring only a constant blow-up in the communication complexity (CC). Our simulator is randomized, and succeeds in simulating the original protocol with probability at least 1 - 2 -Ω(CC) .
AbstractList In this work, we study the problem of constructing interactive protocols that are robust to noise, a problem that was originally considered in the seminal works of Schulman (FOCS '92, STOC '93), and has recently regained popularity. Robust interactive communication is the interactive analogue of error correcting codes: Given an interactive protocol which is designed to run on an error-free channel, construct a protocol that evaluates the same function (or, more generally, simulates the execution of the original protocol) over a noisy channel. As in (non-interactive) error correcting codes, the noise can be either stochastic, i.e. drawn from some distribution, or adversarial, i.e. arbitrary subject only to a global bound on the number of errors. We show how to efficiently simulate any interactive protocol in the presence of constant-rate adversarial noise, while incurring only a constant blow-up in the communication complexity (CC). Our simulator is randomized, and succeeds in simulating the original protocol with probability at least 1 - 2 -Ω(CC) .
Author Brakerski, Z.
Kalai, Y. T.
Author_xml – sequence: 1
  givenname: Z.
  surname: Brakerski
  fullname: Brakerski, Z.
  email: zvika@stanford.edu
– sequence: 2
  givenname: Y. T.
  surname: Kalai
  fullname: Kalai, Y. T.
  email: yael@microsoft.com
BookMark eNotzM1Kw0AUQOERK9jW7Ny5yQsk3pk7mZ9lCa0Wil2o63KbuVNGaiKZUPDtFRQOfLuzELN-6FmIewm1lOAfN_v2tVYgVa3UlSi8dWCNb7Sz2lyLhdTGokaHbibmoKyqGq3crShy_gAACdiA83Nh1jGmLnE_ldt-4pG6KV24bIeQ-lNJJ0p9nspVuPCYaUx0Ll-GlPlO3EQ6Zy7-XYr3zfqtfa52-6dtu9pVSdpmqmLA6ILXmtCHYCOpqLRxzDo2kmIgxKO1PiARHX8zLNnYzgMDdJ2SuBQPf9_EzIevMX3S-H0waBvlEX8Aj7NKqQ
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/FOCS.2012.22
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISBN 9780769548746
0769548741
EndPage 166
ExternalDocumentID 6375293
Genre orig-research
GroupedDBID -~X
23M
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACNCT
ADZIZ
AFFNX
AI.
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IPLJI
OCL
RIE
RIL
RIO
RNS
VH1
ID FETCH-LOGICAL-i175t-fd3f8d944a39dd7fa2f2468ee4f51afda33b779d3aaabaab6e1e67c90e00cc213
IEDL.DBID RIE
ISBN 1467343838
9781467343831
ISICitedReferencesCount 47
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000316999700018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0272-5428
IngestDate Wed Aug 27 03:35:34 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-fd3f8d944a39dd7fa2f2468ee4f51afda33b779d3aaabaab6e1e67c90e00cc213
PageCount 7
ParticipantIDs ieee_primary_6375293
PublicationCentury 2000
PublicationDate 2012-Oct.
PublicationDateYYYYMMDD 2012-10-01
PublicationDate_xml – month: 10
  year: 2012
  text: 2012-Oct.
PublicationDecade 2010
PublicationTitle 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
PublicationTitleAbbrev SFCS
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001035089
ssj0040503
Score 1.6826619
Snippet In this work, we study the problem of constructing interactive protocols that are robust to noise, a problem that was originally considered in the seminal...
SourceID ieee
SourceType Publisher
StartPage 160
SubjectTerms Computational complexity
Error analysis
Noise
Protocols
Robustness
Synchronization
Title Efficient Interactive Coding against Adversarial Noise
URI https://ieeexplore.ieee.org/document/6375293
WOSCitedRecordID wos000316999700018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07b8IwED4B6tAufUDVtzJ0bCCJHTuZEahLKVJbiQ2dY7vKQioC_f34HBo6dKnkwbbkKH6edf7u-wAetdWZwlSEOlVRyK0SYSaYy_G0cNYltjxRXmxCzmbZYpHPO_DUxsIYYzz4zAwp69_ydVVsyVU2Ekym7gNd6Eopmlitgz-FnsiIOb05hTnxnHj_iiSu_yTzQV1CMqLmzH64nvbluEXE56Pp6_iNEF_JkPR0fymueIMzPf3fr57B4BC5F8xbm3QOHbO6gJOXlpu17oOYeNYI1zzw7kD0J14wrqhFgJ9Yuhtj4IWaa6TlGcyqsjYD-JhO3sfP4V49ISzdlWATWs1spnPOkeVaS4uJTbjIjOE2jdFqZExJmWuGiMolYWIjZJFHJoqKIonZJfRW1cpcQUBYNkzdTicueikkWuWsvMkVCdUnAq-hTyOw_GoIMpb7zt_8XX0LxzS-DSLuDnqb9dbcw1HxvSnr9YOf1R36Zpu5
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9BNFEvfoDx2x08OmBr165nAsEIk0RMuJFubc0uzDDw77evw-HBi0kPbZMu6-drXn_v9wN4VEbFqYyYr6K051OTMj9mxOZolFnrEhgapk5sgidJPJ-LaQOe6lgYrbUDn-kOZt1bviqyDbrKuozwyH5gD_ZROUtU0Vo7jwo-kiF3enUOU2Q6cR4Wjmz_YezCuhgnSM4Z_7A9bctBjYkX3eFr_w0xX2EHFXV_aa44kzM8-d_PnkJ7F7vnTWurdAYNvTyH40nNzlq2gA0cb4Rt7jmHoHRnntcvsIUnP2Ru74yek2ouJS5QLynyUrfhfTiY9Uf-Vj_Bz-2lYO0bRUysBKWSCKW4kaEJKYu1piYKpFGSkJRzoYiUMrWJ6UAznome7vWyLAzIBTSXxVJfgodoNhnZvY5s9JxxaVJr57VIUao-ZPIKWjgCi8-KImOx7fz139UPcDiaTcaL8XPycgNHONYVPu4WmuvVRt_BQfa1zsvVvZvhb1wonwg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+IEEE+53rd+Annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=Efficient+Interactive+Coding+against+Adversarial+Noise&rft.au=Brakerski%2C+Z.&rft.au=Kalai%2C+Y.+T.&rft.date=2012-10-01&rft.pub=IEEE&rft.isbn=9781467343831&rft.issn=0272-5428&rft.spage=160&rft.epage=166&rft_id=info:doi/10.1109%2FFOCS.2012.22&rft.externalDocID=6375293
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0272-5428&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0272-5428&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0272-5428&client=summon