[PDF][PDF] Batch proofs are statistically hiding
N Bitansky, C Kamath, O Paneth… - Proceedings of the 56th …, 2024 - dl.acm.org
Batch proofs are proof systems that convince a verifier that x 1,…, xt∈ L, for some NP
language L, with communication that is much shorter than sending the t witnesses. In the …
language L, with communication that is much shorter than sending the t witnesses. In the …
Mutable batch arguments and applications
R Goyal - Cryptology ePrint Archive, 2024 - eprint.iacr.org
Non-interactive batch arguments (BARGs) let a prover compute a single proof $\pi $ proving
validity of abatch'of $ k $$\mathbf {NP} $ statements $ x_1,\ldots, x_ {k} $. The two central …
validity of abatch'of $ k $$\mathbf {NP} $ statements $ x_1,\ldots, x_ {k} $. The two central …
[PDF][PDF] A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors
B Waters - Proceedings of the 56th Annual ACM Symposium on …, 2024 - dl.acm.org
We put forward a new approach for achieving non-interactive zero-knowledge proofs
(NIKZs) from the learning with errors (LWE) assumption (with subexponential modulus to …
(NIKZs) from the learning with errors (LWE) assumption (with subexponential modulus to …
Leveled Fully-Homomorphic Signatures from Batch Arguments
Fully homomorphic signatures are a significant strengthening of digital signatures, enabling
computations on\emph {secretly} signed data. Today, we have multiple approaches to …
computations on\emph {secretly} signed data. Today, we have multiple approaches to …