東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Polynomial reconstruction based cryp...

Kiayias, Aggelos.

FindBook

Google Book

Amazon

博客來

Polynomial reconstruction based cryptography.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Polynomial reconstruction based cryptography./
作者:	Kiayias, Aggelos.
面頁冊數:	174 p.
附註:	Advisers: Stathis Zachos; Moti Yung.
Contained By:	Dissertation Abstracts International63-09B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3063844
ISBN:	0493827900

Polynomial reconstruction based cryptography.
Kiayias, Aggelos.

Polynomial reconstruction based cryptography. - 174 p.

Advisers: Stathis Zachos; Moti Yung.

Thesis (Ph.D.)--City University of New York, 2002.

An important direction in Cryptographic Research is the identification and investigation of hard computational problems upon which the security of cryptographic primitives and protocols can be based. This is important because: (i) the properties of a certain cryptographic primitive depend to a great extent on the properties of the underlying hard computational problem that is used as an intractability assumption. Employing new plausible intractability assumptions with rich algebraic structure would presumably give rise to cryptographic primitives with unique and novel properties; (ii) the listing of “hard” computational problems that has been utilized in the design of cryptographic primitives is not very large; this motivates the investigation of novel cryptographic assumptions, as different problems will most likely react differently in stronger adversarial models that become feasible with technical/technological advances.

ISBN: 0493827900Subjects--Topical Terms:

626642
Computer Science.

Polynomial reconstruction based cryptography.
LDR:03382nam 2200301 a 45 001 927557
005 20110425
008 110425s2002 eng d
020 $a 0493827900
035 $a (UnM)AAI3063844
035 $a AAI3063844
040 $a UnM $c UnM
100 1 $a Kiayias, Aggelos. $3 1245486
245 1 0 $a Polynomial reconstruction based cryptography.
300 $a 174 p.
500 $a Advisers: Stathis Zachos; Moti Yung.
500 $a Source: Dissertation Abstracts International, Volume: 63-09, Section: B, page: 4247.
502 $a Thesis (Ph.D.)--City University of New York, 2002.
520 $a An important direction in Cryptographic Research is the identification and investigation of hard computational problems upon which the security of cryptographic primitives and protocols can be based. This is important because: (i) the properties of a certain cryptographic primitive depend to a great extent on the properties of the underlying hard computational problem that is used as an intractability assumption. Employing new plausible intractability assumptions with rich algebraic structure would presumably give rise to cryptographic primitives with unique and novel properties; (ii) the listing of “hard” computational problems that has been utilized in the design of cryptographic primitives is not very large; this motivates the investigation of novel cryptographic assumptions, as different problems will most likely react differently in stronger adversarial models that become feasible with technical/technological advances.
520 $a In this thesis, the Problem of Reed-Solomon Codes Decoding—a well-known computational problem in the theory of Error-Correcting Codes, also known as Polynomial Reconstruction (PR)—is considered from the cryptographic hardness perspective. Following the standard methodology in the cryptographic literature which includes the investigation of a Decisional Intractability Assumption related to PR as well as the establishment of results such as Hardness of Partial Information Extraction and Pseudorandomness, we lay out the theoretical framework for the exploitation of PR in Cryptography.
520 $a Subsequently, we present a wide array of concrete applications of PR in Cryptography: (i) basic primitives, such as a probabilistic one-way function with strong concealment properties which gives rise to commitment schemes with unique properties; (ii) symmetric encryption methods with strong security properties such as forward secrecy, computational perfect secrecy, and key-equivalence; (iii) a generic protocol for efficient secure function evaluation over the domain of polynomial expressions. We also consider applications of our work in the Coding Theoretic setting: we investigate the solvability of Interleaved Reed-Solomon Codes Decoding in the presence of random errors, and we discover interesting hardness/self-reducibility tradeoffs in Decoding Problems (including the PR problem). Finally we describe directions for future research that are spawned from the results of this thesis.
590 $a School code: 0046.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a City University of New York. $3 1018111
773 0 $t Dissertation Abstracts International $g 63-09B.
790 $a 0046
790 1 0 $a Yung, Moti, $e advisor
790 1 0 $a Zachos, Stathis, $e advisor
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3063844