Table of Contents
Fetching ...

Privacy Analysis and Evaluation Policy of Blockchain-based Anonymous Cryptocurrencies

Takeshi Miyamae, Kanta Matsuura

TL;DR

This paper proposes a specific architecture model with three software layers to anonymous cryptocurrencies and introduces definitions of fundamental privacy properties (Pfitzmann's anonymity, unlinkability, and pseudonymity) and comprehensively analyze each privacy property for each architecture layer of anonymous cryptocurrencies to establish a privacy evaluation policy for anonymous cryptocurrencies.

Abstract

In blockchain-based anonymous cryptocurrencies, due to their tamper-resistance and transparency characteristics, transaction data are initially required to be anonymous, with the help of various cryptographic techniques, e.g., commitment schemes and zero-knowledge proofs. Also, cryptocurrencies are different from existing anonymous messaging protocols regarding the software architecture and the underlying security model. Due to these differences, the sense of anonymity must be specifically defined for anonymous cryptocurrencies, and the anonymity in each anonymous cryptocurrency must be analyzed and evaluated based on the specific architecture model. In this paper, we first propose a specific architecture model with three software layers to anonymous cryptocurrencies. Next, we introduce definitions of fundamental privacy properties (Pfitzmann's anonymity, unlinkability, and pseudonymity) and comprehensively analyze each privacy property for each architecture layer of anonymous cryptocurrencies to establish a privacy evaluation policy for anonymous cryptocurrencies. Finally, we fairly compare the privacy of current leading anonymous cryptocurrencies (e.g., Zerocash, CryptoNote, and Mimblewimble) using the privacy evaluation policy.

Privacy Analysis and Evaluation Policy of Blockchain-based Anonymous Cryptocurrencies

TL;DR

This paper proposes a specific architecture model with three software layers to anonymous cryptocurrencies and introduces definitions of fundamental privacy properties (Pfitzmann's anonymity, unlinkability, and pseudonymity) and comprehensively analyze each privacy property for each architecture layer of anonymous cryptocurrencies to establish a privacy evaluation policy for anonymous cryptocurrencies.

Abstract

In blockchain-based anonymous cryptocurrencies, due to their tamper-resistance and transparency characteristics, transaction data are initially required to be anonymous, with the help of various cryptographic techniques, e.g., commitment schemes and zero-knowledge proofs. Also, cryptocurrencies are different from existing anonymous messaging protocols regarding the software architecture and the underlying security model. Due to these differences, the sense of anonymity must be specifically defined for anonymous cryptocurrencies, and the anonymity in each anonymous cryptocurrency must be analyzed and evaluated based on the specific architecture model. In this paper, we first propose a specific architecture model with three software layers to anonymous cryptocurrencies. Next, we introduce definitions of fundamental privacy properties (Pfitzmann's anonymity, unlinkability, and pseudonymity) and comprehensively analyze each privacy property for each architecture layer of anonymous cryptocurrencies to establish a privacy evaluation policy for anonymous cryptocurrencies. Finally, we fairly compare the privacy of current leading anonymous cryptocurrencies (e.g., Zerocash, CryptoNote, and Mimblewimble) using the privacy evaluation policy.

Paper Structure

This paper contains 43 sections, 2 theorems, 1 equation, 7 figures, 1 table.

Key Result

Theorem 1

The relation of unlinkability between two sets of IOIs is symmetric.

Figures (7)

  • Figure 1: Architecture Model for Anonymous Cryptocurrency
  • Figure 2: Pfitzmann's Definition of Anonymity
  • Figure 3: Pfitzmann's Definition of Unlinkability
  • Figure 4: IOI Model in Layer-1 of Anonymous Cryptocurrency
  • Figure 5: IOI Model in Layer-1+0 of Anonymous Cryptocurrency
  • ...and 2 more figures

Theorems & Definitions (17)

  • Definition 1: Pfitzmann's Anonymity
  • Definition 2: Common Criteria's Anonymity
  • Definition 3: Pfitzmann's Unlinkability
  • Theorem 1
  • Proof 1
  • Theorem 2
  • Proof 2
  • Definition 4: Pfitzmann's Linkability
  • Definition 5: Sender Anonymity
  • Definition 6: Recipient Anonymity
  • ...and 7 more