FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2981409726> ?p ?o ?g. }

• W2981409726 endingPage "2365" @default.
• W2981409726 startingPage "2349" @default.
• W2981409726 abstract "Previous chapter Next chapter Full AccessProceedings Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA)Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy ChannelsT-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, and Elaine ShiT-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, and Elaine Shipp.2349 - 2365Chapter DOI:https://doi.org/10.1137/1.9781611975994.144PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract We revisit the problem of low-memory robust simulation of interactive protocols over noisy channels. Haeupler [FOCS 2014] considered robust simulation of two-party interactive protocols over oblivious, as well as adaptive, noisy channels. Since the simulation does not need to have fixed communication pattern, the achieved communication rates can circumvent the lower bound proved by Kol and Raz [STOC 2013]. However, a drawback of this approach is that each party needs to remember the whole history of the simulated transcript. In a subsequent manuscript, Haeupler and Resch considered low-memory simulation. The idea was to view the original protocol as a computational DAG and only the identities of the nodes are saved (as opposed to the whole transcript history) for backtracking to reduce memory usage. In this paper, we consider low-memory robust simulation of more general client-server interactive protocols, in which a leader communicates with other members/servers, who do not communicate among themselves; this setting can be applied to information-theoretic multi-server Private Information Retrieval (PIR) schemes. We propose an information-theoretic technique that converts any correct PIR protocol that assumes reliable channels, into a protocol which is both correct and private in the presence of a noisy channel while keeping the space complexity to a minimum. Despite the huge attention that PIR protocols have received in the literature, the existing works assume that the parties communicate using noiseless channels. Moreover, we observe that the approach of Haeupler and Resch to just save the nodes in the aforementioned DAG without taking the transcript history into account will lead to a correctness issue even for oblivious corruptions. We resolve this issue by saving hashes of prefixes of past transcripts. Departing from the DAG representation also allows us to accommodate scenarios where a party can simulate its part of the protocol without any extra knowledge (such as the DAG representation of the whole protocol). In the the two-party setting, our simulation has the same dependence on the error rate as in the work of Haeupler, and in the client-server setting it also depends on the number of servers. Furthermore, since our approach does not remember the complete transcript history, our current technique can defend only against oblivious corruptions. Previous chapter Next chapter RelatedDetails Published:2020eISBN:978-1-61197-599-4 https://doi.org/10.1137/1.9781611975994Book Series Name:ProceedingsBook Code:PRDA20Book Pages:xxii + 3011" @default.
• W2981409726 created "2019-11-01" @default.
• W2981409726 creator A5018708584 @default.
• W2981409726 creator A5030114656 @default.
• W2981409726 creator A5030500341 @default.
• W2981409726 creator A5089202539 @default.
• W2981409726 date "2020-01-01" @default.
• W2981409726 modified "2023-10-16" @default.
• W2981409726 title "Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels" @default.
• W2981409726 cites W1593123147 @default.
• W2981409726 cites W1606480398 @default.
• W2981409726 cites W1634257591 @default.
• W2981409726 cites W2003497308 @default.
• W2981409726 cites W2011900268 @default.
• W2981409726 cites W2014860393 @default.
• W2981409726 cites W2019807548 @default.
• W2981409726 cites W2026670837 @default.
• W2981409726 cites W2042587503 @default.
• W2981409726 cites W2072979474 @default.
• W2981409726 cites W2073346043 @default.
• W2981409726 cites W2077242989 @default.
• W2981409726 cites W2098243718 @default.
• W2981409726 cites W2115551261 @default.
• W2981409726 cites W2117696850 @default.
• W2981409726 cites W2123903520 @default.
• W2981409726 cites W2126420649 @default.
• W2981409726 cites W2142812941 @default.
• W2981409726 cites W2202879065 @default.
• W2981409726 cites W2216201412 @default.
• W2981409726 cites W2407991844 @default.
• W2981409726 cites W2497735908 @default.
• W2981409726 cites W2772918851 @default.
• W2981409726 cites W2778211317 @default.
• W2981409726 cites W2804279469 @default.
• W2981409726 cites W2963060525 @default.
• W2981409726 cites W2964292074 @default.
• W2981409726 cites W2963895596 @default.
• W2981409726 doi "https://doi.org/10.1137/1.9781611975994.144" @default.
• W2981409726 hasPublicationYear "2020" @default.
• W2981409726 type Work @default.
• W2981409726 sameAs 2981409726 @default.
• W2981409726 citedByCount "0" @default.
• W2981409726 crossrefType "book-chapter" @default.
• W2981409726 hasAuthorship W2981409726A5018708584 @default.
• W2981409726 hasAuthorship W2981409726A5030114656 @default.
• W2981409726 hasAuthorship W2981409726A5030500341 @default.
• W2981409726 hasAuthorship W2981409726A5089202539 @default.
• W2981409726 hasBestOaLocation W29814097262 @default.
• W2981409726 hasConcept C120314980 @default.
• W2981409726 hasConcept C142724271 @default.
• W2981409726 hasConcept C204787440 @default.
• W2981409726 hasConcept C2780385302 @default.
• W2981409726 hasConcept C31258907 @default.
• W2981409726 hasConcept C41008148 @default.
• W2981409726 hasConcept C71924100 @default.
• W2981409726 hasConcept C80444323 @default.
• W2981409726 hasConcept C93996380 @default.
• W2981409726 hasConceptScore W2981409726C120314980 @default.
• W2981409726 hasConceptScore W2981409726C142724271 @default.
• W2981409726 hasConceptScore W2981409726C204787440 @default.
• W2981409726 hasConceptScore W2981409726C2780385302 @default.
• W2981409726 hasConceptScore W2981409726C31258907 @default.
• W2981409726 hasConceptScore W2981409726C41008148 @default.
• W2981409726 hasConceptScore W2981409726C71924100 @default.
• W2981409726 hasConceptScore W2981409726C80444323 @default.
• W2981409726 hasConceptScore W2981409726C93996380 @default.
• W2981409726 hasLocation W29814097261 @default.
• W2981409726 hasLocation W29814097262 @default.
• W2981409726 hasOpenAccess W2981409726 @default.
• W2981409726 hasPrimaryLocation W29814097261 @default.
• W2981409726 hasRelatedWork W1500064003 @default.
• W2981409726 hasRelatedWork W1547841080 @default.
• W2981409726 hasRelatedWork W1556909862 @default.
• W2981409726 hasRelatedWork W1583717361 @default.
• W2981409726 hasRelatedWork W1587227328 @default.
• W2981409726 hasRelatedWork W1701020922 @default.
• W2981409726 hasRelatedWork W2118449739 @default.
• W2981409726 hasRelatedWork W2130966263 @default.
• W2981409726 hasRelatedWork W2371023786 @default.
• W2981409726 hasRelatedWork W2998813341 @default.
• W2981409726 isParatext "false" @default.
• W2981409726 isRetracted "false" @default.
• W2981409726 magId "2981409726" @default.
• W2981409726 workType "book-chapter" @default.