자료유형 | 학위논문 |
---|---|
서명/저자사항 | How to Rewind with Minimal Interaction. |
개인저자 | Khurana, Dakshita. |
단체저자명 | University of California, Los Angeles. Computer Science 0201. |
발행사항 | [S.l.]: University of California, Los Angeles., 2018. |
발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
형태사항 | 136 p. |
기본자료 저록 | Dissertation Abstracts International 79-10B(E). Dissertation Abstract International |
ISBN | 9780438021723 |
학위논문주기 | Thesis (Ph.D.)--University of California, Los Angeles, 2018. |
일반주기 |
Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Advisers: Rafail Ostrovsky |
요약 | The notion of simulation is central to cryptography: often, to demonstrate that an adversary did not recover any information about private inputs of other participants, we exhibit the existence of a simulator that generates the adversary's view |
요약 | First introduced in the context of zero-knowledge proof systems and secure computation, today the rewinding technique is synonymous with protocol security and polynomial simulation. Prior to this work, all known rewinding techniques in the plain |
요약 | In this thesis, we demonstrate the first rewinding techniques that require only a single message from each participant. Using these techniques, we overcome several barriers from literature to construct for the first time, based on standard sub-e |
요약 | &bull |
요약 | &bull |
일반주제명 | Computer science. Theoretical mathematics. Computer engineering. |
언어 | 영어 |
바로가기 |
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |