On the impossibility of algebraic NIZK in pairing-free groups
E Giunta - Annual International Cryptology Conference, 2023 - Springer
Abstract Non-Interactive Zero-Knowledge proofs (NIZK) allow a prover to convince a verifier
that a statement is true by sending only one message and without conveying any other …
that a statement is true by sending only one message and without conveying any other …
Efficient Succinct Zero-Knowledge Arguments in the CL Framework
A Beaugrand, G Castagnos, F Laguillaumie - Journal of Cryptology, 2025 - Springer
The CL cryptosystem, introduced by Castagnos and Laguillaumie in 2015, is a linearly
homomorphic encryption scheme that has seen numerous developments and applications …
homomorphic encryption scheme that has seen numerous developments and applications …
On Black-Box Knowledge-Sound Commit-And-Prove SNARKs
H Lipmaa - International Conference on the Theory and …, 2023 - Springer
Gentry and Wichs proved that adaptively sound SNARGs for hard languages need non-
falsifiable assumptions. Lipmaa and Pavlyk claimed Gentry-Wichs is tight by constructing a …
falsifiable assumptions. Lipmaa and Pavlyk claimed Gentry-Wichs is tight by constructing a …