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. (2022). Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games. In 35th IEEE Computer Security Foundations Symposium. Peer reviewed |
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 |
JAMROGA, W., MESTEL, D., ROENNE, P., RYAN, P. Y. A., & SKROBOT, M. (2021). A Survey of Requirements for COVID-19 Mitigation Strategies. Bulletin of The Polish Academy of Sciences: Technical Science, 69 (4), 137724. doi:10.24425/bpasts.2021.137724 Peer reviewed |
MESTEL, D. (2020). Robust ambiguity for contact tracing. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/46252. |
JAMROGA, W., MESTEL, D., ROENNE, P., RYAN, P. Y. A., & SKROBOT, M. (2020). A Survey of Requirements for COVID-19 Mitigation Strategies. Part I: Newspaper Clips. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/46104. |
MESTEL, D. (2019). Quantifying information flow in interactive systems. In 2019 IEEE 32nd Computer Security Foundations Symposium (CSF). Peer reviewed |
MESTEL, D. (2019). Widths of regular and context-free languages. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. Peer reviewed |
ATASHPENDAR, A., MESTEL, D., Roscoe, A. W. B., & RYAN, P. (2018). A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/36637. |
ATASHPENDAR, A., Beunardeau, M., Connolly, A., Géraud, R., MESTEL, D., Roscoe, A. W. B., & RYAN, P. (2018). From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/36636. |