國立虎尾科技大學 |

Cryptography Against Space-Bounded Adversaries.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Cryptography Against Space-Bounded Adversaries./
作者:	Guan, Jiaxin.
面頁冊數:	1 online resource (275 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-04, Section: A.
Contained By:	Dissertations Abstracts International85-04A.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798380413831

Cryptography Against Space-Bounded Adversaries.
Guan, Jiaxin.

Cryptography Against Space-Bounded Adversaries. - 1 online resource (275 pages)

Source: Dissertations Abstracts International, Volume: 85-04, Section: A.

Thesis (Ph.D.)--Princeton University, 2023.

Includes bibliographical references

Traditionally in cryptography, we consider adversaries that are time-bounded by making certain computational assumptions. In this thesis, I study the scenario where the adversaries are space-bounded, i.e. the adversary can only use up to a certain amount of memory bits. Under these scenarios, we can achieve either unconditional security properties or never-before-possible results.First, I start off with Maurer's Bounded Storage Model. It is a model where the adversary abides by a certain memory bound throughout the entire attack. Under this model, I show simple constructions of a key-agreement protocol, a commitment scheme, and an oblivious transfer protocol, all based on Raz's lower bound on parity learning. These constructions have several advantages over prior work, including enhanced correctness and an improved and optimal number of rounds.Subsequently, I show that if we combine computational assumptions with the bounded storage model, we can achieve results that are not possible in the standard model. I define a new object named Online Obfuscation, which is analogous to a Virtual Grey-Box Obfuscation in the Bounded Storage Model, and show how to use it to construct disappearing encryption and signature schemes where the ciphertext and the signature effectively "disappear" after transmission.Lastly, I make the observation that in the Bounded Storage Model, the memory bound on the adversary is enforced throughout the entire game. One can imagine a variant where the bound is only enforced for long-term storage, allowing the adversary to use an arbitrary amount of memory during the transmission phase. I define incompressible cryptography to capture this intuition and show constructions using randomness extractors and other cryptographic tools. Furthermore, I show that under the multi-user setting, we can still achieve desired incompressible security if we simply replace the randomness extractor with a special "multi-instance randomness extractor".

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798380413831Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

CryptographyIndex Terms--Genre/Form:

554714
Electronic books.

Cryptography Against Space-Bounded Adversaries.
LDR:03297ntm a2200385K 4500 001 1141600
005 20240318062650.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798380413831
035 $a (MiAaPQ)AAI30570857
035 $a AAI30570857
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Guan, Jiaxin. $3 1465490
245 1 0 $a Cryptography Against Space-Bounded Adversaries.
264 0 $c 2023
300 $a 1 online resource (275 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-04, Section: A.
500 $a Advisor: Zhandry, Mark.
502 $a Thesis (Ph.D.)--Princeton University, 2023.
504 $a Includes bibliographical references
520 $a Traditionally in cryptography, we consider adversaries that are time-bounded by making certain computational assumptions. In this thesis, I study the scenario where the adversaries are space-bounded, i.e. the adversary can only use up to a certain amount of memory bits. Under these scenarios, we can achieve either unconditional security properties or never-before-possible results.First, I start off with Maurer's Bounded Storage Model. It is a model where the adversary abides by a certain memory bound throughout the entire attack. Under this model, I show simple constructions of a key-agreement protocol, a commitment scheme, and an oblivious transfer protocol, all based on Raz's lower bound on parity learning. These constructions have several advantages over prior work, including enhanced correctness and an improved and optimal number of rounds.Subsequently, I show that if we combine computational assumptions with the bounded storage model, we can achieve results that are not possible in the standard model. I define a new object named Online Obfuscation, which is analogous to a Virtual Grey-Box Obfuscation in the Bounded Storage Model, and show how to use it to construct disappearing encryption and signature schemes where the ciphertext and the signature effectively "disappear" after transmission.Lastly, I make the observation that in the Bounded Storage Model, the memory bound on the adversary is enforced throughout the entire game. One can imagine a variant where the bound is only enforced for long-term storage, allowing the adversary to use an arbitrary amount of memory during the transmission phase. I define incompressible cryptography to capture this intuition and show constructions using randomness extractors and other cryptographic tools. Furthermore, I show that under the multi-user setting, we can still achieve desired incompressible security if we simply replace the randomness extractor with a special "multi-instance randomness extractor".
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Communication. $3 556422
650 4 $a Information science. $3 561178
653 $a Cryptography
653 $a Information theory
653 $a Space-bounded adversaries
653 $a Parity learning
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0459
690 $a 0723
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Princeton University. $b Computer Science. $3 1179801
773 0 $t Dissertations Abstracts International $g 85-04A.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30570857 $z click for full text (PQDT)