<?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-22T09:46:28Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/18554" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/18554</identifier><datestamp>2025-03-26T23:33:23Z</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">Gorbunov, Sergey</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="4b1e5619-9a14-45c7-8aa9-fe945796b267" confidence="600">Momeni, Peyman</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-08-17T13:50:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-08-17T13:50:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-08-17</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-08-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/18554</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">While blockchain systems are quickly gaining popularity, front-running remains a major obstacle to fair exchange. Front-running is a family of strategies in which a malicious party manipulates the order of transactions such that a transaction tx_2 which is broadcasted in time t_2 executes before the transaction of victim tx_1 which is broadcasted earlier in time t_1 (t_1 &amp;lt; t_2). In this thesis, we show how to apply Identity-Based Encryption (IBE) to prevent front-running with minimal bandwidth overheads. &#xd;
In our approach, to decrypt a block of N transactions, the number of messages sent across the network only grows linearly with the size of decrypting committees, S. That is, to decrypt a set of N transactions sequenced at a specific block, a committee only needs to exchange S decryption shares (independent of N). In comparison, previous solutions are based on threshold decryption schemes, where each transaction in a block must be decrypted separately by the committee, resulting in bandwidth overhead of N*S. Along the way, we present a model for fair block processing, explore technical challenges, and build prototype implementations. We show that on a sample of 1000 messages with 1000 validators our work saves 42.53 MB of bandwidth which is 99.6% less compared with the standard threshold decryption paradigm.</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/pememoni/FairBlock-SC</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">blockchain</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">identity-based encryption</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">threshold encryption</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">MEV</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">front-running</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">smart contracts</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">FairBlock: Preventing Blockchain Front-running with Minimal Overheads</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">Gorbunov, Sergey</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>