A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “zero-knowledge proofs” 5

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

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

Thomas Attema, Ronald Cramer, Serge Fehr

42

citations
A Compressed $$\varSigma $$-Protocol Theory for Lattices
2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

Thomas Attema, Ronald Cramer, Lisa Kohl

75

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

Thomas Attema, Ronald Cramer, Matthieu Rambaud

0

citations
Online-Extractability in the Quantum Random-Oracle Model
2021 arXiv (Cornell University) preprint Computer Science Quantum Information and Cryptography Open access

Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner

3

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

Thomas Attema, Ronald Cramer, Matthieu Rambaud

24

citations

5 results