| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000433510 |
| 005 | | 20200225142812 |
| 008 | | 200131s2019 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781088380376 |
| 035 | |
▼a (MiAaPQ)AAI22615271 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 004 |
| 100 | 1 |
▼a Sheff, Isaac Cameron. |
| 245 | 10 |
▼a Serializability and Heterogeneous Trust from Two Phase Commit to Blockchains. |
| 260 | |
▼a [S.l.]:
▼b Cornell University.,
▼c 2019. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2019. |
| 300 | |
▼a 243 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-04, Section: B. |
| 500 | |
▼a Advisor: Myers, Andrew C. |
| 502 | 1 |
▼a Thesis (Ph.D.)--Cornell University, 2019. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 520 | |
▼a As distributed systems become more federated and cross-domain, we are forced to rethink some of our core abstractions. We need heterogeneous systems with rigorous consistency and self-authentication guarantees, despite a complex landscape of security and failure tolerance assumptions. I have designed, built, and evaluated heterogeneous distributed algorithms with broad applications from medical privacy to blockchains.This dissertation examines three novel building blocks for this vision.First, I show that serializable transactions cannot always be securely scheduled when data has different levels of confidentiality. I have identified a useful subset of transactions that can always be securely scheduled, and built a system to check and execute them.Second, I present Charlotte, a heterogeneous system that supports composable Authenticated Distributed Data Structures (like Git, PKIs, or Bitcoin). I show that Charlotte produces significant performance improvements compared to a single, universally trusted blockchain.Finally, I develop a rigorous generalization of the consensus problem, and present the first distributed consensus which tolerates heterogeneous failures, heterogeneous participants, and heterogeneous observers. With this consensus, cross-domain systems can maintain ADDSs, or schedule transactions, without the expensive overhead that comes from tolerating the sum of everyone's fears. |
| 590 | |
▼a School code: 0058. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a Cornell University.
▼b Computer Science. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-04B. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0058 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2019 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15493285
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1008102 |
| 991 | |
▼a E-BOOK |