On ASGS framework: general requirements and an example of implementation

From MaRDI portal
Publication:2644567

DOI10.1631/JZUS.2007.A0511zbMATH Open1129.68439arXivmath/0211269OpenAlexW1499833820MaRDI QIDQ2644567FDOQ2644567


Authors: Kamil Kulesza, Z. Kotulski Edit this on Wikidata


Publication date: 3 September 2007

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

Abstract: In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to prevent the dealer from knowing the secret or even to eliminate him at all. Two situations are discussed. First concerns simultaneous generation and sharing of the random, prior nonexistent secret. Such a secret remains unknown until it is reconstructed. Next, we propose the framework for automatic sharing of a known secret. In this case the dealer does not know the secret and the secret owner does not know the shares. We present opportunities for joining ASGS with other extended capabilities, with special emphasize on PVSS and proactive secret sharing. Finally, we illustrate framework with practical implementation. Keywords: cryptography, secret sharing, data security, extended capabilities, extended key verification protocol


Full work available at URL: https://arxiv.org/abs/math/0211269




Recommendations




Cites Work


Uses Software





This page was built for publication: On ASGS framework: general requirements and an example of implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644567)