Generalized threshold cryptosystems
In a threshold cryptosystem, one can send an encrypted message to a group without knowing the internal secret sharing policy of the group. The encrypted ciphertext can only be deciphered by some users of the group according to the secret sharing policy. In this paper, we propose solutions to handle the generalized secret sharing policy. In addition, we investigate two different models for the group: one with a mutually trusted party in the group and the other one without.
Unable to display preview. Download preview PDF.
- O. Goldreich, S. Micali, and A Wigderson. How to play any mental game. In Proceedings of the Nineteenth ACM Symp. Theory of Computing, STOC, pp. 218–229, May 25–27, 1987.Google Scholar
- Y. Desmedt. Society and group oriented cryptography: a new concept. In Advances in Cryptology, Proc. of Crypto '87, pp. 120–127, August 16–20, 1988.Google Scholar
- Y Frankel. A practical protocol for large group oriented networks. To appear in: Advances in Cryptology, Proc. of Eurocrypt '89, April, 1989.Google Scholar
- Y. Desmedt, and Y. Frankel. Threshold cryptosystem. In Advances in Cryptology, Proc. of Crypto '89, pp. 307–315, August 20–24, 1989.Google Scholar
- J. Benaloh, and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology, Proc. of Crypto '88, pp. 27–35, August 21–25, 1988.Google Scholar
- I. Ingemarsson, and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. To appear in: Advances in Cryptology, Proc. of Eurocrypt '90, May 21–24, 1990.Google Scholar