The scalability of trustless trust
File(s)1801.09535.pdf (443.54 KB)
Accepted version
Author(s)
Harz, Dominik
Boman, Magnus
Type
Conference Paper
Abstract
Permission-less blockchains can realise trustless trust, albeit at the cost of limiting the complexity of computation tasks. To explain the implications for scalability, we have implemented a trust model for smart contracts, described as agents in an open multi-agent system. Agent intentions are not necessarily known and autonomous agents have to be able to make decisions under risk. The ramifications of these general conditions for scalability are analysed for Ethereum and then generalised to other current and future platforms. Finally, mechanisms from the trust model are applied to a verifiable computation algorithm and implemented in the Ethereum blockchain. We show in experiments that the algorithm needs at most six semi-honest verifiers to detect false submission.
Date Issued
2019-02-10
Date Acceptance
2018-02-01
Citation
Lecture Notes in Computer Science, 2019, 10958, pp.279-293
ISSN
0302-9743
Publisher
Springer Verlag
Start Page
279
End Page
293
Journal / Book Title
Lecture Notes in Computer Science
Volume
10958
Copyright Statement
© International Financial Cryptography Association 2019. The final publication is available at Springer via https://link.springer.com/chapter/10.1007%2F978-3-662-58820-8_19
Source
Financial Cryptography and Data Security. FC 2018
Subjects
Artificial Intelligence & Image Processing
08 Information and Computing Sciences
Publication Status
Published
Start Date
2018-02-26
Finish Date
2018-03-02
Coverage Spatial
Nieuwpoort, Curaçao
OA Location
https://arxiv.org/pdf/1801.09535.pdf