License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.KiVS.2011.239
URN: urn:nbn:de:0030-drops-29818
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/2981/
Liebau, Nicolas C. ;
Mauthe, Andreas U. ;
Darlagiannis, Vasilios ;
Steinmetz, Ralf
Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?
Abstract
Trustworthy applications in fully decentralized systems require a trust anchor. This paper describes how such an anchor can be implemented efficiently in p2p systems. The basic concept is to use threshold cryptography in order to sign messages by a quorum of peers. The focus is put on advanced mechanisms to secure the shares of the secret key over time, using proactive secret sharing. This mechanism was researched in context of the token-based accounting scheme.
BibTeX - Entry
@InProceedings{liebau_et_al:OASIcs:2011:2981,
author = {Nicolas C. Liebau and Andreas U. Mauthe and Vasilios Darlagiannis and Ralf Steinmetz},
title = {{Does Proactive Secret Sharing Perform in Peer-to-Peer Systemsl}},
booktitle = {17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011) },
pages = {239--244},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-27-9},
ISSN = {2190-6807},
year = {2011},
volume = {17},
editor = {Norbert Luttenberger and Hagen Peters},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/2981},
URN = {urn:nbn:de:0030-drops-29818},
doi = {10.4230/OASIcs.KiVS.2011.239},
annote = {Keywords: peer-to-peer, proactive secret sharing}
}
|
Keywords: |
|
peer-to-peer, proactive secret sharing |
|
Collection: |
|
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011) |
|
Issue Date: |
|
2011 |
|
Date of publication: |
|
25.02.2011 |
