ProVerif is an automatic symbolic protocol verifier. It supports a wide range of cryptographic
primitives, defined by rewrite rules or by equations. It can prove various security properties …

TLS 1.3 is the next version of the Transport Layer Security (TLS) protocol. Its clean-slate
design is a reaction both to the increasing demand for low-latency HTTPS connections and …

Differential power analysis (DPA) is a side-channel attack in which an adversary retrieves
cryptographic material by measuring and analyzing the power consumption of the device on …

The first edition of this book was published in 2003. Inevitably, certain parts of the book
became outdated quickly. At the same time new developments have continued apace …

In this paper, we study the problem of automatically verifying higher-order masking
countermeasures. This problem is important in practice, since weaknesses have been …

As zero-knowledge proofs gain increasing adoption, the cryptography community has
designed domain-specific languages (DSLs) that facilitate the construction of zero …

We develop a new approach for building cryptographic implementations. Our approach
goes the last mile and delivers assembly code that is provably functionally correct, protected …

We have proved, with machine-checked proofs in Coq, that an OpenSSL implementation of
HMAC with SHA-256 correctly implements its FIPS functional specification and that its …

We formalize the theory of quantum Hoare logic (QHL)[TOPLAS 33 (6), 19], an extension of
Hoare logic for reasoning about quantum programs. In particular, we formalize the syntax …

Verified Textbook Algorithms | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …