A Aralex Aachen research explorer

January 01, 1998 conference-paper

Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?

Lecture notes in computer science

DOI: 10.1007/bfb0055745 OpenAlex

Authors 0

Author list not loaded yet.

Cited by 5 stored of 160

The Fiat—Shamir Transformation of $$(\varGamma _1,\dots ,\varGamma _\mu )$$-Special-Sound Interactive Proofs
2026 Journal of Cryptology article Computer Science Cryptography and Data Security Open access

0

citations
Vector Commitments over Rings and Compressed $$\varSigma $$-Protocols
2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

11

citations
Compressing Proofs of k-Out-Of-n Partial Knowledge
2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

42

citations
Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

24

citations
Compressed Sigma-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
2021 TNO Repository conference-paper Computer Science Cryptography and Data Security

0

citations

5 results

References 0