Find results with:

Add another field

Search by date

to

Searching collections:

Dartmouth Dissertations

Add or remove collections

Home Dartmouth Dissertations infeld2016 1

Reference URL

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Uniform avoidance coupling, design of anonymity systems and matching theory / by Ewa Joanna Infeld

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Author	Infeld, Ewa Joanna
Title	Uniform avoidance coupling, design of anonymity systems and matching theory / by Ewa Joanna Infeld
Date	2016
Abstract	We start by introducing avoidance coupling of Markov chains, with an overview of existing results. We then introduce and motivate a new notion, uniform coupling. We show that the only Markovian avoidance coupling on a cycle is of this type, and that uniform avoidance coupling of simple random walks is impossible on trees, and prove that it is possible on several classes of graphs. We also derive a condition on the vertex neighborhoods in a graph equivalent to that graph admitting a uniform avoidance coupling of simple random walks, and an algorithm that tests this with run time polynomial in the number of vertices. We then discuss a conjecture that no Markovian avoidance coupling can be possible on a tree and propose how a proof might proceed. In the second half of this work, we talk about the design of online communication systems that aim to guarantee anonymity for their users. A popular paradigm is k-anonymity. We notice that the scarcity of a typical social relation makes k-anonymity vulnerable to traffic analysis, and propose a way to use this scarcity to reduce the efficiency cost to exactly the amount of cover traffic we might need. Then we use Brègman's theorem to show that for a given infrastructure cost, modelled by the number of edges in a bipartite graph, k-anonymity offers the highest number of possible perfect matchings between users and observed behaviors.
Description	1 online resource (vi, 112 leaves) : illustrations (some color)
Format	application/pdf
College	Dartmouth College -- Department of Mathematics.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D)--Dartmouth College.
Copyright	Made available by the author under a Creative Commons Attribution-NonCommercial License.; Made available by the Trustees of Dartmouth College under a Creative Commons Attribution-NonCommercial License. https://creativecommons.org/licenses/by-nc/4.0/
DOI	https://doi.org/10.1349/ddlp.2158

Find results with:

Searching collections:

Home Dartmouth Dissertations infeld2016 1

Uniform avoidance coupling, design of anonymity systems and matching theory / by Ewa Joanna Infeld

Object Description

Description

Uniform avoidance coupling, design of anonymity systems...

Uniform avoidance coupling, design of anonymity systems...

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12