default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Klooß
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Michael Klooß, Russell W. F. Lai, Ngoc Khanh Nguyen, Michal Osadnik:
RoK, Paper, SISsors Toolkit for Lattice-Based Succinct Arguments - (Extended Abstract). ASIACRYPT (5) 2024: 203-235- [c12]Michael Klooß, Michael Reichle, Benedikt Wagner:
Practical Blind Signatures in Pairing-Free Groups. ASIACRYPT (1) 2024: 363-395 - [i19]Michael Klooß, Andy Rupp, Daniel Schadt, Thorsten Strufe, Christiane Weis:
EROR: Efficient Repliable Onion Routing with Strong Provable Privacy. IACR Cryptol. ePrint Arch. 2024: 20 (2024) - [i18]Michael Klooß, Michael Reichle, Benedikt Wagner:
Practical Blind Signatures in Pairing-Free Groups. IACR Cryptol. ePrint Arch. 2024: 1378 (2024) - [i17]Michael Klooß, Russell W. F. Lai, Ngoc Khanh Nguyen, Michal Osadnik:
RoK, Paper, SISsors - Toolkit for Lattice-based Succinct Arguments. IACR Cryptol. ePrint Arch. 2024: 1972 (2024) - [i16]Thomas Attema, Michael Klooß, Russell W. F. Lai, Pavlo Yatsyna:
Adaptive Special Soundness: Improved Knowledge Extraction by Adaptive Useful Challenge Sampling. IACR Cryptol. ePrint Arch. 2024: 2038 (2024) - [i15]Nicholas Brandt, Dennis Hofheinz, Michael Klooß, Michael Reichle:
Tightly-Secure Blind Signatures in Pairing-Free Groups. IACR Cryptol. ePrint Arch. 2024: 2075 (2024) - [i14]Michael Klooß, Michael Reichle:
Blind Signatures from Proofs of Inequality. IACR Cryptol. ePrint Arch. 2024: 2076 (2024) - 2023
- [b1]Michael Klooß:
On Efficient Zero-Knowledge Arguments. Karlsruhe Institute of Technology, Germany, 2023 - [j2]Thomas Attema
, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-Round Interactive Proofs (Extended Version). J. Cryptol. 36(4): 36 (2023) - [c11]Valerie Fetzer, Michael Klooß, Jörn Müller-Quade, Markus Raiber, Andy Rupp:
Universally Composable Auditable Surveillance. ASIACRYPT (2) 2023: 453-487 - [c10]Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) 2023: 581-615 - [c9]Robin Berger, Brandon Broadnax, Michael Klooß, Jeremias Mechler, Jörn Müller-Quade, Astrid Ottenhues, Markus Raiber:
Composable Long-Term Security with Rewinding. TCC (4) 2023: 510-541 - [i13]Robin Berger, Brandon Broadnax, Michael Klooß, Jeremias Mechler, Jörn Müller-Quade, Astrid Ottenhues, Markus Raiber:
Composable Long-Term Security with Rewinding. IACR Cryptol. ePrint Arch. 2023: 363 (2023) - [i12]Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. IACR Cryptol. ePrint Arch. 2023: 996 (2023) - [i11]Valerie Fetzer, Michael Klooß, Jörn Müller-Quade, Markus Raiber, Andy Rupp:
Universally Composable Auditable Surveillance. IACR Cryptol. ePrint Arch. 2023: 1343 (2023) - [i10]Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch:
The Fiat-Shamir Transformation of (Γ1,đots,Γμ)-Special-Sound Interactive Proofs. IACR Cryptol. ePrint Arch. 2023: 1945 (2023) - 2022
- [c8]Geoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael Reichle:
Sharp: Short Relaxed Range Proofs. CCS 2022: 609-622 - [c7]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-round Interactive Proofs. TCC (1) 2022: 113-142 - [i9]Geoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael Reichle:
Sharp: Short Relaxed Range Proofs. IACR Cryptol. ePrint Arch. 2022: 1153 (2022) - 2021
- [c6]Geoffroy Couteau, Michael Klooß, Huang Lin, Michael Reichle:
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. EUROCRYPT (3) 2021: 247-277 - [c5]Sebastian H. Faller, Pascal Baumer, Michael Klooß, Alexander Koch, Astrid Ottenhues, Markus Raiber:
Black-Box Accumulation Based on Lattices. IMACC 2021: 220-246 - [c4]Michael Klooß:
On Expected Polynomial Runtime in Cryptography. TCC (1) 2021: 558-590 - [i8]Geoffroy Couteau, Michael Klooß, Huang Lin, Michael Reichle:
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. IACR Cryptol. ePrint Arch. 2021: 540 (2021) - [i7]Sebastian H. Faller, Pascal Baumer, Michael Klooß, Alexander Koch, Astrid Ottenhues, Markus Raiber:
Black-Box Accumulation Based on Lattices. IACR Cryptol. ePrint Arch. 2021: 1303 (2021) - [i6]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-Round Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 1377 (2021) - 2020
- [j1]Max Hoffmann, Michael Klooß, Markus Raiber, Andy Rupp:
Black-Box Wallets: Fast Anonymous Two-Way Payments for Constrained Devices. Proc. Priv. Enhancing Technol. 2020(1): 165-194 (2020) - [i5]Michael Klooß:
On (expected polynomial) runtime in cryptography. IACR Cryptol. ePrint Arch. 2020: 809 (2020)
2010 – 2019
- 2019
- [c3]Max Hoffmann, Michael Klooß, Andy Rupp:
Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited. CCS 2019: 2093-2110 - [c2]Michael Klooß, Anja Lehmann, Andy Rupp:
(R)CCA Secure Updatable Encryption with Integrity Protection. EUROCRYPT (1) 2019: 68-99 - [i4]Michael Klooß, Anja Lehmann, Andy Rupp:
(R)CCA Secure Updatable Encryption with Integrity Protection. IACR Cryptol. ePrint Arch. 2019: 222 (2019) - [i3]Max Hoffmann, Michael Klooß, Andy Rupp:
Efficient zero-knowledge arguments in the discrete log setting, revisited. IACR Cryptol. ePrint Arch. 2019: 944 (2019) - [i2]Max Hoffmann, Michael Klooß, Markus Raiber, Andy Rupp:
Black-Box Wallets: Fast Anonymous Two-Way Payments for Constrained Devices. IACR Cryptol. ePrint Arch. 2019: 1199 (2019) - 2017
- [c1]Gottfried Herold, Max Hoffmann, Michael Klooß, Carla Ràfols, Andy Rupp:
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs. CCS 2017: 1547-1564 - [i1]Gottfried Herold, Max Hoffmann, Michael Klooß, Carla Ràfols, Andy Rupp:
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs. IACR Cryptol. ePrint Arch. 2017: 802 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-03 21:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
