Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …

Legacy encryption systems depend on sharing a key (public or private) among the peers
involved in exchanging an encrypted message. However, this approach poses privacy …

Abstract The National Institute of Standards and Technology is in the process of selecting
one or more public-key cryptographic algorithms through a public, competition-like process …

Secure Multi-party Computation (MPC) allows a set of mutually distrusting parties to jointly
evaluate a function on their private inputs while maintaining input privacy. In this work, we …

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 …

The area of practical computational integrity proof systems, like SNARKs, STARKs,
Bulletproofs, is seeing a very dynamic development with several constructions having …

Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

Grover's search algorithm gives a quantum attack against block ciphers by searching for a
key that matches a small number of plaintext-ciphertext pairs. This attack uses O (N) O (N) …

We propose a new class of post-quantum digital signature schemes that:(a) derive their
security entirely from the security of symmetric-key primitives, believed to be quantum …

Zero-knowledge proofs of knowledge are useful tools to design signature schemes. The
ongoing effort to build a quantum computer urges the cryptography community to develop …