From

Institution

Field

Type

Topic: Cryptography and Data Security ×

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

Reset

Papers matching “zero-knowledge proofs” in Cryptography and Data Security 13

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
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

Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch

0

citations
The Fiat–Shamir Transformation of (Γ1, . . . , Γµ)-Special-Sound Interactive Proofs
2025 Zenodo (CERN European Organization for Nuclear Research) preprint Computer Science Cryptography and Data Security Open access

Thomas Attema, Serge Feh, Michael Klooß, Nicolas Resch

0

citations
Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version)
2023 Journal of Cryptology article Computer Science Cryptography and Data Security Open access

Thomas Attema, Serge Fehr, Michael Klooß

15

citations
Practical Product Proofs for Lattice Commitments
2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

Thomas Attema, Vadim Lyubashevsky, Gregor Seiler

60

citations
Fiat-Shamir Transformation of Multi-round Interactive Proofs
2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

Thomas Attema, Serge Fehr, Michael Klooß

56

citations
Compressed $$\varSigma $$-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics
2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

Thomas Attema, Ronald Cramer

73

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

74

citations
Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM
2022 arXiv (Cornell University) preprint Computer Science Cryptography and Data Security Open access

Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner

0

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
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

Léo Ducas, Wessel van Woerden

67

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
Tighter Quantum Security for Fiat-Shamir-with-Aborts and Hash-and-Sign-with-Retry Signatures
2026 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

S. (Serge) Fehr, Y.H. (Yu-Hsuan) Huang

0

citations

13 results