Skip to main content

LUP Student Papers

LUND UNIVERSITY LIBRARIES

Publicly Auditable Privacy Revocation in Practice

Nilsson, Wilmer LU and Kron, Patrik LU (2021) EITM01 20211
Department of Electrical and Information Technology
Abstract
PAPR Credentials is the name of a not yet published credential scheme that provides conditional privacy for its users. This means that an administrator can choose to revoke a user's anonymity. Doing so, however, the administrator must broadcast her intention, as the success of the privacy revocation depends on the help of other users, since the administrator does not have access to sufficient information to do it alone.

In this thesis, we provide a PAPR Credentials implementation that we use to examine system characteristics. We focus on how different system parameters impact three properties: the computational load for an arbitrary user, revocation delay, and when revocations begin to fail due to the number of previous revocations.

... (More)
PAPR Credentials is the name of a not yet published credential scheme that provides conditional privacy for its users. This means that an administrator can choose to revoke a user's anonymity. Doing so, however, the administrator must broadcast her intention, as the success of the privacy revocation depends on the help of other users, since the administrator does not have access to sufficient information to do it alone.

In this thesis, we provide a PAPR Credentials implementation that we use to examine system characteristics. We focus on how different system parameters impact three properties: the computational load for an arbitrary user, revocation delay, and when revocations begin to fail due to the number of previous revocations.

On top of PAPR, we construct an example application called PAPR Money, in which the users can transfer bitcoin to one another pseudonymously. In case of suspected money laundering or terrorist financing, the underlying PAPR Credentials scheme facilitates the ability to revoke anonymity.

We have also produced the first implementations of Schoenmakers' Publicly Verifiable Secret Sharing scheme (PVSS) in Python that we are aware of. Schoenmakers' PVSS is a crucial component of PAPR Credentials.

Our results show how the computational load changes with different sets of system parameters and how the system parameters are key to determining both revocation delay and revocation failure. (Less)
Please use this url to cite or link to this publication:
author
Nilsson, Wilmer LU and Kron, Patrik LU
supervisor
organization
course
EITM01 20211
year
type
H2 - Master's Degree (Two Years)
subject
keywords
crypto, cryptography, PAPR, conditional privacy, pseudonymous credentials, bitcoin, secret sharing schemes, secret sharing, VANETs, money laundering, trustless, publicly auditable privacy revocation
report number
LU/LTH-EIT 2021-832
language
English
id
9061208
date added to LUP
2021-07-07 14:58:09
date last changed
2021-07-07 14:58:09
@misc{9061208,
  abstract     = {{PAPR Credentials is the name of a not yet published credential scheme that provides conditional privacy for its users. This means that an administrator can choose to revoke a user's anonymity. Doing so, however, the administrator must broadcast her intention, as the success of the privacy revocation depends on the help of other users, since the administrator does not have access to sufficient information to do it alone.

In this thesis, we provide a PAPR Credentials implementation that we use to examine system characteristics. We focus on how different system parameters impact three properties: the computational load for an arbitrary user, revocation delay, and when revocations begin to fail due to the number of previous revocations. 

On top of PAPR, we construct an example application called PAPR Money, in which the users can transfer bitcoin to one another pseudonymously. In case of suspected money laundering or terrorist financing, the underlying PAPR Credentials scheme facilitates the ability to revoke anonymity.

We have also produced the first implementations of Schoenmakers' Publicly Verifiable Secret Sharing scheme (PVSS) in Python that we are aware of. Schoenmakers' PVSS is a crucial component of PAPR Credentials.

Our results show how the computational load changes with different sets of system parameters and how the system parameters are key to determining both revocation delay and revocation failure.}},
  author       = {{Nilsson, Wilmer and Kron, Patrik}},
  language     = {{eng}},
  note         = {{Student Paper}},
  title        = {{Publicly Auditable Privacy Revocation in Practice}},
  year         = {{2021}},
}