서브메뉴
검색
On Efficient Instantiations of Secure Multi-Party Computation in Practice
On Efficient Instantiations of Secure Multi-Party Computation in Practice
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260331111232
- ISBN
- 9798381730647
- DDC
- 004
- 서명/저자
- On Efficient Instantiations of Secure Multi-Party Computation in Practice
- 발행사항
- [Sl] : New York University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 226 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-09, Section: B.
- 주기사항
- Advisor: Dodis, Yevgeniy;Ball, Marshall.
- 학위논문주기
- Thesis (Ph.D.)--New York University, 2024.
- 초록/해제
- 요약Secure Multi-Party Computation (MPC) is an area of cryptography that has been studied extensively since the 1980s. In full generality, MPC allows a set of mutually distrusting parties to privately compute a function of their inputs. That is, the parties interact in some protocol, and at the end obtain the output of the function, and nothing else. In the decades since the inception of MPC, great strides have been made towards making it more efficient. However, despite this progress, the use of MPC in practice still faces some shortcomings.In this thesis, we take steps to mitigate two such shortcomings. The first deficiency we study is related to the communication networks in which such MPC protocols operate. MPC protocols are usually designed assuming that all parties have pairwise secure communication channels which are stable; i.e., nodes never crash, messages always arrive on time, etc. However, in the real-world, this is rarely the case---it is hard to sustain a stable connection between parties over long periods of time. One such model that has been introduced to address this deficiency is called Fluid MPC (Choudhuri et al., CRYPTO 2021). In this model, parties are not mandated to stay online for long periods of time. Instead, parties come online for short periods of time and work together in committees to compute some function. The benefit is that individual committees are much more likely to be able to sustain stable connections for these shorter interactions. However, existing protocols in this model do not match the level of efficiency that is obtained by traditional MPC protocols. In the first part of this thesis, we study Fluid MPC, and in particular, introduce Fluid MPC protocols with efficiency that matches those of traditional MPC.The second deficiency of MPC which we study in this thesis is that general-purpose protocols often are still not efficient enough to be used in practice. One way to resolve this is by using protocols that are tailor-made for specific applications. One such application that has gained recent attention is called Private Join and Compute (PJC). In this application, two parties come together with input sets and associated values for each item in their sets. The goal is to privately compute a function over the associated values of the intersection of the two sets. In practice, the size of the intersection is quite small, and therefore the private computation of the intersection is actually much more expensive than whatever computation that needs to be done over it. In the second part of this thesis, we improve the efficiency of tailor-made state-of-the-art protocols that are used to privately compute the intersection, thus improving the efficiency of prior PJC protocols.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 키워드
- Cryptography
- 기타저자
- New York University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 85-09B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260324s2024 us c eng d■001000017410832
■00520260331111232
■006m o d
■007cr#unu||||||||
■020 ▼a9798381730647
■035 ▼a(MiAaPQ)AAI30813432
■040 ▼aMiAaPQ▼cMiAaPQ
■082 ▼a004
■1001 ▼aBienstock, Alexander.
■24510▼aOn Efficient Instantiations of Secure Multi-Party Computation in Practice
■260 ▼a[Sl]▼bNew York University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a226 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-09, Section: B.
■500 ▼aAdvisor: Dodis, Yevgeniy;Ball, Marshall.
■5021 ▼aThesis (Ph.D.)--New York University, 2024.
■520 ▼aSecure Multi-Party Computation (MPC) is an area of cryptography that has been studied extensively since the 1980s. In full generality, MPC allows a set of mutually distrusting parties to privately compute a function of their inputs. That is, the parties interact in some protocol, and at the end obtain the output of the function, and nothing else. In the decades since the inception of MPC, great strides have been made towards making it more efficient. However, despite this progress, the use of MPC in practice still faces some shortcomings.In this thesis, we take steps to mitigate two such shortcomings. The first deficiency we study is related to the communication networks in which such MPC protocols operate. MPC protocols are usually designed assuming that all parties have pairwise secure communication channels which are stable; i.e., nodes never crash, messages always arrive on time, etc. However, in the real-world, this is rarely the case---it is hard to sustain a stable connection between parties over long periods of time. One such model that has been introduced to address this deficiency is called Fluid MPC (Choudhuri et al., CRYPTO 2021). In this model, parties are not mandated to stay online for long periods of time. Instead, parties come online for short periods of time and work together in committees to compute some function. The benefit is that individual committees are much more likely to be able to sustain stable connections for these shorter interactions. However, existing protocols in this model do not match the level of efficiency that is obtained by traditional MPC protocols. In the first part of this thesis, we study Fluid MPC, and in particular, introduce Fluid MPC protocols with efficiency that matches those of traditional MPC.The second deficiency of MPC which we study in this thesis is that general-purpose protocols often are still not efficient enough to be used in practice. One way to resolve this is by using protocols that are tailor-made for specific applications. One such application that has gained recent attention is called Private Join and Compute (PJC). In this application, two parties come together with input sets and associated values for each item in their sets. The goal is to privately compute a function over the associated values of the intersection of the two sets. In practice, the size of the intersection is quite small, and therefore the private computation of the intersection is actually much more expensive than whatever computation that needs to be done over it. In the second part of this thesis, we improve the efficiency of tailor-made state-of-the-art protocols that are used to privately compute the intersection, thus improving the efficiency of prior PJC protocols.
■590 ▼aSchool code: 0146.
■650 4▼aComputer science
■650 4▼aComputer engineering
■653 ▼aCryptography
■653 ▼aPrivate Information Retrieval
■653 ▼aPrivate Set Intersection
■653 ▼aSecure Multi-Party Computation
■690 ▼a0984
■690 ▼a0464
■71020▼aNew York University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g85-09B.
■790 ▼a0146
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17410832▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
