10.4230/OASICS.KIVS.2011.239
Liebau, Nicolas C.
Nicolas C.
Liebau
Mauthe, Andreas U.
Andreas U.
Mauthe
Darlagiannis, Vasilios
Vasilios
Darlagiannis
Steinmetz, Ralf
Ralf
Steinmetz
Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Article
peer-to-peer
proactive secret sharing
Luttenberger, Norbert
Norbert
Luttenberger
Peters, Hagen
Hagen
Peters
2011
2011-02-25
2011-02-25
2011-02-25
en
urn:nbn:de:0030-drops-29818
10.4230/OASIcs.KiVS.2011
978-3-939897-27-9
2190-6807
10.4230/OASIcs.KiVS.2011
OASIcs, Volume 17, KiVS 2011
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)
2012
17
28
239
244
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Luttenberger, Norbert
Norbert
Luttenberger
Peters, Hagen
Hagen
Peters
2190-6807
Open Access Series in Informatics (OASIcs)
2011
17
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
6 pages
229109 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
OASIcs, Vol. 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011), pages 239-244