Abstract
Proxy authorization makes it possible to entrust the right of signing or making decisions to other parties. This paper analyzes the basic principles and security problems of proxy authorization schemes and presents three proxy authorization schemes based on elliptic curves cryptosystem. In the first multi-party proxy authorization scheme, a group of n members can cooperate to entrust their right, and the authorizing right can be supervised by secret sharing mechanism. In the second multicast proxy authorization scheme, the members can entrust their right in multicast mode. The multicasting design strategy prevents coalition attack, avoids the problem of generalized signature forgery. In the last conditionally anonymous scheme, the identity blinding algorithm enables the proxy signer to be anonymous and the anonymity can also be revoked if necessary. This design strategy avoids the misuse of proxy authorization and renders effective supervision on signature entrusting and proxy signing.
This is a preview of subscription content, log in via an institution to check access.
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
Nakanishi, T., Tao, M.: A Group Signature Scheme Committing the Group. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 73–84. Springer, Heidelberg (2002)
Huang, Z.: Research on Digital Signature with Additional Properties. Xidian University, Xi’an (2005)
Zhou, X.: Dynamic Group Signature with Forward Security and Its Application. In: Proceeding of the Sixth International Conference on Grid and Cooperative Computing GCC 2007, pp. 473–480. IEEE Press, Piscataway (2007)
Avanzi, R.M.: Aspects of Hyper-elliptic Curves over Large Prime Fields in Software Implementations. In: International Association for Cryptology Research 2004, pp. 148–162. Springer, Heidelberg (2004)
Hui-Xian, L., Chun-tian, C.: A New (t, n)-threshold Multi-secret Sharing Scheme. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y.-m., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS, vol. 3802, pp. 421–426. Springer, Heidelberg (2005)
Park, H.-U., Lee, I.-Y.: A digital nominative proxy signature scheme for mobile communication. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 451–455. Springer, Heidelberg (2001)
Zdzislaws, H., Knap, M.M.: Research on Pre-processing and Post-processing of Data in the Process of Creation Quasi-optimal Decision Trees. Intelligence Methods (11), 13–15 (2002)
Ting-Yi, C., Chou-Chen, Y., Min-Shiang, H.: A threshold signature scheme for group communications without a shared distribution center. Future Generation Computer Systems 20(6), 1013–1021 (2004)
Abe, M., Ohkubo, M., Suzuki, K.: 1 out of n Signature from a Variety of Keys. In: Advances in Cryptology-ASIACRYPT 2002, pp. 415–423. Springer, Heidelberg (2002)
Hwa-Ching, H., Tung-Shou, C., Yu-Hsuen, L.: The ringed shadow image technology of visual cryptography by applying diverse rotating angles to bide the secret sharing. In: IEEE International Conference on Networking, Sensing and Control, 2004, vol. (2), pp. 996–1001. IEEE Press, Piscataway (2004)
Tochikubo, K., Uyematsu, T., Matsumoto, R.: Efficient Secret Sharing Schemes Based on Authorized Subsets. IEICE Transactions Special Section on Cryptography and Information Security E88-A(1), 322–326 (2005)
Hwang, M.S., Lin, E.J., Lin, I.C.: A practical (t,n) threshold proxy signature scheme based on the RSA cryptosystem. IEEE Transactions on Knowledge and Data Engering 15(5), 1552–1560 (2003)
Bellare, M., Micciancio, D., Warinschi, B.: Foundations of Group Signatures: Formal Denitions, Simpli¯ed Requirements, and a Construction based on General Assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656. Springer, Heidelberg (2003)
Malkin, T., Obana, S., Yung, M.: The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 306–322. Springer, Heidelberg (2004)
Kobara, K., Imai, H.: On the channel capacityof narrow-band subliminal channels. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 309–323. Springer, Heidelberg (1999)
Park, H.U., Lee, I.Y.: A Digital Nominative Proxy Signature Scheme for Mobile Communications. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 451–455. Springer, Heidelberg (2001)
Chang, T.-Y., Yang, C.-C., Hwang, M.-S.: Cryptanalysis of publicly veriableauthenticated encryption. IEICE Transactions on Fundamental E87-A(6), 1645–1646 (2004)
Zhang, F.G., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)
Fan, H., Feng, D.: Theory and Method of Secure Protocols. Science Press (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Zhou, X., Su, Y., Wei, P. (2009). Further Study on Proxy Authorization and Its Scheme. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02469-6_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-02469-6_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02468-9
Online ISBN: 978-3-642-02469-6
eBook Packages: Computer ScienceComputer Science (R0)