Identity-Based Proxy Cryptosystems with Revocability and Hierarchical Confidentialities
スポンサーリンク
概要
- 論文の詳細を見る
Proxy cryptosystems are classified into proxy decryption systems and proxy re-encryption systems on the basis of a proxy's role. In this paper, we propose an ID-based proxy cryptosystem with revocability and hierarchical confidentialities. In our scheme, on receiving a ciphertext, the proxy has the rights to perform the following three tasks according to the message confidentiality levels of the sender's intention: (1) to decrypt the ciphertext on behalf of the original decryptor; (2) to re-encrypt the ciphertext such that another user who is designated by the original decryptor can learn the message; (3) to do nothing except for forwarding the ciphertext to the original decryptor. Our scheme supports revocability in the sense that it allows proxy's decryption and re-encryption rights to be revoked even during the valid period of the proxy key without changing the original decryptor's public information. We prove that our proposal is indistinguishable against chosen identity and plaintext attacks in the standard model. We also show how to convert it into a system against chosen identity and ciphertext attacks by using the Fujisaki-Okamoto transformation.
- 2012-01-01
著者
-
Wang Lihua
Network Security Res. Inst. National Inst. Of Information And Communications Technol.
-
Okamoto Eiji
Graduate School Of Systems And Information Engineering Univ. Of Tsukuba
-
Mambo Masahiro
Faculty Of Electrical And Computer Engineering Institute Of Science And Engineering Kanazawa University
-
Wang Lihua
Network Security Research Institute National Institute Of Information And Communications Technology
-
WANG Licheng
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications
関連論文
- An ID-SP-M4M Scheme and Its Security Analysis(Signatures,Cryptography and Information Security)
- Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses(Protocol, Cryptography and Information Security)
- A Share-Correctable Protocol for the Shamir Threshod Scheme and Its Application to Participant Enrollment (特集 多様な社会的責任を担うコンピュータセキュリティ技術)
- A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment
- Sender Authenticated Key Agreements without Random Oracles
- Universal ηT pairing algorithm over arbitrary extension degree (ワイドバンドシステム)
- Universal ηT pairing algorithm over arbitrary extension degree (情報セキュリティ)
- Universal ηT pairing algorithm over arbitrary extension degree (情報理論)
- Anonymous On-Demand Position-based Routing in Mobile Ad-hoc Networks (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
- Solving a 676-Bit Discrete Logarithm Problem in GF(3^)
- Identity-Based Proxy Cryptosystems with Revocability and Hierarchical Confidentialities
- Anonymous On-Demand Position-based Routing in Mobile Ad-hoc Networks
- A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment
- Anonymous On-Demand Position-based Routing in Mobile Ad-hoc Networks