The most compact quantum-safe proof systems for large circuits are PCP-type systems such
as Ligero, Aurora, and Shockwave, that only use weak cryptographic assumptions, namely …

Recent works on lattice-based extractable polynomial commitments can be grouped into two
classes:(i) non-interactive constructions that stem from the functional commitment by …

Polynomial commitment is a crucial cryptographic primitive in constructing zkSNARKs. Most
practical constructions to date are either vulnerable against quantum adversaries or lack …

Several prior works have suggested to use non-interactive arguments of knowledge with
short proofs to aggregate signatures of Falcon, which is part of the first post-quantum …

Polynomial commitments schemes are a powerful tool that enables one party to commit to a
polynomial p of degree d, and prove that the committed function evaluates to a certain value …

Despite the great potential and flexibility of smart contract-enabled blockchains, building
privacy-preserving applications using these platforms remains an open question. Existing …

Succinct arguments that rely on the Merkle-tree paradigm introduced by Kilian (STOC 92)
suffer from larger proof sizes in practice due to the use of generic cryptographic primitives. In …

We show that for x← $[0, 2 λ) μ and any integer N the probability that f (x)≡ 0 mod N for any
non-zero multilinear polynomial f∈ Z [X 1,⋯, X μ], co-prime to N is inversely proportional to …

Abstract A Single Secret Leader Election (SSLE) enables a group of parties to randomly
choose exactly one leader from the group with the restriction that the identity of the leader …

We show that for $\mathbf {x}\gets [0, 2^\lambda)^\mu $ and any integer $ N $ the probability
that $ f (\mathbf {x})\equiv 0\bmod N $ for any non-zero multilinear polynomial $ f\in\mathbb …