We introduce SPHINCS+, a stateless hash-based signature framework. SPHINCS+ has
significant advantages over the state of the art in terms of speed, signature size, and …

Designing an efficient cipher was always a delicate balance between linear and non-linear
operations. This goes back to the design of DES, and in fact all the way back to the seminal …

In typical applications of homomorphic encryption, the first step consists for Alice of
encrypting some plaintext m under Bob's public key pk pk and of sending the ciphertext c …

Symmetric ciphers purposed for Fully Homomorphic Encryption (FHE) have recently been
proposed for two main reasons. First, minimizing the implementation (time and memory) …

Motivated by new applications such as secure Multi-Party Computation (MPC), Fully
Homomorphic Encryption (FHE), and Zero-Knowledge proofs (ZK), the need for symmetric …

Mobile messengers like WhatsApp perform contact discovery by uploading the user's entire
address book to the service provider. This allows the service provider to determine which of …

Keyed and unkeyed cryptographic permutations often iterate simple round functions.
Substitution-permutation networks (SPNs) are an approach that is popular since the mid …

Private set intersection (PSI) is a cryptographic technique that is applicable to many privacy-
sensitive scenarios. For decades, researchers have been focusing on improving its …

Recent developments in multi party computation (MPC) and fully homomorphic encryption
(FHE) promoted the design and analysis of symmetric cryptographic schemes that minimize …

A transciphering framework converts a symmetric ciphertext into a homomorphic ciphertext
on the server-side, reducing computational and communication overload on the client-side …