Back
  1. Home
  2. Profile of Johannes MUELLER (Unilu)
Profil

MUELLER Johannes

University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA

ORCID
0000-0003-2134-3099
Main Referenced Co-authors
Haines, Thomas (7)
Reisert, Pascal (3)
Boyen, Xavier (2)
MESTEL, David  (2)
Balazs Pejo (1)
Main Referenced Keywords
Coercion-resistance (1); Electronic Voting (1); electronic voting (1); electronic voting, everlasting privacy, verifiability, receipt-freeness, participation privacy (1); everlasting privacy (1);
Main Referenced Unit & Research Centers
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > APSIA - Applied Security and Information Assurance (3)
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA) (1)
Main Referenced Disciplines
Computer science (15)

Publications (total 15)

The most downloaded
342 downloads
Haines, T., Mueller, J., Mosaheb, R., & Pryvalov, I. (2023). SoK: Secure E-Voting with Everlasting Privacy. In Proceedings on Privacy Enhancing Technologies (PoPETs). https://hdl.handle.net/10993/52132

The most cited

15 citations (Scopus®)

Mueller, J. (2020). Ordinos: A Verifiable Tally-Hiding E-Voting System. In R. Küsters, J. Liedtke, J. Mueller, D. Rausch, ... A. Vogt, IEEE European Symposium on Security and Privacy. doi:10.1109/EuroSP48549.2020.00022 https://hdl.handle.net/10993/45019

MUELLER, J., Ivan Pryvalov, & Balazs Pejo. (2024). DeVoS: Deniable Yet Verifiable Vote Updating. Proceedings on Privacy Enhancing Technologies, 2024 (1).
Peer Reviewed verified by ORBi

Haines, T., Mueller, J., Mosaheb, R., & Pryvalov, I. (2023). SoK: Secure E-Voting with Everlasting Privacy. In Proceedings on Privacy Enhancing Technologies (PoPETs).
Peer reviewed

Haines, T., Mueller, J., & Querejeta-Azurmendi, I. (2023). Scalable Coercion-Resistant E-Voting under Weaker Trust Assumptions. Proceedings of ACM SAC Conference (SAC'23).
Peer reviewed

Mestel, D., Mueller, J., & Reisert, P. (2023). How Efficient Are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. Journal of Computer Security. doi:10.3233/JCS-230047
Peer Reviewed verified by ORBi

Mestel, D., Mueller, J., & Reisert, P. (2022). How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. In 35th IEEE Computer Security Foundations Symposium.
Peer reviewed

Mueller, J. (2022). Breaking and Fixing Vote Privacy of the Estonian E-Voting Protocol IVXV. In Workshop on Advances in Secure Electronic Voting 2022.
Peer reviewed

Gjosteen, K., Haines, T., Mueller, J., Roenne, P., & Silde, T. (2022). Verifiable Decryption in the Head. In ACISP 2022.
Peer reviewed

Huber, N., Kuesters, R., Krips, T., Liedtke, J., Mueller, J., Rausch, D., Reisert, P., & Vogt, A. (2022). Kryvos: Publicly Tally-Hiding Verifiable E-Voting. In 2022 ACM SIGSAC Conference on Computer and Communications Security.
Peer reviewed

Haines, T., & Mueller, J. (2021). A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose. In Information Security and Privacy - 26th Australasian Conference, ACISP 2021, Virtual Event, December 1-3, 2021, Proceedings.
Peer reviewed

Haines, T., & Mueller, J. (2021). Optimal Randomized Partial Checking for Decryption Mix Nets. In Information Security and Privacy - 26th Australasian Conference, ACISP 2021, Virtual Event, December 1-3, 2021, Proceedings.
Peer reviewed

Boyen, X., Haines, T., & Mueller, J. (2021). Epoque: Practical End-to-End Verifiable Post-Quantum-Secure E-Voting. In IEEE European Symposium on Security and Privacy, EuroS&P 2021, Vienna, Austria, September 6-10, 2021.
Peer reviewed

Ding, J., Emery, D., Mueller, J., Ryan, P. Y. A., & Kee Wong, V. (2020). Post-Quantum Anonymous Veto Networks. In E-Vote-ID 2020.
Peer reviewed

Mueller, J. (2020). Ordinos: A Verifiable Tally-Hiding E-Voting System. In R. Küsters, J. Liedtke, J. Mueller, D. Rausch, ... A. Vogt, IEEE European Symposium on Security and Privacy. doi:10.1109/EuroSP48549.2020.00022
Peer reviewed

Mueller, J. (2020). SoK: Techniques for Verifiable Mix Nets. In T. Haines & J. Mueller, IEEE Computer Security Foundations Symposium. doi:10.1109/CSF49147.2020.00012
Peer reviewed

Boyen, X., Haines, T., & Mueller, J. (2020). A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing. In Computer Security - ESORICS 2020 - 25th European Symposium on Research in Computer Security, ESORICS 2020, Guildford, UK, September 14-18, 2020, Proceedings, Part II. doi:10.1007/978-3-030-59013-0_17
Peer reviewed

Contact ORBilu