challenges in leakage resilient symmetric cryptography
play

Challenges in Leakage-Resilient Symmetric Cryptography Krzysztof - PowerPoint PPT Presentation

Challenges in Leakage-Resilient Symmetric Cryptography Krzysztof Pietrzak ECRYPT II Workshop on Physical Attacks, Graz, November 28, 2012 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography Krzysztof Pietrzak Challenges


  1. Challenges in Leakage-Resilient Symmetric Cryptography Krzysztof Pietrzak ECRYPT II Workshop on Physical Attacks, Graz, November 28, 2012 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  2. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  3. Provable Security Define “Breaking the Cryptosystem”. 1 Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  4. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures key Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  5. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures key Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  6. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures key Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  7. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures key Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  8. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures key Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  9. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures key Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  10. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures ? ? key breaks scheme if ? ? is a valid signature for a new message. Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  11. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures ? ? key breaks scheme if ? ? is a valid signature for a new message. Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Theorem No efficient adversary who breaks the scheme exists Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  12. Provable Security Define “Breaking the Cryptosystem”. 1 Example: Digital Signatures ? ? key breaks scheme if ? ? is a valid signature for a new message. Construct Cryptosystem. 2 Prove Cryptosystem Secure. 3 Theorem No efficient adversary who breaks the scheme exists if (factoring, SVP,. . . ) is hard. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  13. Provably secure cryptosystems get broken in practice. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  14. Provably secure cryptosystems get broken in practice. Problem: adversaries outside the anticipated model. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  15. Provably secure cryptosystems get broken in practice. Problem: adversaries outside the anticipated model. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  16. Black-Box Security Models vs. Reality key Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  17. Black-Box Security Models vs. Reality key Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  18. Black-Box Security Models vs. Reality key Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  19. Black-Box Security Models vs. Reality key E.g. can measure time to compute . Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  20. Black-Box Security Models vs. Reality key E.g. can measure time to compute . breaks RSA on smart cards [Kocher’95] Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  21. Black-Box Security Models vs. Reality key E.g. can measure time to compute . breaks RSA on smart cards [Kocher’95] Side-Channel Attack: Cryptanalytic attack exploring information leaked from a physical implementation of a cryptosystem. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  22. power analysis probing attacks cold-boot attacks cache attacks radiation, sound, heat,. . . Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  23. power analysis [Eisenbarth et al. CRYPTO’08] break wireless car keys probing attacks cold-boot attacks [Halderman et al. USENIX’08] break disc-encryption schemes cache attacks [Ristenpart et al. CCS’09] break cloud computing radiation, sound, heat,. . . Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  24. The Rise of Side-Channel Attacks Became major threat in the last few decades. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  25. The Rise of Side-Channel Attacks Became major threat in the last few decades. Ubiquitous computing: Light-weight crypto-devices are susceptible to side-channel attacks. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  26. The Rise of Side-Channel Attacks Became major threat in the last few decades. Ubiquitous computing: Light-weight crypto-devices are susceptible to side-channel attacks. Provable security: Side-channels became the weakest link. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  27. Side-channels are a physical phenomenon, how could theoretical cryptography be of help? Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  28. Side-channels are a physical phenomenon, how could theoretical cryptography be of help? Reductions in the context of side-channel attacks [MicRey’04] Construct schemes that remain provably secure in the presence of leakage. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  29. Leakage models: one-time vs. continuous key one-time f key continuous Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  30. Leakage models: one-time vs. continuous key one-time f ( key ) key continuous Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  31. Leakage models: one-time vs. continuous key one-time key continuous Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  32. Leakage models: one-time vs. continuous key one-time key continuous Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  33. Leakage models: one-time vs. continuous key one-time key continuous f 1 , Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  34. Leakage models: one-time vs. continuous key one-time key continuous f 1 ( key , coins ) , Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  35. Leakage models: one-time vs. continuous key one-time key continuous f 2 , Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  36. Leakage models: one-time vs. continuous key one-time key continuous f 2 ( key , coins ) , Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  37. Leakage models: one-time vs. continuous key one-time key continuous f 2 ( key , coins ) , Most side-channels like timing,power,. . . are continuous. Notable exception cold-boot. Security against continuous leakage is much harder to achieve. E.g. requires key-refreshing. Intermediate “Floppy model”. Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  38. Leakage models: dedicated vs. general dedicated leakage functions f models a particular side-channel timing: Make running time independent of input. probing: Private Circuits ([Ishai,Sahai,Wagner Crypto’03]) Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  39. Leakage models: dedicated vs. general dedicated leakage functions f models a particular side-channel timing: Make running time independent of input. probing: Private Circuits ([Ishai,Sahai,Wagner Crypto’03]) general leakage functions bounded: f ( key ) has length ℓ ≪ | key | bits. entropic: Entropy of key decreases by at most ℓ given f ( key ). auxiliary input: Computationally hard to compute key given f ( key ). Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

  40. One-Time Bounded/Entropic leakage key ∈ { 0 , 1 } n . Adv choses f and gets f ( key ). Bounded leakage: f must satisfy | f ( key ) | = ℓ ≪ n . 1 Entropic leakage: f must satisfy H ∞ ( key | f ( key )) ≥ n − ℓ . 2 Maurer’s bounded storage model, privacy amplification,. . . Intrusion resilience [Dzi’06,CDDLLW’07,. . . ] (symmetric) Memory attacks [AGV’09,NaoSeg’09,. . . ] (public-key) Krzysztof Pietrzak Challenges in Leakage-ResilientSymmetric Cryptography

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend