| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Swierstra, Dr. W. | |
| dc.contributor.advisor | Cacciari Miraldo, V. | |
| dc.contributor.advisor | Van Oosten, Dr. J. | |
| dc.contributor.author | Golov, A.M. | |
| dc.date.accessioned | 2018-08-24T17:00:44Z | |
| dc.date.available | 2018-08-24T17:00:44Z | |
| dc.date.issued | 2018 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/30540 | |
| dc.description.abstract | The game-based style of proofs [BR06, Sho04] is often used in cryptography to prove properties of cryptographic primitives, such as the security of an encryption scheme. Given the importance of cryptography in the modern world, there is considerable value in being able to verify these proofs automatically. In this thesis, we develop a system for expressing proofs of this form in the Agda programming language. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 553386 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Formalisation of Cryptographic Proofs in Agda | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | agda, probability theory, cryptography, proof assistants, functional programming | |
| dc.subject.courseuu | Mathematical Sciences | |
