Towards Formal Verification in Cryptographic Web Applications
A Three Year Evolution Nadim Kobeissi
Towards Formal Verification in Cryptographic Web Applications A - - PowerPoint PPT Presentation
Towards Formal Verification in Cryptographic Web Applications A Three Year Evolution Nadim Kobeissi PROSECCO: Pro gramming Sec urely with C rypt o graphy. Team at INRIA Paris specializing in applied cryptography and formal verification.
A Three Year Evolution Nadim Kobeissi
Cryptography.
cryptography and formal verification.
cryptographic flaws occur across all the world’s important protocols.
flaws occurring again in the future, based on what we’ve learned.
chat with OTR (2011)
encrypted view into mobile device (2016)
(2017)
Signal Protocol
JavaScript (Antoine Delignat- Lavaud, 2014) into a full language: subset of JavaScript -> ProVerif
active attacker.
secret and Bob’s signed pre-key is compromised, attacker can impersonate Alice to Bob.
HMAC check.
ProVerif Trace: Capsule
improve upon the individual components?
HACL: a cryptographic library written in F*.
Low*: a subset
compile to C.
Kremlin: a Low* to C compiler.
Kremlin: now also a Low* to WASM compiler.
HACL-WASM!
Ed25519, Blake2b, etc.
and functional correctness properties.
most high-assurance cryptographic primitives for the web.
implementation from F*?
Cryptocat, Capsule.