東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes./
作者:	Dixon, Peter.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	88 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
Contained By:	Dissertations Abstracts International83-03B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28412824
ISBN:	9798544277057

Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes.
Dixon, Peter.

Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 88 p.

Source: Dissertations Abstracts International, Volume: 83-03, Section: B.

Thesis (Ph.D.)--Iowa State University, 2021.

This item must not be sold to any third party vendors.

Random algorithms have a unique place in complexity theory as a model of computation that ispotentially more powerful than "normal" algorithms, and is also practical. However, it is still notclear how much more power randomness adds. The primary goal in studying random algorithmsis derandomization - some method to simulate random algorithms without actually using random-ness. While full derandomization is quite difficult, we show some weak derandomization results -one using advice, and one using multi-pseudodeterminism. We show that improving these resultswould have major implications. Finally, we show new containments and oracle separations betweentraditional random classes and zero-knowledge proofs.

ISBN: 9798544277057Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Cryptography

Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes.
LDR:01811nmm a2200337 4500 001 2342325
005 20220318093112.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798544277057
035 $a (MiAaPQ)AAI28412824
035 $a AAI28412824
040 $a MiAaPQ $c MiAaPQ
100 1 $a Dixon, Peter. $3 774588
245 1 0 $a Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 88 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
500 $a Advisor: Aduri, Pavan.
502 $a Thesis (Ph.D.)--Iowa State University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Random algorithms have a unique place in complexity theory as a model of computation that ispotentially more powerful than "normal" algorithms, and is also practical. However, it is still notclear how much more power randomness adds. The primary goal in studying random algorithmsis derandomization - some method to simulate random algorithms without actually using random-ness. While full derandomization is quite difficult, we show some weak derandomization results -one using advice, and one using multi-pseudodeterminism. We show that improving these resultswould have major implications. Finally, we show new containments and oracle separations betweentraditional random classes and zero-knowledge proofs.
590 $a School code: 0097.
650 4 $a Computer science. $3 523869
653 $a Cryptography
653 $a Pseudorandomness
653 $a Randomized algorithms
653 $a Theoretical computer science
690 $a 0984
710 2 $a Iowa State University. $b Computer Science. $3 1022280
773 0 $t Dissertations Abstracts International $g 83-03B.
790 $a 0097
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28412824