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

Zero-knowledge (ZK) applications form a large group of use cases in modern cryptography,
and recently gained in popularity due to novel proof systems. For many of these …

While traditional symmetric algorithms like AES and SHA-3 are optimized for efficient
hardware and software implementations, a range of emerging applications using advanced …

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

The idea of hybrid homomorphic encryption (HHE) is to drastically reduce bandwidth
requirements when using homomorphic encryption (HE) at the cost of more expensive …

We propose a new hash function Reinforced Concrete, which is the first generic purpose
hash that is fast both for a zero-knowledge prover and in native x86 computations. It is …

Zero-knowledge proof systems for computational integrity have seen a rise in popularity in
the last couple of years. One of the results of this development is the ongoing effort in …

The Recent progress in practical applications of secure computation protocols has also
attracted attention to the symmetric-key primitives underlying them. Whereas traditional …

The security and performance of many integrity proof systems like SNARKs, STARKs and
Bulletproofs highly depend on the underlying hash function. For this reason several new …

Signature schemes based on the MPC-in-the-head approach (MPCitH) have either been
designed by taking a proof system and selecting a suitable symmetric-key primitive (Picnic …