OASIcs.KiVS.2011.239.pdf
- Filesize: 223 kB
- 6 pages
Document
Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?
Authors
-
Part of:
Volume:
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-02-25
Cite As Get BibTex
Nicolas C. Liebau, Andreas U. Mauthe, Vasilios Darlagiannis, and Ralf Steinmetz. Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 239-244, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/OASIcs.KiVS.2011.239
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.
Subject Classification
Keywords
- peer-to-peer
- proactive secret sharing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads