MARC보기
LDR02252nam u200469 4500
001000000420070
00520190215164200
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438021723
035 ▼a (MiAaPQ)AAI10827084
035 ▼a (MiAaPQ)ucla:16896
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Khurana, Dakshita.
24510 ▼a How to Rewind with Minimal Interaction.
260 ▼a [S.l.]: ▼b University of California, Los Angeles., ▼c 2018.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2018.
300 ▼a 136 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 ▼a Advisers: Rafail Ostrovsky
5021 ▼a Thesis (Ph.D.)--University of California, Los Angeles, 2018.
520 ▼a 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
520 ▼a 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
520 ▼a 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
520 ▼a &bull
520 ▼a &bull
590 ▼a School code: 0031.
650 4 ▼a Computer science.
650 4 ▼a Theoretical mathematics.
650 4 ▼a Computer engineering.
690 ▼a 0984
690 ▼a 0642
690 ▼a 0464
71020 ▼a University of California, Los Angeles. ▼b Computer Science 0201.
7730 ▼t Dissertation Abstracts International ▼g 79-10B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0031
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14998979 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 201812 ▼f 2019
990 ▼a ***1012033