서브메뉴
검색
Privacy and Scalability for Decentralized Cryptographic Systems- [electronic resource]
![Privacy and Scalability for Decentralized Cryptographic Systems - [electronic resource]](/Users/Baul/Images/book.png)
Privacy and Scalability for Decentralized Cryptographic Systems- [electronic resource]
상세정보
- 자료유형
- 학위논문파일 국외
- 최종처리일시
- 20240214095858
- ISBN
- 9798380621908
- DDC
- 004
- 서명/저자
- Privacy and Scalability for Decentralized Cryptographic Systems - [electronic resource]
- 발행사항
- [S.l.]: : University of California, Berkeley., 2021
- 발행사항
- Ann Arbor : : ProQuest Dissertations & Theses,, 2021
- 형태사항
- 1 online resource(271 p.)
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-04, Section: B.
- 주기사항
- Advisor: Chiesa, Alessandro;Popa, Raluca Ada.
- 학위논문주기
- Thesis (Ph.D.)--University of California, Berkeley, 2021.
- 사용제한주기
- This item must not be sold to any third party vendors.
- 초록/해제
- 요약The past few years have seen growing interest in decentralized systems owing to their improved censorship-resistance, fault tolerance, and auditability compared to their centralized counterparts. For example, ideas popularized in decentralized protocols like Bitcoin and Ethereum have seen widespread adoption and publicity. However, the benefits of these systems often come at the expense of privacy and scalability: to ensure the correctness of computations, decentralized systems like Ethereum require that parties publish their entire computational state, which is then checked by re-executing the computation. From the privacy perspective, this reveals which computation was performed, the data that was input to the computation, and the identity of the involved users. From the scalability perspective, re-execution means that the cost of expensive computations is borne by every party in the system, as opposed to just the party invoking the computation.In this dissertation, we show how to overcome these shortcomings and obtain decentralized systems that achieve strong privacy and scalability properties. We do so by providing new constructions and applications of a powerful cryptographic primitive: zero-knowledge succinct non-interactive argument systems, or zkSNARKs. We design new methodologies for constructing zkSNARKs that have lower deployment overhead and improved efficiency compared to the prior state-of-the-art. Finally, we go on to construct a system for decentralized private computation that takes advantage of these advances to make all transactions indistinguishable, thus ensuring privacy (transactions reveal no information about the computation) and scalability (transactions can be verified in time independent of the computation).
- 일반주제명
- Computer science.
- 일반주제명
- Computer engineering.
- 일반주제명
- Information technology.
- 키워드
- Cryptography
- 키워드
- zkSNARKs
- 키워드
- Scalability
- 기타저자
- University of California, Berkeley Computer Science
- 기본자료저록
- Dissertations Abstracts International. 85-04B.
- 기본자료저록
- Dissertation Abstract International
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008240612s2021 us |||||||||||||||c||eng d■001000016931036
■00520240214095858
■006m o d
■007cr#unu||||||||
■020 ▼a9798380621908
■035 ▼a(MiAaPQ)AAI28722452
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aMishra, Pratyush.
■24510▼aPrivacy and Scalability for Decentralized Cryptographic Systems▼h[electronic resource]
■260 ▼a[S.l.]:▼bUniversity of California, Berkeley. ▼c2021
■260 1▼aAnn Arbor :▼bProQuest Dissertations & Theses, ▼c2021
■300 ▼a1 online resource(271 p.)
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-04, Section: B.
■500 ▼aAdvisor: Chiesa, Alessandro;Popa, Raluca Ada.
■5021 ▼aThesis (Ph.D.)--University of California, Berkeley, 2021.
■506 ▼aThis item must not be sold to any third party vendors.
■520 ▼aThe past few years have seen growing interest in decentralized systems owing to their improved censorship-resistance, fault tolerance, and auditability compared to their centralized counterparts. For example, ideas popularized in decentralized protocols like Bitcoin and Ethereum have seen widespread adoption and publicity. However, the benefits of these systems often come at the expense of privacy and scalability: to ensure the correctness of computations, decentralized systems like Ethereum require that parties publish their entire computational state, which is then checked by re-executing the computation. From the privacy perspective, this reveals which computation was performed, the data that was input to the computation, and the identity of the involved users. From the scalability perspective, re-execution means that the cost of expensive computations is borne by every party in the system, as opposed to just the party invoking the computation.In this dissertation, we show how to overcome these shortcomings and obtain decentralized systems that achieve strong privacy and scalability properties. We do so by providing new constructions and applications of a powerful cryptographic primitive: zero-knowledge succinct non-interactive argument systems, or zkSNARKs. We design new methodologies for constructing zkSNARKs that have lower deployment overhead and improved efficiency compared to the prior state-of-the-art. Finally, we go on to construct a system for decentralized private computation that takes advantage of these advances to make all transactions indistinguishable, thus ensuring privacy (transactions reveal no information about the computation) and scalability (transactions can be verified in time independent of the computation).
■590 ▼aSchool code: 0028.
■650 4▼aComputer science.
■650 4▼aComputer engineering.
■650 4▼aInformation technology.
■653 ▼aCryptography
■653 ▼aDecentralized private computation
■653 ▼aProof-carrying data
■653 ▼azkSNARKs
■653 ▼aScalability
■690 ▼a0984
■690 ▼a0489
■690 ▼a0464
■71020▼aUniversity of California, Berkeley▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g85-04B.
■773 ▼tDissertation Abstract International
■790 ▼a0028
■791 ▼aPh.D.
■792 ▼a2021
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16931036▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
■980 ▼a202402▼f2024
