Compressing proofs of k-out-of-n partial knowledge

Autor: Thomas Attema, Ronald Cramer, Serge Fehr

Publikováno v: Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)
Advances in Cryptology – CRYPTO 2021
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2021

In a proof of partial knowledge, introduced by Cramer, Damgård and Schoenmakers (CRYPTO 1994), a prover knowing witnesses for some k-subset of n given public statements can convince the verifier of this claim without revealing which k-subset. Their

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f72d1c4b5001a0bb3c42cbfd6f727d
https://ir.cwi.nl/pub/31282

Compressed Σ-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures

Autor: Thomas Attema, Ronald Cramer, Matthieu Rambaud

Publikováno v: ASIACRYPT 2021
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2021
Lecture Notes in Computer Science ISBN: 9783030920678

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 generalized to work for bilinear group arithmetic circuits directly, i.e., without requi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4493ad6459311d9de0afdce15472dd30

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC

Autor: Ronald Cramer, Matthieu Rambaud, and Chaoping Xing

Publikováno v: CRYPTO 2021

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=r3c4b2081b22::892709deeb7995f4a00d2d856657484d

Blackbox secret sharing revisited: A coding-theoretic approach with application to expansionless near-threshold schemes

Autor: Chaoping Xing, Ronald Cramer

Publikováno v: Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part I
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457204
EUROCRYPT (1)

A blackbox secret sharing (BBSS) scheme works in exactly the same way for all finite Abelian groups G; it can be instantiated for any such group G and only black-box access to its group operations and to random group elements is required. A secret is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::853d1f6c03503561daf1d7fa7c4fad77
https://ir.cwi.nl/pub/30154

Compressed $$\varSigma $$-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics

Autor: Thomas Attema, Ronald Cramer

Publikováno v: Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568764
CRYPTO (3)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III

Σ-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 been proposed as a drop-in replacement in case of zero-knowledge (ZK) for arithmetic circuit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::288d9e81ec7fe7978f3e96d53145977c
https://doi.org/10.1007/978-3-030-56877-1_18