<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T16:40:55Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/20441" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/20441</identifier><datestamp>2025-03-26T23:34:32Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Stebila, Douglas</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="f9ef8732-0db7-4b3b-9f59-b9461e3e0ead" confidence="600">Evans, Ross</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-04-15T19:34:34Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-04-15T19:34:34Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-04-15</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2024-04-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/20441</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Cryptographic proofs allow researchers to provide theoretical guarantees on the security&#xd;
that their constructions provide. A proof of security can completely eliminate a class of&#xd;
attacks by potential adversaries. Human fallibility, however, means that even a proof&#xd;
reviewed by experts may still hide flaws or outright errors. Proof assistants are software&#xd;
tools built for the purpose of formally verifying each step in a proof, and as such have the&#xd;
potential to prevent erroneous proofs from being published and insecure constructions from&#xd;
being implemented. Unfortunately, existing tooling for verifying cryptographic proofs has&#xd;
found limited adoption in the cryptographic community, in part due to concerns with ease&#xd;
of use.&#xd;
This thesis presents ProofFrog: a new tool for verifying cryptographic game-hopping&#xd;
proofs. ProofFrog is designed with the average cryptographer in mind, using an imperative&#xd;
syntax for specifying games and a syntax for proofs that closely models pen-and-paper&#xd;
arguments. As opposed to other proof assistant tools which largely operate by manipulating&#xd;
logical formulae, ProofFrog manipulates abstract syntax trees (ASTs) into a canonical form&#xd;
to establish indistinguishable or equivalent behaviour for pairs of games in a user-provided&#xd;
sequence. We detail the domain-specific language developed for use with the ProofFrog&#xd;
proof engine as well as present a sequence of worked examples that demonstrate ProofFrog’s&#xd;
capacity for verifying proofs and the exact transformations it applies to canonicalize ASTs.&#xd;
A tool like ProofFrog that prioritizes ease of use can lower the barrier of entry to using&#xd;
computer-verified proofs and aid in catching insecure constructions before they are made&#xd;
public.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="uri" lang="en">https://github.com/ProofFrog/ProofFrog</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="uri" lang="en">https://github.com/ProofFrog/examples</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">proof verification</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">game hopping</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">formal verification</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">proof assistants</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">state separating proofs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ProofFrog</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">ProofFrog: A Tool For Verifying Game-Hopping Proofs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Stebila, Douglas</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>