{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:13Z","timestamp":1773377533096,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174331","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"858-863","source":"Crossref","is-referenced-by-count":4,"title":["An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption"],"prefix":"10.1109","author":[{"given":"Ido","family":"Shahaf","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem"}]},{"given":"Or","family":"Ordentlich","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}]},{"given":"Gil","family":"Segev","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_16"},{"key":"ref10","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"ref8","first-page":"1","article-title":"Communication complexity of set-disjointness for all probabilities","volume":"12","author":"g\u00f6\u00f6s","year":"2016","journal-title":"Theory of Computing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/b17668"},{"key":"ref9","first-page":"368","article-title":"The information bottleneck method","author":"tishby","year":"1999","journal-title":"37th Annual Allerton Conference on Communications Control and Computing"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174331.pdf?arnumber=9174331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:17Z","timestamp":1773347657000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174331\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174331","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}