東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

One-round zero-knowledge proofs and ...

Almuhammadi, Sultan.

Linked to FindBook

Google Book

Amazon

博客來

One-round zero-knowledge proofs and their applications in cryptographic systems.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	One-round zero-knowledge proofs and their applications in cryptographic systems./
Author:	Almuhammadi, Sultan.
Description:	118 p.
Notes:	Adviser: Clifford Neuman.
Contained By:	Dissertation Abstracts International66-06B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3180486
ISBN:	9780542206085

One-round zero-knowledge proofs and their applications in cryptographic systems.
Almuhammadi, Sultan.

One-round zero-knowledge proofs and their applications in cryptographic systems. - 118 p.

Adviser: Clifford Neuman.

Thesis (Ph.D.)--University of Southern California, 2005.

A zero-knowledge proof (ZKP) is an interactive proof between two parties: prover and verifier, where the prover proves the knowledge of a secret without revealing any information about the secret itself. ZKPs were first introduced in 1985 for identity verification systems and became powerful tools for many cryptographic applications. There has been a growing concern about the risk of identity theft in critical situations, like homeland security and e-commerce. ZKPs are the ideal solution to challenges in identification since they allow costumers to prove identities without exchanging sensitive information that may lead to identity theft. Other applications of ZKPs include smart cards, digital cash, anonymous communication, electronic wallets, electronic voting, multimedia security and digital watermarks.

ISBN: 9780542206085Subjects--Topical Terms:

626642
Computer Science.

One-round zero-knowledge proofs and their applications in cryptographic systems.
LDR:02969nam 2200289 a 45 001 972901
005 20110928
008 110928s2005 eng d
020 $a 9780542206085
035 $a (UnM)AAI3180486
035 $a AAI3180486
040 $a UnM $c UnM
100 1 $a Almuhammadi, Sultan. $3 1296867
245 1 0 $a One-round zero-knowledge proofs and their applications in cryptographic systems.
300 $a 118 p.
500 $a Adviser: Clifford Neuman.
500 $a Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3218.
502 $a Thesis (Ph.D.)--University of Southern California, 2005.
520 $a A zero-knowledge proof (ZKP) is an interactive proof between two parties: prover and verifier, where the prover proves the knowledge of a secret without revealing any information about the secret itself. ZKPs were first introduced in 1985 for identity verification systems and became powerful tools for many cryptographic applications. There has been a growing concern about the risk of identity theft in critical situations, like homeland security and e-commerce. ZKPs are the ideal solution to challenges in identification since they allow costumers to prove identities without exchanging sensitive information that may lead to identity theft. Other applications of ZKPs include smart cards, digital cash, anonymous communication, electronic wallets, electronic voting, multimedia security and digital watermarks.
520 $a Existing ZKPs are iterative in nature; their protocols require multiple communication rounds between parties. Due to the cost of iteration, practitioners see ZKPs as unsuitable in practice and therefore develop other tools to avoid using ZKPs. The proposed approach creates new protocols that allow the prover to prove knowledge of a secret without revealing it. The new approach, called a one-round zero-knowledge-proof, meets all the requirements of ZKPs, yet runs in a single round. The new approach substantially reduces the running-time complexity and communications cost. It eliminates the iteration cost and makes such proofs suitable for practical cryptographic systems for both governmental and commercial applications.
520 $a The focus of this dissertation is the theory of one-round ZKPs. It presents efficient and secure one-round ZKPs for several classical problems that are used in real life applications. It studies the performance of the proposed one-round ZKPs compared to the existing iterative ZKPs in terms of computation and communication costs. It presents a case study on an identity verification scheme that uses both the iterative ZKP and the new one-round ZKP to compare the results and show the advantages of the new approach.
590 $a School code: 0208.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 66-06B.
790 $a 0208
790 1 0 $a Neuman, Clifford, $e advisor
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3180486