Abstract
Proxy cryptosystem was first proposed by Mambo and Okamoto, for the delegation of the power to decrypt ciphertexts. However, to our knowledge, there is no reasonable mode aimed at this cryptographic notion. In this paper, we first present a practical mode: proxy cryptosystem based on time segmentation. Under this mode, a secure model is proposed and a proxy cryptosystem is constructed. Our construction uses ideas from the HIBE scheme of Gentry and Silverberg, the FSPE scheme of Canetti et al. and the scheme of Fujisaki and Okamoto, and is proven to be secure based on the hardness of bilinear Diffie-Hellman assumption. At last, we give an identity based (ID-based) version of the proxy cryptosystem based on time segmentation.
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
Mambo, M., Okamoto, E.: Proxy cryptosystem: Delegation of a power to decrypt ciphertexts. IEICE Transaction on Fundaments of Electronics Communications and Computer Science E80-A/1, 54–63 (1997)
Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548–566. Springer, Heidelberg (2002)
Canetti, R., Halevi, S., Katz, J.: A Forward-Secure Public-Key Encryption Scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255–271. Springer, Heidelberg (2003)
Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption. IEICE Trans. fundamentals E83-A(1) (2000)
Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127–144. Springer, Heidelberg (1998)
Jakobsson, M.: On quorum controlled asymmetric proxy re-encryption. In: Proceedings of public key cryptography, pp. 112–121.
Wang, L., Cao, Z., Okamoto, E., Miao, Y., Okamoto, T.: Transformation-free Proxy Cryptosystems and Their Applications to Electronic Commerce. Infosecu 2004Â 92 (2004)
Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431–448. Springer, Heidelberg (1999)
Bellare, M., Yee, A.: Forward-security in private-key cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 1–18. Springer, Heidelberg (2003)
Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Computer and System Sciences 28, 270–299 (1984)
Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998)
Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Bellare, M., Rogaway, P.: Random oracle are practical: a paradiam for designing efficient protocols. In: First ACM Conference on Computer and Communications Security, ACM, New York (1993)
Zhou, Y., Cao, Z., Chai, Z.: Constructing Secure Proxy Cryptosystem, http://tdt.sjtu.edu.cn/YZ/ConstructingSecureProxyCryptosystem.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Y., Cao, Z., Chai, Z. (2005). Constructing Secure Proxy Cryptosystem. In: Feng, D., Lin, D., Yung, M. (eds) Information Security and Cryptology. CISC 2005. Lecture Notes in Computer Science, vol 3822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599548_13
Download citation
DOI: https://doi.org/10.1007/11599548_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30855-3
Online ISBN: 978-3-540-32424-9
eBook Packages: Computer ScienceComputer Science (R0)