國立虎尾科技大學 |

登入

回首頁

Efficient asynchronous accumulators ...

ProQuest Information and Learning Co.

Efficient asynchronous accumulators for distributed PKI.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Efficient asynchronous accumulators for distributed PKI./
作者:	Yakoubov, Sophia.
面頁冊數:	1 online resource (37 pages)
附註:	Source: Masters Abstracts International, Volume: 55-03.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9781339490748

Efficient asynchronous accumulators for distributed PKI.
Yakoubov, Sophia.

Efficient asynchronous accumulators for distributed PKI. - 1 online resource (37 pages)

Source: Masters Abstracts International, Volume: 55-03.

Thesis (M.S.)--Boston University, 2016.

Includes bibliographical references

Cryptographic accumulators are a tool for compact set representation and secure set membership proofs. When an element is added to a set by means of an accumulator, a membership witness is generated. This witness can later be used to prove the membership of the element. Typically, the membership witness has to be synchronized with the accumulator value, and to be updated every time another element is added to the accumulator. In this work we propose an accumulator that, unlike any prior scheme, does not require strict synchronization.

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

Mode of access: World Wide Web

ISBN: 9781339490748Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Efficient asynchronous accumulators for distributed PKI.
LDR:02107ntm a2200325K 4500 001 912764
005 20180608130007.5
006 m o u
007 cr mn||||a|a||
008 190606s2016 xx obm 000 0 eng d
020 $a 9781339490748
035 $a (MiAaPQ)AAI10015216
035 $a (MiAaPQ)bu:11679
035 $a AAI10015216
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Yakoubov, Sophia. $3 1185281
245 1 0 $a Efficient asynchronous accumulators for distributed PKI.
264 0 $c 2016
300 $a 1 online resource (37 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: 55-03.
500 $a Adviser: Leonid Reyzin.
502 $a Thesis (M.S.)--Boston University, 2016.
504 $a Includes bibliographical references
520 $a Cryptographic accumulators are a tool for compact set representation and secure set membership proofs. When an element is added to a set by means of an accumulator, a membership witness is generated. This witness can later be used to prove the membership of the element. Typically, the membership witness has to be synchronized with the accumulator value, and to be updated every time another element is added to the accumulator. In this work we propose an accumulator that, unlike any prior scheme, does not require strict synchronization.
520 $a In our construction a membership witness needs to be updated only a logarithmic number of times in the number of subsequent element additions. Thus, an out-of-date witness can be easily made current. Vice versa, a verifier with an out-of-date accumulator value can still verify a current membership witness. These properties make our accumulator construction uniquely suited for use in distributed applications, such as blockchain-based public key infrastructures.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Boston University. $b Computer Science. $3 1179647
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10015216 $z click for full text (PQDT)

筆 0 讀者評論

多媒體

評論

新增評論分享你的心得

Export

取書館別