A Compressed -Protocol Theory for Lattices
We show a lattice-based solution for commit-and-prove transparent circuit zero-knowledge
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
Compressed-protocol theory and practical application to plug & play secure algorithmics
T Attema, R Cramer - Annual International Cryptology Conference, 2020 - Springer
Abstract\varSigma-Protocols provide a well-understood basis for secure algorithmics.
Recently, Bulletproofs (Bootle et al., EUROCRYPT 2016, and Bünz et al., S&P 2018) have …
Recently, Bulletproofs (Bootle et al., EUROCRYPT 2016, and Bünz et al., S&P 2018) have …
Sumcheck arguments and their applications
We introduce a class of interactive protocols, which we call sumcheck arguments, that
establishes a novel connection between the sumcheck protocol (Lund et al. JACM 1992) …
establishes a novel connection between the sumcheck protocol (Lund et al. JACM 1992) …
Parallel Repetition of -Special-Sound Multi-round Interactive Proofs
In many occasions, the knowledge error κ of an interactive proof is not small enough, and
thus needs to be reduced. This can be done generically by repeating the interactive proof in …
thus needs to be reduced. This can be done generically by repeating the interactive proof in …
Compressed -Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
T Attema, R Cramer, M Rambaud - … on the Theory and Application of …, 2021 - Springer
Abstract Lai et al.(CCS 2019) have shown how Bulletproof's arithmetic circuit zero-
knowledge protocol (Bootle et al., EUROCRYPT 2016 and Bünz et al., S&P 2018) can be …
knowledge protocol (Bootle et al., EUROCRYPT 2016 and Bünz et al., S&P 2018) can be …
End-to-End Secure Messaging with Traceability Only for Illegal Content
As end-to-end encrypted messaging services become widely adopted, law enforcement
agencies have increasingly expressed concern that such services interfere with their ability …
agencies have increasingly expressed concern that such services interfere with their ability …
SMART credentials in the multi-queue of slackness (or Secure management of anonymous reputation traits without global halting)
Anonymous credentials encourage online communication without fear of surveillance, but
may invite misbehavior like hate speech. Previous updatable anonymous credentials keep a …
may invite misbehavior like hate speech. Previous updatable anonymous credentials keep a …
Muxproofs: Succinct arguments for machine computation from tuple lookups
Proofs for machine computation allow for proving the correct execution of arbitrary programs
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
Stacking Sigmas: A Framework to Compose -Protocols for Disjunctions
Abstract Zero-Knowledge (ZK) Proofs for disjunctive statements have been a focus of a long
line of research. Classical results such as Cramer et al.[CRYPTO'94] and Abe et al.[AC'02] …
line of research. Classical results such as Cramer et al.[CRYPTO'94] and Abe et al.[AC'02] …
Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
A Goel, M Hall-Andersen, G Kaptchuk… - … Conference on the Theory …, 2023 - Springer
Building on recent compilers for efficient disjunctive composition (eg an OR of multiple
clauses) of zero-knowledge proofs (eg Goel et al.[EUROCRYPT'22]) we propose a new …
clauses) of zero-knowledge proofs (eg Goel et al.[EUROCRYPT'22]) we propose a new …