TY - GEN
T1 - Virtual ASICs
T2 - 16th International Workshop on Data Privacy Management, DPM 2021, and 5th International Workshop on Cryptocurrencies and Blockchain Technology, CBT 2021 held in conjunction with ESORICS 2021
AU - Ganesh, Chaya
AU - Orlandi, Claudio
AU - Tschudi, Daniel
AU - Zohar, Aviv
N1 - Publisher Copyright: © 2022, Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - In proof-of-work based cryptocurrencies, miners invest computing power to maintain a distributed ledger. One known drawback of such a consensus protocol is its immense energy consumption. To prevent this waste of energy various consensus mechanism such as proof-of-space or proof-of-stake have been proposed. In proof-of-stake, block creators are selected based on the amounts of currency they stake instead of their expanded computing power. In this work we study Virtual ASICs–a generalization of proof-of-stake. Virtual ASICs are essentially a virtualized version of proof-of-work. Miners can buy on-chain virtual mining machines which can be powered by virtual electricity. Similar to their physical counterparts, each powered virtual ASIC has a certain chance to win the right to create the next block. In the boundary case where virtual electricity is free, the protocol corresponds to proof-of-stake using an ASIC token which is separate from the currency itself (the amount of stake equals your virtual computing power). In the other boundary case where virtual computers are free, we get a proof-of-burn equivalent. That is, a consensus mechanism in which miners ‘burn’ currency to obtain lottery tickets for the right to create the next block. From a technical point of view, we provide the following contributions: We design cryptographic protocols that allow to sell Virtual ASICs in sealed-bid auctions on-chain. We ensure that as long as a majority of the miners in the system mine honestly, bids remain both private and binding, and that miners cannot censor the bids of their competitors;In order to implement our auction protocol, we introduce a novel all-or-nothing broadcast functionality in blockchains that allows to “encrypt values to the future” and could be of independent interest.Finally, we provide a consensus protocol based on Virtual ASICs by generalizing existing protocols for proof-of-stake consensus.
AB - In proof-of-work based cryptocurrencies, miners invest computing power to maintain a distributed ledger. One known drawback of such a consensus protocol is its immense energy consumption. To prevent this waste of energy various consensus mechanism such as proof-of-space or proof-of-stake have been proposed. In proof-of-stake, block creators are selected based on the amounts of currency they stake instead of their expanded computing power. In this work we study Virtual ASICs–a generalization of proof-of-stake. Virtual ASICs are essentially a virtualized version of proof-of-work. Miners can buy on-chain virtual mining machines which can be powered by virtual electricity. Similar to their physical counterparts, each powered virtual ASIC has a certain chance to win the right to create the next block. In the boundary case where virtual electricity is free, the protocol corresponds to proof-of-stake using an ASIC token which is separate from the currency itself (the amount of stake equals your virtual computing power). In the other boundary case where virtual computers are free, we get a proof-of-burn equivalent. That is, a consensus mechanism in which miners ‘burn’ currency to obtain lottery tickets for the right to create the next block. From a technical point of view, we provide the following contributions: We design cryptographic protocols that allow to sell Virtual ASICs in sealed-bid auctions on-chain. We ensure that as long as a majority of the miners in the system mine honestly, bids remain both private and binding, and that miners cannot censor the bids of their competitors;In order to implement our auction protocol, we introduce a novel all-or-nothing broadcast functionality in blockchains that allows to “encrypt values to the future” and could be of independent interest.Finally, we provide a consensus protocol based on Virtual ASICs by generalizing existing protocols for proof-of-stake consensus.
UR - http://www.scopus.com/inward/record.url?scp=85124645316&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-030-93944-1_12
DO - https://doi.org/10.1007/978-3-030-93944-1_12
M3 - منشور من مؤتمر
SN - 9783030939434
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 173
EP - 191
BT - Data Privacy Management, Cryptocurrencies and Blockchain Technology - ESORICS 2021 International Workshops, DPM 2021 and CBT 2021, Revised Selected Papers
A2 - Garcia-Alfaro, Joaquin
A2 - Muñoz-Tapia, Jose Luis
A2 - Navarro-Arribas, Guillermo
A2 - Soriano, Miguel
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 8 October 2021 through 8 October 2021
ER -