On ASGS framework: general requirements and an example of implementation
- 23 Downloads
In the paper we propose a general, abstract framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying Secret Sharing Scheme (SSS). ASGS allows to prevent the Dealer from knowing the secret. The Basic Property Conjecture (BPC) forms the base of the framework. Due to the level of abstraction, results are portable into the realm of quantum computing.
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 emphasis on PVSS and pre-positioned secret sharing. Finally, we illustrate framework with practical implementation.
Key wordsSecret sharing Security protocols Dependable systems Authentication management
Unable to display preview. Download preview PDF.
- Anderson, R., 2001. Security Engineering—A Guide to Building Dependable Distributed Systems. John Wiley & Sons, New York.Google Scholar
- Blakley, G.R., 1979. Safeguarding Cryptographic Keys. Proceedings AFIPS 1979 National Computer Conference, p.313–317.Google Scholar
- Budd, T., 1997. The Introduction to Object-Oriented Programming. Addison-Wesley, Reading.Google Scholar
- Desmedt, Y., Frankel, Y., 1989. Threshold cryptosystems. Crypto’89. LNCS, 435:307–315.Google Scholar
- Ito, M., Saito, A., Nishizeki, T., 1987. Secret Sharing Scheme Realizing General Access Structure. Proc. IEEE Globecom’87, p.99–102.Google Scholar
- Kulesza, K., Kotulski, Z., 2002. On Secret Sharing Schemes with Extended Capabilities. RCMIS’02, 1:79–88.Google Scholar
- Kulesza, K., Kotulski, Z., Pieprzyk, J., 2002. On Alternative Approach for Verifiable Secret Sharing. Esorics’02. Available from IACR’s Cryptology ePrint Archive (http://eprint.iacr.org/).
- Kulesza, K., Kotulski, Z., 2003. On Automatic Secret Generation and Sharing for Karin-Greene-Hellman Scheme. In: Soldek, J., Drobiazgiewicz, L. (Eds.), Artificial Intelligence and Security in Computing Systems Advanced Computer Systems. Kluwer Academic Publisher, Boston, p.281–292.Google Scholar
- Li, C., Hwang, T., Lee, N., 1994. (t,n) threshold signature schemes based on discrete logarithm. Eurocrypt’94. LNCS, 950: 191–200.Google Scholar