Biblio

Blockchain is a powerful and distributed platform for transactions which require a unified, resilient, transparent and consensus-based record keeping system. It has been applied to scenarios like smart city, supply chain, medical data storing and sharing, and etc. Many works have been done on improving the performance and security of such systems. However, there is a lack of the mechanism of identity binding when a human being is involved in corresponding physical world, i.e., if one is involved in an activity, his/her identity in the real world should be correctly reflected in the blockchain system. To mitigate this gap, we propose BlockID, a novel framework for people identity management that leverages biometric authentication and trusted computing technology. We also develop a prototype to demonstrate its feasibility in practice.

User privacy is an important issue in a blockchain based transaction system. Bitcoin, being one of the most widely used blockchain based transaction system, fails to provide enough protection on users' privacy. Many subsequent studies focus on establishing a system that hides the linkage between the identities (pseudonyms) of users and the transactions they carry out in order to provide a high level of anonymity. Examples include Zerocoin, Zerocash and so on. It thus becomes an interesting question whether such new transaction systems do provide enough protection on users' privacy. In this paper, we propose a novel and effective approach for de-anonymizing these transaction systems by leveraging information in the system that is not directly related, including the number of transactions made by each identity and time stamp of sending and receiving. Combining probability studies with optimization tools, we establish a model which allows us to determine, among all possible ways of linking between transactions and identities, the one that is most likely to be true. Subsequent transaction graph analysis could then be carried out, leading to the de-anonymization of the system. To solve the model, we provide exact algorithms based on mixed integer linear programming. Our research also establishes interesting relationships between the de-anonymization problem and other problems studied in the literature of theoretical computer science, e.g., the graph matching problem and scheduling problem.