{"issue":"Part 1","date_created":"2018-12-11T12:02:12Z","conference":{"name":"ICALP: Automata, Languages and Programming"},"page":"391 - 402","doi":"10.1007/978-3-642-22006-7_33","status":"public","day":"01","alternative_title":["LNCS"],"publication_status":"published","month":"01","date_updated":"2021-01-12T07:42:02Z","title":"Tamper proof circuits How to trade leakage for tamper resilience","publisher":"Springer","extern":1,"date_published":"2011-01-01T00:00:00Z","year":"2011","quality_controlled":0,"volume":"6755 ","type":"conference","_id":"3239","citation":{"short":"S. Faust, K.Z. Pietrzak, D. Venturi, in:, Springer, 2011, pp. 391–402.","mla":"Faust, Sebastian, et al. <i>Tamper Proof Circuits How to Trade Leakage for Tamper Resilience</i>. Vol. 6755, no. Part 1, Springer, 2011, pp. 391–402, doi:<a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">10.1007/978-3-642-22006-7_33</a>.","ama":"Faust S, Pietrzak KZ, Venturi D. Tamper proof circuits How to trade leakage for tamper resilience. In: Vol 6755. Springer; 2011:391-402. doi:<a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">10.1007/978-3-642-22006-7_33</a>","ieee":"S. Faust, K. Z. Pietrzak, and D. Venturi, “Tamper proof circuits How to trade leakage for tamper resilience,” presented at the ICALP: Automata, Languages and Programming, 2011, vol. 6755, no. Part 1, pp. 391–402.","ista":"Faust S, Pietrzak KZ, Venturi D. 2011. Tamper proof circuits How to trade leakage for tamper resilience. ICALP: Automata, Languages and Programming, LNCS, vol. 6755, 391–402.","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Daniele Venturi. “Tamper Proof Circuits How to Trade Leakage for Tamper Resilience,” 6755:391–402. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">https://doi.org/10.1007/978-3-642-22006-7_33</a>.","apa":"Faust, S., Pietrzak, K. Z., &#38; Venturi, D. (2011). Tamper proof circuits How to trade leakage for tamper resilience (Vol. 6755, pp. 391–402). Presented at the ICALP: Automata, Languages and Programming, Springer. <a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">https://doi.org/10.1007/978-3-642-22006-7_33</a>"},"publist_id":"3441","author":[{"first_name":"Sebastian","last_name":"Faust","full_name":"Faust, Sebastian"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"first_name":"Daniele","full_name":"Venturi, Daniele","last_name":"Venturi"}],"abstract":[{"text":"Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that the tampered device will reveal secret information. Inspired by the work of Ishai et al. [Eurocrypt'06], we propose a compiler that transforms any circuit into a new circuit with the same functionality, but which is resilient against a well-defined and powerful tampering adversary. More concretely, our transformed circuits remain secure even if the adversary can adaptively tamper with every wire in the circuit as long as the tampering fails with some probability δ&gt;0. This additional requirement is motivated by practical tampering attacks, where it is often difficult to guarantee the success of a specific attack. Formally, we show that a q-query tampering attack against the transformed circuit can be &quot;simulated&quot; with only black-box access to the original circuit and log(q) bits of additional auxiliary information. Thus, if the implemented cryptographic scheme is secure against log(q) bits of leakage, then our implementation is tamper-proof in the above sense. Surprisingly, allowing for this small amount of information leakage allows for much more efficient compilers, which moreover do not require randomness during evaluation. Similar to earlier works our compiler requires small, stateless and computation-independent tamper-proof gadgets. Thus, our result can be interpreted as reducing the problem of shielding arbitrary complex computation to protecting simple components. © 2011 Springer-Verlag.","lang":"eng"}]}