<?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:33:37Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3058" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3058</identifier><datestamp>2017-03-21T19:10:14Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</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="author" authority="5ff22bea-7b2b-4805-abf2-f796c0f9ad3c" confidence="600">Mandal, Avradip</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-18T19:30:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-18T19:30:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-05-18T19:30:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007-05-17</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3058</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We provide a simple and improved security analysis of PMAC, a&#xd;
Parallelizable MAC (Message Authentication Code) defined over&#xd;
arbitrary messages. A similar kind of result was shown by Bellare,&#xd;
Pietrzak and Rogaway at Crypto 2005, where they have provided an&#xd;
improved bound for CBC (Cipher Block Chaining) MAC, which was&#xd;
introduced by Bellare, Killan and Rogaway at Crypto 1994. Our&#xd;
analysis idea is much more simpler to understand and is borrowed&#xd;
from the work by Nandi for proving Indistinguishability at&#xd;
Indocrypt 2005 and work by Bernstein. It shows that the advantage&#xd;
for any distinguishing attack for n-bit PMAC based on a random&#xd;
function is bounded by O(σq / 2^n), where&#xd;
σ is the total number of blocks in all q queries made by&#xd;
the attacker. In the original paper by Black and Rogaway at&#xd;
Eurocrypt 2002 where PMAC was introduced, the bound is&#xd;
O(σ^2 / 2^n).&#xd;
&#xd;
We also compute the collision probability of CBC MAC for suitably&#xd;
chosen messages. We show that the probability is Ω( lq^2 / N) where l is the number of message blocks, N is the&#xd;
size of the domain and q is the total number of queries. For&#xd;
random oracles the probability is O(q^2 / N). This improved&#xd;
collision probability will help us to have an efficient&#xd;
distinguishing attack and MAC-forgery attack. We also show that the&#xd;
collision probability for PMAC is Ω(q^2 / N) (strictly greater&#xd;
than the birthday bound). We have used a purely combinatorial&#xd;
approach to obtain this bound. Similar analysis can be made for&#xd;
other CBC MAC extensions like XCBC, TMAC and OMAC.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">826520 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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="subject" lang="en">Cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">MAC</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Security</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Distinguishing Attack</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">MAC Constructions: Security Bounds and Distinguishing Attacks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</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>