서브메뉴
검색
Economic Security and Scalability in Decentralized Systems
Economic Security and Scalability in Decentralized Systems
Detailed Information
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202104854
- ISBN
- 9798288814839
- DDC
- 004.62
- 서명/저자
- Economic Security and Scalability in Decentralized Systems
- 발행사항
- [Sl] : Stanford University, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 288 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 87-02, Section: B.
- 주기사항
- Advisor: Boneh, Dan;Tse, David.
- 학위논문주기
- Thesis (Ph.D.)--Stanford University, 2025.
- 초록/해제
- 요약Blockchain systems aim to decentralize Web platforms, thus preventing any single entity from imposing excessive fees or arbitrarily censoring content. They achieve decentralization through consensus protocols that replicate Web services across a fixed set of replicas. The security of these protocols is based on honesty assumptions that require sufficiently many replicas to remain non-faulty throughout the protocol execution. Recently, economic security, the ability to financially penalize faulty replicas, has emerged as a more appropriate notion of security for blockchains, where participants are often profit driven. In the first part of this thesis, we analyze the feasibility of achieving economic security in Proof-of-Stake (PoS) consensus protocols under various network models. As a requirement for economic security, PoS protocols are often designed to provide accountable safety, the ability to identify faulty replicas. We show that while accountable safety implies safety despite arbitrary network delays, no protocol producing a single ledger can simultaneously provide both accountable safety, and liveness against temporary crash faults. To address this dilemma, we propose a protocol that produces multiple nested ledgers with different properties. Finally, we show that upgrading accountable safety to economic security is impossible without minimal honesty assumptions and introduce a security sharing mechanism, in which a PoS protocol posts succinct timestamps to a more secure blockchain to attain optimal economic security. In the second part of this thesis, we design cryptographic protocols to address the blockchain trilemma, a well-known problem which states that achieving decentralization and security often hinders performance. Resolving this trade-off is essential for enabling a wide range of applications on top of blockchains, such as privacy-preserving computation and data storage, which demand high bandwidth and computational capacity. To this end, we first present a dynamic vector commitment scheme that optimally balances the resource requirements of replicas and clients, paving the way to scalability. We then develop a fair data-payment exchange protocol that leverages the blockchain as a decentralized escrow server while minimizing the data footprint on the chain. Finally, we propose an efficient batch decryption protocol with succinct decryption keys that protects user privacy without sacrificing performance.
- 일반주제명
- Protocol
- 일반주제명
- Input output
- 일반주제명
- Accountability
- 일반주제명
- Computer engineering
- 일반주제명
- Electrical engineering
- 키워드
- Proof-of-Stake
- 기타저자
- Stanford University.
- 기본자료저록
- Dissertations Abstracts International. 87-02B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017359244
■00520260202104854
■006m o d
■007cr#unu||||||||
■020 ▼a9798288814839
■035 ▼a(MiAaPQ)AAI32201001
■035 ▼a(MiAaPQ)Stanfordtw825dq6153
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004.62
■1001 ▼aTas, Ertem Nusret.
■24510▼aEconomic Security and Scalability in Decentralized Systems
■260 ▼a[Sl]▼bStanford University▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a288 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-02, Section: B.
■500 ▼aAdvisor: Boneh, Dan;Tse, David.
■5021 ▼aThesis (Ph.D.)--Stanford University, 2025.
■520 ▼aBlockchain systems aim to decentralize Web platforms, thus preventing any single entity from imposing excessive fees or arbitrarily censoring content. They achieve decentralization through consensus protocols that replicate Web services across a fixed set of replicas. The security of these protocols is based on honesty assumptions that require sufficiently many replicas to remain non-faulty throughout the protocol execution. Recently, economic security, the ability to financially penalize faulty replicas, has emerged as a more appropriate notion of security for blockchains, where participants are often profit driven. In the first part of this thesis, we analyze the feasibility of achieving economic security in Proof-of-Stake (PoS) consensus protocols under various network models. As a requirement for economic security, PoS protocols are often designed to provide accountable safety, the ability to identify faulty replicas. We show that while accountable safety implies safety despite arbitrary network delays, no protocol producing a single ledger can simultaneously provide both accountable safety, and liveness against temporary crash faults. To address this dilemma, we propose a protocol that produces multiple nested ledgers with different properties. Finally, we show that upgrading accountable safety to economic security is impossible without minimal honesty assumptions and introduce a security sharing mechanism, in which a PoS protocol posts succinct timestamps to a more secure blockchain to attain optimal economic security. In the second part of this thesis, we design cryptographic protocols to address the blockchain trilemma, a well-known problem which states that achieving decentralization and security often hinders performance. Resolving this trade-off is essential for enabling a wide range of applications on top of blockchains, such as privacy-preserving computation and data storage, which demand high bandwidth and computational capacity. To this end, we first present a dynamic vector commitment scheme that optimally balances the resource requirements of replicas and clients, paving the way to scalability. We then develop a fair data-payment exchange protocol that leverages the blockchain as a decentralized escrow server while minimizing the data footprint on the chain. Finally, we propose an efficient batch decryption protocol with succinct decryption keys that protects user privacy without sacrificing performance.
■590 ▼aSchool code: 0212.
■650 4▼aProtocol
■650 4▼aInput output
■650 4▼aAccountability
■650 4▼aComputer engineering
■650 4▼aElectrical engineering
■653 ▼aBlockchain trilemma
■653 ▼aProof-of-Stake
■653 ▼aBlockchain systems
■690 ▼a0544
■690 ▼a0464
■71020▼aStanford University.
■7730 ▼tDissertations Abstracts International▼g87-02B.
■790 ▼a0212
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17359244▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
Подробнее информация.
- Бронирование
- не существует
- моя папка
- Первый запрос зрения
- Non-Book Loan Application
- Nighttime Book Loan Application
Available after logging in.


