default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Müller 0001
Person information
- affiliation: University of Luxembourg, Interdisciplinary Centre for Security, Reliability and Trust, Luxembourg
- affiliation: University of Trier, Germany
Other persons with the same name
- Johannes Müller (aka: Johannes Mueller) — disambiguation page
- Johannes Müller 0002 — University of Applied Sciences Bonn-Rhein-Sieg, Germany
- Johannes Müller 0003
![[0000-0001-9286-0937]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9286-0937")
— Ulm University, Germany - Johannes Müller 0004 — Munich University of Technology, Germany
- Johannes Müller 0005 — University of Auckland, Department of Computer Science, New Zealand
- Johannes Müller 0006 (aka: Johannes Mueller 0006) — TU Kaiserslautern, Germany
Other persons with a similar name
- Johannes-Christian Müller
- Johannes C. Müller
- Johannes K. M. Müller
- Sebastian Johannes Müller
- Johannes Müller-Lancé — Universität Mannheim, Germany
- Johannes Müller-Salo
- Johannes Müller-Trede
- Johannes Karl Martin Mueller
- Johannes Sebastian Mueller-Roemer (aka: Johannes Mueller-Roemer) — TU Darmstadt, Germany
- Johannes Muller
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[c16]Thomas Haines, Rafieh Mosaheb, Johannes Müller, Reetika:
Zero-Knowledge Proofs from Learning Parity with Noise: Optimization, Verification, and Application. CSF 2025: 441-456- 2024
- [j5]Nouri Alnahawi, Johannes Müller, Jan Oupický, Alexander Wiesmaier:
A Comprehensive Survey on Post-Quantum TLS. IACR Commun. Cryptol. 1(2): 6 (2024) - [j4]Johannes Müller, Balázs Pejó, Ivan Pryvalov:
DeVoS: Deniable Yet Verifiable Vote Updating. Proc. Priv. Enhancing Technol. 2024(1): 357-378 (2024) - [j3]Johannes Müller, Jan Oupický:
Post-quantum XML and SAML Single Sign-On. Proc. Priv. Enhancing Technol. 2024(4): 525-543 (2024) - [i17]Johannes Müller, Jan Oupický:
Post-quantum XML and SAML Single Sign-On. IACR Cryptol. ePrint Arch. 2024: 828 (2024) - 2023
- [j2]David Mestel, Johannes Müller, Pascal Reisert:
How efficient are replay attacks against vote privacy? A formal quantitative analysis. J. Comput. Secur. 31(5): 421-467 (2023) - [j1]Thomas Haines, Rafieh Mosaheb, Johannes Müller, Ivan Pryvalov:
SoK: Secure E-Voting with Everlasting Privacy. Proc. Priv. Enhancing Technol. 2023(1): 279-293 (2023) - [c15]Johannes Müller, Tomasz Truderung:
CAISED: A Protocol for Cast-as-Intended Verifiability with a Second Device. E-Vote-ID 2023: 123-139 - [c14]Thomas Haines, Johannes Müller, Iñigo Querejeta-Azurmendi:
Scalable Coercion-Resistant E-Voting under Weaker Trust Assumptions. SAC 2023: 1576-1584 - [i16]Johannes Müller, Tomasz Truderung:
A Protocol for Cast-as-Intended Verifiability with a Second Device. CoRR abs/2304.09456 (2023) - [i15]Johannes Mueller, Balazs Pejo, Ivan Pryvalov:
DeVoS: Deniable Yet Verifiable Vote Updating. IACR Cryptol. ePrint Arch. 2023: 1616 (2023) - [i14]Nouri Alnahawi, Johannes Müller, Jan Oupický, Alexander Wiesmaier:
SoK: Post-Quantum TLS Handshake. IACR Cryptol. ePrint Arch. 2023: 1873 (2023) - 2022
- [c13]Kristian Gjøsteen, Thomas Haines, Johannes Müller, Peter B. Rønne, Tjerand Silde:
Verifiable Decryption in the Head. ACISP 2022: 355-374 - [c12]Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, Andreas Vogt:
Kryvos: Publicly Tally-Hiding Verifiable E-Voting. CCS 2022: 1443-1457 - [c11]David Mestel, Johannes Müller, Pascal Reisert:
How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. CSF 2022: 179-194 - [c10]Johannes Müller:
Breaking and Fixing Vote Privacy of the Estonian E-Voting Protocol IVXV. Financial Cryptography Workshops 2022: 325-334 - [i13]David Mestel, Johannes Müller, Pascal Reisert:
How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. IACR Cryptol. ePrint Arch. 2022: 743 (2022) - [i12]Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, Andreas Vogt:
Kryvos: Publicly Tally-Hiding Verifiable E-Voting. IACR Cryptol. ePrint Arch. 2022: 1132 (2022) - 2021
- [c9]Thomas Haines, Johannes Müller:
Optimal Randomized Partial Checking for Decryption Mix Nets. ACISP 2021: 277-292 - [c8]Thomas Haines, Johannes Müller:
A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose. ACISP 2021: 293-308 - [c7]Xavier Boyen, Thomas Haines, Johannes Müller:
Epoque: Practical End-to-End Verifiable Post-Quantum-Secure E-Voting. EuroS&P 2021: 272-291 - [i11]Xavier Boyen, Thomas Haines, Johannes Müller:
Epoque: Practical End-to-End Verifiable Post-Quantum-Secure E-Voting. IACR Cryptol. ePrint Arch. 2021: 304 (2021) - [i10]Thomas Haines, Johannes Müller:
Optimal Randomized Partial Checking for Decryption Mix Nets. IACR Cryptol. ePrint Arch. 2021: 520 (2021) - [i9]Kristian Gjøsteen, Thomas Haines, Johannes Müller, Peter B. Rønne, Tjerand Silde:
Verifiable Decryption in the Head. IACR Cryptol. ePrint Arch. 2021: 558 (2021) - [i8]Thomas Haines, Johannes Müller:
A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose. IACR Cryptol. ePrint Arch. 2021: 588 (2021) - 2020
- [c6]Thomas Haines, Johannes Müller:
SoK: Techniques for Verifiable Mix Nets. CSF 2020: 49-64 - [c5]Xavier Boyen, Thomas Haines, Johannes Müller:
A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing. ESORICS (2) 2020: 336-356 - [c4]Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, Andreas Vogt:
Ordinos: A Verifiable Tally-Hiding E-Voting System. EuroS&P 2020: 216-235 - [i7]Xavier Boyen, Thomas Haines, Johannes Müller:
A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing. IACR Cryptol. ePrint Arch. 2020: 115 (2020) - [i6]Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, Andreas Vogt:
Ordinos: A Verifiable Tally-Hiding E-Voting System. IACR Cryptol. ePrint Arch. 2020: 405 (2020) - [i5]Thomas Haines, Johannes Müller:
SoK: Techniques for Verifiable Mix Nets. IACR Cryptol. ePrint Arch. 2020: 490 (2020) - [i4]Jintai Ding, Doug Emery, Johannes Müller, Peter Y. A. Ryan, Vonn Kee Wong:
Post-Quantum Anonymous Veto Networks. IACR Cryptol. ePrint Arch. 2020: 1023 (2020) - [i3]Johannes Müller:
How not to VoteAgain: Pitfalls of Scalable Coercion-Resistant E-Voting. IACR Cryptol. ePrint Arch. 2020: 1406 (2020)
2010 – 2019
- 2017
- [c3]Ralf Küsters, Johannes Müller:
Cryptographic Security Analysis of E-voting Systems: Achievements, Misconceptions, and Limitations. E-VOTE-ID 2017: 21-41 - 2016
- [c2]Ralf Küsters, Johannes Müller, Enrico Scapin, Tomasz Truderung:
sElect: A Lightweight Verifiable Remote Voting System. CSF 2016: 341-354 - [c1]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
SoK: Verifiability Notions for E-Voting Protocols. IEEE Symposium on Security and Privacy 2016: 779-798 - [i2]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
Verifiability Notions for E-Voting Protocols. IACR Cryptol. ePrint Arch. 2016: 287 (2016) - [i1]Ralf Küsters, Johannes Müller, Enrico Scapin, Tomasz Truderung:
sElect: A Lightweight Verifiable Remote Voting System. IACR Cryptol. ePrint Arch. 2016: 438 (2016)
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-07-04 01:16 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.
