{"month":"05","date_created":"2018-12-11T12:02:09Z","citation":{"apa":"Pietrzak, K. Z. (2009). A leakage resilient mode of operation (Vol. 5479, pp. 462–482). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-01001-9_27\">https://doi.org/10.1007/978-3-642-01001-9_27</a>","chicago":"Pietrzak, Krzysztof Z. “A Leakage Resilient Mode of Operation,” 5479:462–82. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-01001-9_27\">https://doi.org/10.1007/978-3-642-01001-9_27</a>.","ista":"Pietrzak KZ. 2009. A leakage resilient mode of operation. CRYPTO: International Cryptology Conference, LNCS, vol. 5479, 462–482.","ieee":"K. Z. Pietrzak, “A leakage resilient mode of operation,” presented at the CRYPTO: International Cryptology Conference, 2009, vol. 5479, pp. 462–482.","short":"K.Z. Pietrzak, in:, Springer, 2009, pp. 462–482.","ama":"Pietrzak KZ. A leakage resilient mode of operation. In: Vol 5479. Springer; 2009:462-482. doi:<a href=\"https://doi.org/10.1007/978-3-642-01001-9_27\">10.1007/978-3-642-01001-9_27</a>","mla":"Pietrzak, Krzysztof Z. <i>A Leakage Resilient Mode of Operation</i>. Vol. 5479, Springer, 2009, pp. 462–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-01001-9_27\">10.1007/978-3-642-01001-9_27</a>."},"day":"28","year":"2009","publisher":"Springer","status":"public","page":"462 - 482","date_published":"2009-05-28T00:00:00Z","extern":1,"type":"conference","publist_id":"3448","date_updated":"2021-01-12T07:41:59Z","volume":5479,"intvolume":"      5479","quality_controlled":0,"title":"A leakage resilient mode of operation","alternative_title":["LNCS"],"_id":"3232","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Krzysztof Pietrzak"}],"conference":{"name":"CRYPTO: International Cryptology Conference"},"doi":"10.1007/978-3-642-01001-9_27","abstract":[{"lang":"eng","text":"A weak pseudorandom function (wPRF) is a cryptographic primitive similar to - but weaker than - a pseudorandom function: for wPRFs one only requires that the output is pseudorandom when queried on random inputs.We show that unlike &quot;normal&quot; PRFs, wPRFs are seedincompressible, in the sense that the output of a wPRF is pseudorandom even if a bounded amount of information about the key is leaked. As an application of this result we construct a simple mode of operation which - when instantiated with any wPRF - gives a leakage-resilient stream-cipher. The implementation of such a cipher is secure against every side-channel attack, as long as the amount of information leaked per round is bounded, but overall can be arbitrary large. The construction is simpler than the previous one (Dziembowski-Pietrzak FOCS'08) as it only uses a single primitive (a wPRF) in a straight forward manner. "}],"publication_status":"published"}