P2P MIXING AND UNLINKABLE BITCOIN TRANSACTIONS

Download here : P2P Mixing and Unlinkable Bitcoin Transactions

Source : https://eprint.iacr.org/2016/824.pdf

Extract from Abstract

Starting   with   Dining   Cryptographers   networks (DC-net),  several  peer-to-peer  (P2P)  anonymous  communication protocols  have  been  proposed. Despite  their  strong  anonymity guarantees   none   of   those   has   been employed   in   practice   so far:  Most  fail  to  simultaneously  handle  the  crucial  problems of  slot  collisions  and  malicious  peers,  while  the  remaining  ones handle those with a significant increased latency (communication rounds)  linear  in  the  number  of  participating  peers  in  the  best case,  and quadratic in  the  worst  case.  We  conceptualize  these P2P  anonymous  communication  protocols  as P2P  mixing ,  and present a novel P2P mixing protocol, DiceMix, that only requires constant  (i.e.,  four)  communication  rounds  in  the  best  case,  and 4 + 2 rounds  in  the  worst  case  of malicious  peers.  As  every individual malicious peer can prevent a protocol run from success by  omitting  his  messages,  we  find  DiceMix  with  its  worst-case linear-round  complexity  to  be  an  optimal  P2P  mixing  solution.

Author Details

Tim Ruffing
CISPA, Saarland University
tim.ruffing@mmci.uni-saarland.de

Pedro Moreno-Sanchez
Purdue University
pmorenos@purdue.edu

Aniket Kate
Purdue University
aniket@purdue.edu