default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Reichle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c20]Rutchathon Chairattana-Apirom, Michael Reichle
, Stefano Tessaro:
Playing Tag with Okamoto-Schnorr: Three-Move Pairing-Free Blind Signatures from DDH. CRYPTO (7) 2026: 393-425- [c19]Michael Klooß, Russell W. F. Lai, Michael Reichle:
Blind Signatures from Arguments of Inequality. CRYPTO (7) 2026: 426-456 - [c18]Guilhem Niot, Michael Reichle, Kaoru Takemure:
Adaptively-Secure Three-Round Threshold Schnorr from DL. EUROCRYPT (1) 2026: 3-32 - [c17]Michael Reichle, Zoé Reinke:
Threshold Blind Signatures from CDH. PKC (1) 2026: 269-301 - [c16]Sebastian Faller, Guilhem Niot, Michael Reichle:
Lattice-Based Threshold Blind Signatures. SP 2026: 1273-1292 - [i23]Rutchathon Chairattana-Apirom, Michael Reichle, Stefano Tessaro:
Playing Tag with Okamoto-Schnorr: Three-Move Pairing-Free Blind Signatures from DDH. IACR Cryptol. ePrint Arch. 2026: 571 (2026) - [i22]Dennis Hofheinz, Michael Reichle, Benedikt Wagner:
Hint-Free Multi-Signatures. IACR Cryptol. ePrint Arch. 2026: 723 (2026) - 2025
- [c15]Nicholas Brandt, Dennis Hofheinz, Michael Klooß, Michael Reichle:
Tightly-Secure Blind Signatures in Pairing-Free Groups. ASIACRYPT (6) 2025: 337-369 - [c14]Michael Klooß, Michael Reichle:
Blind Signatures from Proofs of Inequality. CRYPTO (6) 2025: 157-189 - [c13]Rafaël Del Pino, Shuichi Katsumata, Guilhem Niot, Michael Reichle, Kaoru Takemure:
Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol. CRYPTO (6) 2025: 423-456 - [c12]Karen Azari, Cecilia Boschini, Kristina Hostáková, Michael Reichle:
Security Amplification of Threshold Signatures in the Standard Model. TCC (3) 2025: 201-234 - [i21]Rafaël Del Pino, Shuichi Katsumata, Guilhem Niot, Michael Reichle, Kaoru Takemure:
Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol. IACR Cryptol. ePrint Arch. 2025: 849 (2025) - [i20]Sebastian Faller, Guilhem Niot, Michael Reichle:
Lattice-based Threshold Blind Signatures. IACR Cryptol. ePrint Arch. 2025: 1566 (2025) - [i19]Francesca Falzon, Zichen Gui, Michael Reichle:
Page-efficient Encrypted Multi-Maps: New Techniques for Optimal Search Bandwidth. IACR Cryptol. ePrint Arch. 2025: 1621 (2025) - [i18]Karen Azari, Cecilia Boschini, Kristina Hostáková, Michael Reichle:
Security Amplification of Threshold Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2025: 1705 (2025) - [i17]Michael Reichle, Zoé Reinke:
Threshold Blind Signatures from CDH. IACR Cryptol. ePrint Arch. 2025: 1798 (2025) - [i16]Michael Klooß, Russell W. F. Lai, Michael Reichle:
Blind Signatures from Arguments of Inequality. IACR Cryptol. ePrint Arch. 2025: 1886 (2025) - [i15]Guilhem Niot, Michael Reichle, Kaoru Takemure:
Adaptively-Secure Three-Round Threshold Schnorr from DL. IACR Cryptol. ePrint Arch. 2025: 1941 (2025) - 2024
- [c11]Michael Klooß, Michael Reichle, Benedikt Wagner:
Practical Blind Signatures in Pairing-Free Groups. ASIACRYPT (1) 2024: 363-395 - [c10]Julia Kastner, Ky Nguyen, Michael Reichle:
Pairing-Free Blind Signatures from Standard Assumptions in the ROM. CRYPTO (1) 2024: 210-245 - [c9]Shuichi Katsumata, Michael Reichle, Kaoru Takemure:
Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding. CRYPTO (7) 2024: 459-491 - [c8]Shuichi Katsumata, Yi-Fu Lai, Michael Reichle:
Breaking Parallel ROS: Implication for Isogeny and Lattice-Based Blind Signatures. Public Key Cryptography (1) 2024: 319-351 - [i14]Shuichi Katsumata, Michael Reichle, Kaoru Takemure:
Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding. IACR Cryptol. ePrint Arch. 2024: 1033 (2024) - [i13]Michael Klooß, Michael Reichle, Benedikt Wagner:
Practical Blind Signatures in Pairing-Free Groups. IACR Cryptol. ePrint Arch. 2024: 1378 (2024) - [i12]Nicholas Brandt, Dennis Hofheinz, Michael Klooß, Michael Reichle:
Tightly-Secure Blind Signatures in Pairing-Free Groups. IACR Cryptol. ePrint Arch. 2024: 2075 (2024) - [i11]Michael Klooß, Michael Reichle:
Blind Signatures from Proofs of Inequality. IACR Cryptol. ePrint Arch. 2024: 2076 (2024) - 2023
- [b1]Michael Reichle:
Constructions of Advanced Cryptographic Primitives. (Constructions de Primitives Cryptographiques Avancées). École Normale Supérieure, Paris, France, 2023 - [c7]Brice Minaud, Michael Reichle:
Hermes: I/O-Efficient Forward-Secure Searchable Symmetric Encryption. ASIACRYPT (6) 2023: 263-294 - [c6]Shuichi Katsumata, Michael Reichle, Yusuke Sakai:
Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions. ASIACRYPT (2) 2023: 383-417 - [i10]Brice Minaud, Michael Reichle:
Hermes: I/O-Efficient Forward-Secure Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2023: 166 (2023) - [i9]Shuichi Katsumata, Michael Reichle, Yusuke Sakai:
Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions. IACR Cryptol. ePrint Arch. 2023: 1447 (2023) - [i8]Shuichi Katsumata, Yi-Fu Lai, Michael Reichle:
Breaking Parallel ROS: Implication for Isogeny and Lattice-based Blind Signatures. IACR Cryptol. ePrint Arch. 2023: 1603 (2023) - [i7]Julia Kastner, Ky Nguyen, Michael Reichle:
Pairing-Free Blind Signatures from Standard Assumptions in the ROM. IACR Cryptol. ePrint Arch. 2023: 1810 (2023) - 2022
- [c5]Geoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael Reichle:
Sharp: Short Relaxed Range Proofs. CCS 2022: 609-622 - [c4]Brice Minaud, Michael Reichle:
Dynamic Local Searchable Symmetric Encryption. CRYPTO (4) 2022: 91-120 - [i6]Brice Minaud, Michael Reichle:
Dynamic Local Searchable Symmetric Encryption. CoRR abs/2201.05006 (2022) - [i5]Brice Minaud, Michael Reichle:
Dynamic Local Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2022: 1013 (2022) - [i4]Geoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael Reichle:
Sharp: Short Relaxed Range Proofs. IACR Cryptol. ePrint Arch. 2022: 1153 (2022) - 2021
- [c3]Angèle Bossuat, Raphael Bost, Pierre-Alain Fouque, Brice Minaud, Michael Reichle:
SSE and SSD: Page-Efficient Searchable Symmetric Encryption. CRYPTO (3) 2021: 157-184 - [c2]Geoffroy Couteau, Michael Klooß, Huang Lin, Michael Reichle:
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. EUROCRYPT (3) 2021: 247-277 - [i3]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) - [i2]Angèle Bossuat, Raphael Bost, Pierre-Alain Fouque, Brice Minaud, Michael Reichle:
SSE and SSD: Page-Efficient Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2021: 716 (2021)
2010 – 2019
- 2019
- [c1]Geoffroy Couteau, Michael Reichle:
Non-interactive Keyed-Verification Anonymous Credentials. Public Key Cryptography (1) 2019: 66-96 - [i1]Geoffroy Couteau, Michael Reichle:
Non-Interactive Keyed-Verification Anonymous Credentials. IACR Cryptol. ePrint Arch. 2019: 117 (2019)
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 2026-08-18 23:17 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
