| Autor: |
Garay, Juan A., Kiayias, Aggelos, Leonardos, Nikos, Panagiotakos, Giorgos |
| Přispěvatelé: |
Abdalla, Michel, Dahab, Ricardo |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Zdroj: |
Garay, J A, Kiayias, A, Leonardos, N & Panagiotakos, G 2018, Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup . in M Abdalla & R Dahab (eds), Public-Key Cryptography--PKC 2018 . Lecture Notes in Computer Science, vol. 10770, Springer International Publishing AG, Rio de Janeiro, Brazil, pp. 465-495, 21st edition of the International Conference on Practice and Theory of Public Key Cryptography, Rio De Janeiro, Brazil, 25/03/18 . https://doi.org/10.1007/978-3-319-76581-5_16 |
| DOI: |
10.1007/978-3-319-76581-5_16 |
| Popis: |
The Bitcoin backbone protocol (Eurocrypt 2015) extracts basic properties of Bitcoin's underlying blockchain data structure, such as "common prefix'' and "chain quality,'' and shows how fundamental applications including consensus and a robust public transaction ledger can be built on top of them. The underlying assumptions are "proofs of work'' (POWs), adversarial hashing power strictly less than 1/2 and no adversarial pre-computation---or, alternatively, the existence of an unpredictable "genesis'' block.In this paper we first show how to remove the latter assumption, presenting a “bootstrapped” Bitcoin-like blockchain protocol relying on POWs that builds genesis blocks “from scratch” in the presence of adversarial pre-computation. Importantly, the round complexity of the genesis block generation process is independent of the number of participants.Next, we consider applications of our construction, including a PKI generation protocol and a consensus protocol without trusted setup assuming an honest majority (in terms of computational power). Previous results in the same setting (unauthenticated parties, no trusted setup, POWs) required a round complexity linear in the number of participants. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
