Kai Wei, Yih-Farn Chen, Alan J. Smith and Binh Vo

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-05-1386
May 2005

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/CSD-05-1386.pdf

An electronic payment system ideally should provide security, anonymity, fairness, transferability and scalability. Existing payment schemes often lack either anonymity or scalability. In this paper we propose WhoPay, a peer-to-peer payment system that provides all the above properties. For anonymity, we represent coins with public keys; for scalability, we distribute coin transfer load across all peers, rather than rely on a central entity such as the broker. This basic version of WhoPay is as secure and scalable as existing peer-to-peer payment schemes such as PPay, while providing a much higher level of user anonymity. We also introduce the idea of real-time double spending detection by making use of distributed hash tables (DHT), which further improves the security level of WhoPay.

To evaluate how well WhoPay distributes load among peers, we have run simulations with several different configurations. The simulation results show that the majority of the system load is handled by the peers under typical peer availability, indicating that WhoPay should scale well.

BibTeX citation:

@techreport{Wei:CSD-05-1386,
    Author = {Wei, Kai and Chen, Yih-Farn and Smith, Alan J. and Vo, Binh},
    Title = {WhoPay: a Scalable and Anonymous Payment System for Peer-to-Peer Environments},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2005},
    Month = {May},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/5650.html},
    Number = {UCB/CSD-05-1386},
    Abstract = {An electronic payment system ideally should provide security, anonymity, fairness, transferability and scalability. Existing payment schemes often lack either anonymity or scalability. In this paper we propose WhoPay, a peer-to-peer payment system that provides all the above properties. For anonymity, we represent coins with public keys; for scalability, we distribute coin transfer load across all peers, rather than rely on a central entity such as the broker. This basic version of WhoPay is as secure and scalable as existing peer-to-peer payment schemes such as PPay, while providing a much higher level of user anonymity. We also introduce the idea of real-time double spending detection by making use of distributed hash tables (DHT), which further improves the security level of WhoPay. <p>To evaluate how well WhoPay distributes load among peers, we have run simulations with several different configurations. The simulation results show that the majority of the system load is handled by the peers under typical peer availability, indicating that WhoPay should scale well.}
}

EndNote citation:

%0 Report
%A Wei, Kai
%A Chen, Yih-Farn
%A Smith, Alan J.
%A Vo, Binh
%T WhoPay: a Scalable and Anonymous Payment System for Peer-to-Peer Environments
%I EECS Department, University of California, Berkeley
%D 2005
%@ UCB/CSD-05-1386
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2005/5650.html
%F Wei:CSD-05-1386