EFFICIENT LARGE-SCALE DISTRIBUTED KEY GENERATION AGAINST BURST INTERRUPTION

Jheng-Ru Ou, Shi-Chun Tsai, Wen-Guey Tzeng

2007

Abstract

A distributed key generation scheme allows the key servers to distributively share a secret key and then compute the corresponding public key. Canny and Sorkin (Canny and Sorkin, 2004) proposed a probabilistic threshold distributed key generation scheme that is suitable for the case that the number of key servers is large. The communication cost of their scheme is much less than that of previous schemes. Nevertheless, it is possible to improve their scheme in some aspects. In this paper we employ the randomness technique to cope with some problems encountered by their scheme. Our contribution is twofold. Firstly, our scheme is secure against a large cluster of dishonest key servers. Secondly, our scheme has better performance in some aspects. We support this point by a series of simulation experiments. As a result, our scheme and Canny and Sorkin’s scheme can be used in different situations.

References

  1. Canny, J. and Sorkin, S. (2004). Practical large-scale distributed key generation. In Proceedings of Advances in Cryptology - EUROCRYPT 7804, volume 3027 of LNCS, pages 138-152. Springer-Verlag.
  2. Chu, C.-K. and Tzeng, W.-G. (2002). Distributed key generation as a component of an integrated protocol. In Proceedings of the 4th Information and Communications Security - ICICS 7802, volume 2513 of LNCS, pages 411-421. Springer-Verlag.
  3. Feldman, P. (1987). A practical scheme for non-interactive verifiable secret sharing. In 28th Annual Symposium on Foundations of Computer Science (FOCS), pages 427-437. IEEE.
  4. Gennaro, R., Jarecki, S., Krawczyk, H., and Rabin, T. (1999). Secure distributed key generation for discretelog based cryptosystems. In Proceedings of Advances in Cryptology - EUROCRYPT 7899, volume 1592 of LNCS, pages 295-310. Springer-Verlag.
  5. Pedersen, T. P. (1991a). Non-interactive and informationtheoretic secure verifiable secret sharing. In Proceedings of Advances in Cryptology - CRYPTO 7891, volume 576 of LNCS, pages 129-140. Springer-Verlag.
  6. Pedersen, T. P. (1991b). A threshold cryptosystem without a trusted party. In Proceedings of Advances in Cryptology - EUROCRYPT 7891, volume 547 of LNCS, pages 522-526. Springer-Verlag.
  7. Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11):612-613.
Download


Paper Citation


in Harvard Style

Ou J., Tsai S. and Tzeng W. (2007). EFFICIENT LARGE-SCALE DISTRIBUTED KEY GENERATION AGAINST BURST INTERRUPTION . In Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007) ISBN 978-989-8111-12-8, pages 197-203. DOI: 10.5220/0002122201970203


in Bibtex Style

@conference{secrypt07,
author={Jheng-Ru Ou and Shi-Chun Tsai and Wen-Guey Tzeng},
title={EFFICIENT LARGE-SCALE DISTRIBUTED KEY GENERATION AGAINST BURST INTERRUPTION},
booktitle={Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)},
year={2007},
pages={197-203},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002122201970203},
isbn={978-989-8111-12-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)
TI - EFFICIENT LARGE-SCALE DISTRIBUTED KEY GENERATION AGAINST BURST INTERRUPTION
SN - 978-989-8111-12-8
AU - Ou J.
AU - Tsai S.
AU - Tzeng W.
PY - 2007
SP - 197
EP - 203
DO - 10.5220/0002122201970203