RedShift: Transparent SNARKs from List Polynomial Commitments

Assimakis A. Kattis, Konstantin Panarin, Alexander Vlasov. RedShift: Transparent SNARKs from List Polynomial Commitments. In Heng Yin, Angelos Stavrou, Cas Cremers, Elaine Shi, editors, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022. pages 1725-1737, ACM, 2022. [doi]

Abstract

Abstract is missing.