Remarks on IBE Scheme of Wang and Cao
نویسندگان
چکیده
In this paper we analyze and find an anomaly in the security proof of the identity-based encryption (IBE) scheme fullM-IBE of Wang and Cao [9], which is based on mBDHP. Here we give another proof for fullM-IBE which is based on Bilinear Diffie-Hellman Problem (BDHP). We also obtain a tightness improvement using a stronger assumption, namely, the Bilinear Inverse Dicision Diffie-Hellman problem (BIDDHP). Key-Words: Public-Key Encryption, Identity-Based Encryption (IBE), IND-ID-CCA attack, BDHP, BIDDHP, Random Oracle.
منابع مشابه
Investigations on Simultaneously Secure IBE Scheme and Security Proofs under RO and Non-RO Model
Abstract: Investigations on the proof theory and methods of simultaneously provable security under multi-model helps to construct formally secure cryptographic scheme under multi-environments. Further research is provided on the construction of efficient IBE scheme and provable security under CCA model. Elementary investigations on pairing-based CCA secure IBE scheme which is provably secure ba...
متن کاملAn Expressive Attribute-based Signature Scheme without Random Oracles
Attribute-based signatures (ABS) is a new cryptographic primitive and can play a great role in attributebased access control systems. In ABS, a signer can choose its attributes satisfying a policy of a verifier to generate a valid signature without reveal its identity or attributes, while the signature assures that the message is endorsed by an individual owning attributes the policy requiring....
متن کاملOn the Role of PKG for Proxy Re-encryption in Identity Based Setting
In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption[3]. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice’s public key into one that can be opened under Bob’s decryption key. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE(Certificate Based Public Key Encryption) to IBE(Id...
متن کاملEfficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
In 2015, Hofheinz et al. [PKC, 2015] extended Chen and Wee’s almost-tight reduction technique for identity based encryptions (IBE) [CRYPTO, 2013] to the multi-instance, multi-ciphertext (MIMC, or multi-challenge) setting, where the adversary is allowed to obtain multiple challenge ciphertexts from multiple IBE instances, and gave the first almost-tightly secure IBE in this setting using composi...
متن کاملRemarks on some recent M. Borcut's results in partially ordered metric spaces
In this paper, some recent results established by Marin Borcut [M. Borcut, Tripled fixed point theorems for monotone mappings in partially ordered metric spaces, Carpathian J. Math. 28, 2 (2012), 207--214] and [M. Borcut, Tripled coincidence theorems for monotone mappings in partially ordered metric spaces, Creat. Math. Inform. 21, 2 (2012), 135--142] are generalized and improved, with much sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007