论文信息 - Transformation-free proxy cryptosystems and their applications to electronic commerce

Transformation-free proxy cryptosystems and their applications to electronic commerce

In this paper transformation-free proxy cryptosystems (TFP systems) are studied. The TFP system is a modification of the proxy cryptosystem introduced by Mambo and Okamoto [6] in which a ciphertext transformation by the original decryptor is necessary. The TFP system allows proxy decryptor to do decryption without any ciphertext transformation, so that it can release the original decryptor more efficiently from a large amount of decrypting operations. An active identity-based and a directory-based TFP systems based on pairings are proposed. Furthermore, two applications of directory-based TFP system in electronic commerce are also investigated.

Zhenfu Cao | Takeshi Okamoto | Eiji Okamoto | Ying Miao | Lihua Wang

[1] Eiji Okamoto,et al. Proxy signatures for delegating signing operation , 1996, CCS '96.

[2] Liqun Chen,et al. Applications of Multiple Trust Authorities in Pairing Based Cryptosystems , 2002, InfraSec.

[3] L. Washington. Elliptic Curves: Number Theory and Cryptography , 2003 .

[4] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[5] M. Mambo,et al. Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts (Special Section on Cryptography and Information Security) , 1997 .

[6] Florian Hess,et al. Efficient Identity Based Signature Schemes Based on Pairings , 2002, Selected Areas in Cryptography.

[7] Antoine Joux,et al. The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems , 2002, ANTS.

[8] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[9] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.