Abstract
Group (or society) oriented cryptosystems are important in modern cryptography, they have wide application in areas such as group private communication and electronic commerce. Practical group oriented cryptosystems have been constructed using the techniques of secret sharing, but almost all such cryptosystems are based on threshold access structures, this is a great limitation to their application. In this paper, we consider group oriented cryptosystem based on vector space access strucures, a secure and practical group oriented cryptosystem based on vector space access structures is presented.
This work was supported by the Institute of Information Technology Assessment (IITA), Chonbuk National University, Korea, and the National Science Foundation of China under the grant No. 60373104.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120–127. Springer, Heidelberg (1988)
Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 305–315. Springer, Heidelberg (1990)
Frankel, Y.: A practical protocol for large group oriented networks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 56–61. Springer, Heidelberg (1990)
Wang, T.: Cryptosystem for group oriented cryptography. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 352–360. Springer, Heidelberg (1991)
Goldreich, O., Micali, S., Wigderson, A.: How to play an mental game. In: Proceedings of the Nineteenth ACM Symp, Theory of Computing, May 25-27, pp. 218–229 (1987)
Desmedt, Y.: Some Recent research aspects of threshold cryptography. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol. 1396, pp. 158–173. Springer, Heidelberg (1998)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Info. Theory 31(4), 469–472 (1985)
Brickell, E.F.: Some ideal secret sharing schemes. The Journal of Combinatorial Mathematics and Combinatorial Computing 6, 105–113 (1989)
Simmons, G.J.: How to (really) Share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390–448. Springer, Heidelberg (1990)
Jackson, W., Martin, K.: Geometric Secret sharing schemes and their duals. Design, Codes, and Cryptography (4), 83–95 (1994)
Karchmer, M., Wigderson, A.: On Span Programs. In: Proc. of the 8th Annual IEEE Symposium on Structure in Complexity, pp. 102–111 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, W.P., Lee, M.H. (2004). Group Oriented Cryptosystems Based on Linear Access Structures. In: Lim, JI., Lee, DH. (eds) Information Security and Cryptology - ICISC 2003. ICISC 2003. Lecture Notes in Computer Science, vol 2971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24691-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-24691-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21376-5
Online ISBN: 978-3-540-24691-6
eBook Packages: Springer Book Archive