Provably secure timed-release public key encryption

Cited 25 time in webofscience Cited 0 time in scopus
  • Hit : 577
  • Download : 0
A timed- release cryptosystem allows a sender to encrypt a message so that only the intended recipient can read it only after a specified time. We formalize the concept of a secure timed- release public- key cryptosystem and show that, if a third party is relied upon to guarantee decryption after the specified date, this concept is equivalent to identity- based encryption; this explains the observation that all known constructions use identity- based encryption to achieve timed- release security. We then give several provably- secure constructions of timed- release encryption: a generic scheme based on any identity- based encryption scheme, and two more efficient schemes based on the existence of cryptographically admissible bilinear mappings. The first of these is essentially as efficient as the Boneh- Franklin Identity- Based encryption scheme, and is provably secure and authenticated in the random oracle model; the final scheme is not authenticated but is provably secure in the standard model ( i. e., without random oracles).
Publisher
ASSOC COMPUTING MACHINERY
Issue Date
2008-03
Language
English
Article Type
Article
Citation

ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, v.11, no.2

ISSN
1094-9224
DOI
10.1145/1330332.1330336
URI
http://hdl.handle.net/10203/93245
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 25 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0