<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>On treewidth, separators and Yao&apos;s garbling</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Chethan</namePart>
  <namePart type="family">Kamath Hosdurg</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">4BD3F30E-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0009-0006-6812-7317</description></name>
<name type="personal">
  <namePart type="given">Karen</namePart>
  <namePart type="family">Klein</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3E83A2F8-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Krzysztof Z</namePart>
  <namePart type="family">Pietrzak</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3E04A7AA-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-9139-1654</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">KrPi</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>TCC: Theory of Cryptography Conference</namePart>
</name>



<name type="corporate">
  <namePart>Teaching Old Crypto New Tricks</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.</abstract>

<originInfo><publisher>International Association for Cryptologic Research</publisher><dateIssued encoding="w3cdtf">2021</dateIssued><place><placeTerm type="text">Raleigh, NC, United States</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>19th Theory of Cryptography Conference 2021</title></titleInfo>
<part>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/10409</url>     <url>https://research-explorer.ista.ac.at/record/10035</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<ieee>C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in &lt;i&gt;19th Theory of Cryptography Conference 2021&lt;/i&gt;, Raleigh, NC, United States, 2021.</ieee>
<short>C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.</short>
<ama>Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: &lt;i&gt;19th Theory of Cryptography Conference 2021&lt;/i&gt;. International Association for Cryptologic Research; 2021.</ama>
<ista>Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.</ista>
<apa>Kamath Hosdurg, C., Klein, K., &amp;#38; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In &lt;i&gt;19th Theory of Cryptography Conference 2021&lt;/i&gt;. Raleigh, NC, United States: International Association for Cryptologic Research.</apa>
<chicago>Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In &lt;i&gt;19th Theory of Cryptography Conference 2021&lt;/i&gt;. International Association for Cryptologic Research, 2021.</chicago>
<mla>Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” &lt;i&gt;19th Theory of Cryptography Conference 2021&lt;/i&gt;, 2021/926, International Association for Cryptologic Research, 2021.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>10044</recordIdentifier><recordCreationDate encoding="w3cdtf">2021-09-24T12:01:34Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-06T13:15:57Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
