東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Efficient Data Structures for Certificate Transparency.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Efficient Data Structures for Certificate Transparency./
作者:	Singh, Abhishek.
面頁冊數:	1 online resource (59 pages)
附註:	Source: Masters Abstracts International, Volume: 83-06.
Contained By:	Masters Abstracts International83-06.
標題:	Construction. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28843313click for full text (PQDT)
ISBN:	9798496585514

Efficient Data Structures for Certificate Transparency.
Singh, Abhishek.

Efficient Data Structures for Certificate Transparency. - 1 online resource (59 pages)

Source: Masters Abstracts International, Volume: 83-06.

Thesis (M.Tech)--Indian Statistical Institute - Kolkata, 2016.

Includes bibliographical references

Browsers can detect malicious websites that are provisioned with forged or fake TLS/SSL certificates. However, they are not so good at detecting malicious websites if they are provisioned with mistakenly issued certificates or certificates that have been issued by a certificate authority (CA) which is compromised. Google proposed certificate transparency which is an open framework to monitor and audit certificates in real time. However, the size of a proof is logarithmic in the number of certificates. This large proof size consumes a lot of bandwidth. Apart from this drawback, revocation is not handled. In NDSS 2014, Ryan extended certificate transparency to handle efficient revocation of a certificate. However, the size of a proof still remains logarithmic in the number of certificates.We have developed and extended the concept of certificate transparency introduced by Google and its enhanced version proposed by Ryan. We have introduced bilinear-map accumulators (in the context of certificate transparency) in order to provide proofs of constant size irrespective of the number of certificates. Our scheme has many desirable properties like efficient revocation, constant size proofs, low verification cost and update costs comparable to the existing schemes. We provide proofs of security and evaluate the performance of our scheme.

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

Mode of access: World Wide Web

ISBN: 9798496585514Subjects--Topical Terms:

3561054
Construction.
Index Terms--Genre/Form:

542853
Electronic books.

Efficient Data Structures for Certificate Transparency.
LDR:02608nmm a2200373K 4500 001 2358898
005 20230830051513.5
006 m o d
007 cr mn ---uuuuu
008 241011s2016 xx obm 000 0 eng d
020 $a 9798496585514
035 $a (MiAaPQ)AAI28843313
035 $a (MiAaPQ)ISIKolkata6495
035 $a AAI28843313
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Singh, Abhishek. $3 901091
245 1 0 $a Efficient Data Structures for Certificate Transparency.
264 0 $c 2016
300 $a 1 online resource (59 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: Masters Abstracts International, Volume: 83-06.
500 $a Advisor: Ruj, Sushmita.
502 $a Thesis (M.Tech)--Indian Statistical Institute - Kolkata, 2016.
504 $a Includes bibliographical references
520 $a Browsers can detect malicious websites that are provisioned with forged or fake TLS/SSL certificates. However, they are not so good at detecting malicious websites if they are provisioned with mistakenly issued certificates or certificates that have been issued by a certificate authority (CA) which is compromised. Google proposed certificate transparency which is an open framework to monitor and audit certificates in real time. However, the size of a proof is logarithmic in the number of certificates. This large proof size consumes a lot of bandwidth. Apart from this drawback, revocation is not handled. In NDSS 2014, Ryan extended certificate transparency to handle efficient revocation of a certificate. However, the size of a proof still remains logarithmic in the number of certificates.We have developed and extended the concept of certificate transparency introduced by Google and its enhanced version proposed by Ryan. We have introduced bilinear-map accumulators (in the context of certificate transparency) in order to provide proofs of constant size irrespective of the number of certificates. Our scheme has many desirable properties like efficient revocation, constant size proofs, low verification cost and update costs comparable to the existing schemes. We provide proofs of security and evaluate the performance of our scheme.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Construction. $3 3561054
650 4 $a Software. $2 gtt. $3 619355
650 4 $a Boolean. $3 3683493
650 4 $a Public Key Infrastructure. $3 3691848
650 4 $a Web browsers. $3 3697281
650 4 $a Maps. $3 544078
650 4 $a Trust. $3 536251
650 4 $a Third party. $3 3564370
650 4 $a Algorithms. $3 536374
650 4 $a Privacy. $3 528582
650 4 $a Performance evaluation. $3 3562292
650 4 $a Crowdsourcing. $3 3377825
650 4 $a Servers. $3 3220915
650 4 $a Prime numbers. $3 3699445
650 4 $a Digital signatures. $3 1085466
650 4 $a Civil engineering. $3 860360
650 4 $a Computer science. $3 523869
650 4 $a Engineering. $3 586835
650 4 $a Web studies. $3 2122754
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0543
690 $a 0984
690 $a 0501
690 $a 0537
690 $a 0646
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Indian Statistical Institute - Kolkata. $3 3687310
773 0 $t Masters Abstracts International $g 83-06.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28843313 $z click for full text (PQDT)