Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation
Proceedings of the 13th ACM conference on Computer and communications security
Using hash functions as a hedge against chosen ciphertext attack
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A forward-secure public-key encryption scheme
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Boneh-Franklin identity based encryption revisited
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A secure unidirectional proxy re-encryption using identity and secret key exchange
Proceedings of the 47th Annual Southeast Regional Conference
Generic Construction of Stateful Identity Based Encryption
ISC '09 Proceedings of the 12th International Conference on Information Security
Practical ID-based encryption for wireless sensor network
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
On shortening ciphertexts: new constructions for compact public key and stateful encryption schemes
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Hi-index | 0.00 |
In this paper, we first present the notion of stateful identity-based encryption (IBE) and then extend standard security definitions for IBE to the stateful setting. After that, we demonstrate a concrete stateful IBE scheme, whose security meets the strongest definition in the setting in random oracle model, and whose encryption and decryption are very efficient, compared to existing IBEs: one pairing each for encryption and decryption.