In a seminal work, Micali (FOCS 1994) gave the first succinct non-interactive argument
(SNARG) in the random oracle model (ROM). The construction combines a PCP and a …

The rising popularity of computational integrity protocols has led to an increased focus on
efficient domain-specific hash functions, which are one of the core components in these use …

We present Testudo, a new FFT-less SNARK with a near linear-time prover, constant-time
verifier, constant-size proofs and a square-root-size universal setup. Testudo is based on a …

Cryptographic implementations deployed in real world devices often aim at (provable)
security against the powerful class of side-channel attacks while keeping reasonable …

The field of information security deals with methods and mechanisms to protect sensitive
information. Some of these methods and mechanisms deal with the problem of main taining …

The sum-check protocol of Lund, Fortnow, Karloff, and Nisan underlies SNARKs with the
fastest known prover. In many of its applications, the prover can be implemented with a …

In this paper, we investigate the hardware implementation of SKINNY and Romulus. In
Section 2, we explore the implementation of Romulus-M, the nonce misuse-resistant variant …

We propose SublonK---a new succinct non-interactive argument of knowledge (SNARK).
SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …

Masking is an effective countermeasure against side-channel attacks. In this paper, we
improve the efficiency of the high-order masking of look-up tables countermeasure …