You are looking at a specific version 20120320:060920 of this paper. See the latest version.

Paper 2011/361

The Exact Security of a Stateful IBE and New Compact Stateful PKE Schemes

S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan

Abstract

Recently, Baek et al. proposed a stateful identity based encryption scheme with compact ciphertext and commented that the security of the scheme can be reduced to the Computational Bilinear Diffie Hellman (CBDH) problem. In this paper, we formally prove that the security of the stateful identity based encryption scheme by Baek et al. cannot be reduced to the CBDH problem. In fact, we show that the challenger will confront the Y-Computational problem while providing the decryption oracle access to the adversary. We provide the exact and formal security proof for the scheme, assuming the hardness of the Gap Bilinear Diffie Hellman (GBDH) problem. We also propose two new stateful public key encryption scheme with ciphertext verifiability. Our schemes offer more compact ciphertext when compared to all existing stateful public key encryption schemes with ciphertext verifiability. We have proved all the schemes in the random oracle model.

Note: The previous draft had some subtle defects and it was pointed out by Dr. Gregory M. Zaverucha. We thank him for pointing out the defect in the previous draft, which helped us to improve the result.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Stateful Identity Based EncryptionAdaptive Chosen Ciphertext (CCA)Provable SecurityCompact Ciphertext withwithout Ciphertext VerificationRandom Oracle model.
Contact author(s)
ssreevivek @ gmail com,sharmioshin @ gmail com
History
2012-03-20: last of 3 revisions
2011-07-06: received
See all versions
Short URL
https://ia.cr/2011/361
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.