Abstract
In present blockchain systems, privacy of transactions is maintained by keeping the identity of accounts anonymous. The associated pseudonyms are ephemeral in nature, and can not be easily traced back to the real identity. An alternate infallible approach is to make use of private information retrieval (PIR) protocols that enable users to fetch details of transactions without revealing which transactions they seek. In this paper, we formalize this approach for blockchain systems that employ coded sharding. We present a PIR protocol for private data access, in particular private balance-checking, in blockchain systems when data is stored using generalized Reed-Solomon codes. Our protocol can be readily applied to the PolyShard scheme that has been recently proposed as a method to build truly scalable blockchain system.
Original language | English |
---|---|
Title of host publication | 2021 IEEE International Symposium on Information Theory - Proceedings |
Editors | Bikash Dey |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 2684-2689 |
Number of pages | 6 |
ISBN (Electronic) | 9781538682098 |
ISBN (Print) | 9781538682104 |
DOIs | |
Publication status | Published - 2021 |
Event | IEEE International Symposium on Information Theory 2021 - Online, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021 https://ieeexplore.ieee.org/xpl/conhome/9517708/proceeding (Proceedings) https://2021.ieee-isit.org/ |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Volume | 2021-July |
ISSN (Print) | 2157-8095 |
Conference
Conference | IEEE International Symposium on Information Theory 2021 |
---|---|
Abbreviated title | ISIT 2021 |
Country/Territory | Australia |
City | Melbourne |
Period | 12/07/21 → 20/07/21 |
Internet address |
Keywords
- balance checking
- blockchain
- cryptocurrency
- privacy
- private information retrieval
- sharding