Dr Mukesh Tiwari

Lecturer, Computer Science

mukesh.tiwari@swansea.ac.uk

Office - 316
Third Floor
Computational Foundry
Bay Campus

Available For Postgraduate Supervision

Research Links

https://orcid.org/0000-0001-5373-9659

Google Scholar

Scopus

About

Mukesh Tiwari is a lecturer at the Department of Computer Science, Swansea University. The goal of his research is to ensure that correctness and security of software programs used in public domain using formal methods. His research focuses on proving the correctness of software programs, particularly used for a very high-stake situations involving common citizens, e.g., vote counting software for a legally binding elections to a public office, data processing software for sensitive data, cryptographic software used in elections, etc. Mainly, he uses the Coq theorem prover to implement software programs and prove them correct. In addition, he is also very passionate about teaching formal verification.

Feel free to get in touch with him if you have any research project related to theorem proving, particularly if it involves Coq.

Areas Of Expertise

Cryptography
Electronic Voting
Interactive Theorem Proving (Coq Theorem Prover)
Software Security
Cyber Security
Social Choice Theory

Career Highlights

Teaching Interests

Cryptography
Theorem Proving
Formal Verification

Publications

Research Highlights

Murray, T., Tiwari, M., Ernst, G., & Naumann, D. (2023). Assume but Verify: Deductive Verification of Leaked Information in Concurrent Applications. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications SecurityACM.
https://doi.org/10.1145/3576915.3623141, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65925
Haines, T., Goré, R., & Tiwari, M. (2023). Machine-checking multi-round proofs of shuffle: Terelius-Wikstrom and Bayer-Groth. In SEC '23: Proceedings of the 32nd USENIX Conference on Security SymposiumACM.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65926
https://dl.acm.org/doi/10.5555/3620237.3620599
Kobeissi, N., Nicolas, G., & Tiwari, M. (2020). Verifpal: Cryptographic Protocol Analysis for the Real World. In Progress in Cryptology – INDOCRYPT 2020 (pp. 151-202). Springer International Publishing.
https://doi.org/10.1007/978-3-030-65277-7_8, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66140
Pattinson, D. & Tiwari, M. (2017). Schulze Voting as Evidence Carrying Computation. In Interactive Theorem Proving (pp. 410-426). Springer International Publishing.
https://doi.org/10.1007/978-3-319-66107-0_26, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66142
Moses, L., Goré, R., Levy, R., Pattinson, D., & Tiwari, M. (2017). No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes. In Electronic Voting (pp. 66-83). Springer International Publishing.
https://doi.org/10.1007/978-3-319-68687-5_5, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66143

All Research

Conference Contributions

Murray, T., Tiwari, M., Ernst, G., & Naumann, D. (2023). Assume but Verify: Deductive Verification of Leaked Information in Concurrent Applications. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications SecurityACM.
https://doi.org/10.1145/3576915.3623141, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65925
Haines, T., Goré, R., & Tiwari, M. (2023). Machine-checking multi-round proofs of shuffle: Terelius-Wikstrom and Bayer-Groth. In SEC '23: Proceedings of the 32nd USENIX Conference on Security SymposiumACM.
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65926
https://dl.acm.org/doi/10.5555/3620237.3620599
Kobeissi, N., Nicolas, G., & Tiwari, M. (2020). Verifpal: Cryptographic Protocol Analysis for the Real World. In Progress in Cryptology – INDOCRYPT 2020 (pp. 151-202). Springer International Publishing.
https://doi.org/10.1007/978-3-030-65277-7_8, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66140
Moses, L., Goré, R., Levy, R., Pattinson, D., & Tiwari, M. (2017). No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes. In Electronic Voting (pp. 66-83). Springer International Publishing.
https://doi.org/10.1007/978-3-319-68687-5_5, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66143
Pattinson, D. & Tiwari, M. (2017). Schulze Voting as Evidence Carrying Computation. In Interactive Theorem Proving (pp. 410-426). Springer International Publishing.
https://doi.org/10.1007/978-3-319-66107-0_26, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66142