We propose a secure and efficient implementation of fungible tokens on Bitcoin. Our technique is based on a small extension of the Bitcoin script language, which allows the spending conditions in a transaction to depend on the neighbour transactions. We show that our implementation is computationally sound: that is, adversaries can make tokens diverge from their ideal functionality only with negligible probability.
Computationally sound Bitcoin tokens / Bartoletti, Massimo; Lande, Stefano; Zunino, Roberto. - (2021), pp. 1-15. (Intervento presentato al convegno Computer Security Foundations Symposium (CSF) tenutosi a Dubrovnik, Croatia nel 21-25 June 2021) [10.1109/CSF51468.2021.00022].
Computationally sound Bitcoin tokens
Zunino, Roberto
2021-01-01
Abstract
We propose a secure and efficient implementation of fungible tokens on Bitcoin. Our technique is based on a small extension of the Bitcoin script language, which allows the spending conditions in a transaction to depend on the neighbour transactions. We show that our implementation is computationally sound: that is, adversaries can make tokens diverge from their ideal functionality only with negligible probability.| File | Dimensione | Formato | |
|---|---|---|---|
|
tokens.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
700.03 kB
Formato
Adobe PDF
|
700.03 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
