%0 Journal Article %1 Puddu2017chainHT %A Puddu, Ivan %A Dmitrienko, Alexandra %A Capkun, Srdjan %D 2017 %J IACR Cryptology ePrint Archive (IACR) %K %T μchain: How to Forget without Hard Forks %U https://eprint.iacr.org/2017/106 %X In this paper, we explore an idea of making(proof-of-work) blockchains mutable. We propose and implement μchain, a mutable blockchain, that enables modifications of blockchain history. Blockchains are, by common definition,distributed and immutable data structures that store a history of events, such as transactions in a digital currency system. While the very idea of mutable event history may seem controversial at a first glance, we show thatμchain does not undermine security guarantees provided by immutable blockchains. In particular,all mutations in our system are controlled by fiat, enforced by consensus and are verifiable in the same way as regular transactions. At the same time,μchain provides a solution to a number of challenging problems, such as the patching of vulnerable smart contracts and removal of abusive content from blockchain history. It also gives rise to new blockchain applications that were not possible with immutable blockchains.For instance, governments and companies could now maintain registers of citizens and customers, while preserving their legislated rights to be forgotten. Banks could consider consolidation of cryptocurrency with traditional payments, which is hard to achieve without the ability to revert transactions. To further illustrate the power ofμchain on more concrete examples, we present two new applications, the collaborative recommendation system with the ability to censor inappropriate content, and a time-lock encryption mechanism that provides a method to decrypt messages after a certain deadline has passed.

@article{Puddu2017chainHT, abstract = {In this paper, we explore an idea of making(proof-of-work) blockchains mutable. We propose and implement μchain, a mutable blockchain, that enables modifications of blockchain history. Blockchains are, by common definition,distributed and immutable data structures that store a history of events, such as transactions in a digital currency system. While the very idea of mutable event history may seem controversial at a first glance, we show thatμchain does not undermine security guarantees provided by immutable blockchains. In particular,all mutations in our system are controlled by fiat, enforced by consensus and are verifiable in the same way as regular transactions. At the same time,μchain provides a solution to a number of challenging problems, such as the patching of vulnerable smart contracts and removal of abusive content from blockchain history. It also gives rise to new blockchain applications that were not possible with immutable blockchains.For instance, governments and companies could now maintain registers of citizens and customers, while preserving their legislated rights to be forgotten. Banks could consider consolidation of cryptocurrency with traditional payments, which is hard to achieve without the ability to revert transactions. To further illustrate the power ofμchain on more concrete examples, we present two new applications, the collaborative recommendation system with the ability to censor inappropriate content, and a time-lock encryption mechanism that provides a method to decrypt messages after a certain deadline has passed.}, added-at = {2023-12-12T23:33:35.000+0100}, author = {Puddu, Ivan and Dmitrienko, Alexandra and Capkun, Srdjan}, biburl = {https://www.bibsonomy.org/bibtex/25848ff568578ccc2743193b71496b694/admin}, interhash = {574e734e5c809ce2f6d5abb11ee27619}, intrahash = {5848ff568578ccc2743193b71496b694}, journal = {IACR Cryptology ePrint Archive (IACR)}, keywords = {}, month = feb, timestamp = {2023-12-12T23:33:35.000+0100}, title = {μchain: How to Forget without Hard Forks}, url = {https://eprint.iacr.org/2017/106}, year = 2017 }