File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A DFA-based functional proxy re-encryption scheme for secure public cloud data sharing

TitleA DFA-based functional proxy re-encryption scheme for secure public cloud data sharing
Authors
Keywordsfunctional proxy re-encryption
chosen-ciphertext security
Functional encryption
Issue Date2014
Citation
IEEE Transactions on Information Forensics and Security, 2014, v. 9, n. 10, p. 1667-1680 How to Cite?
Abstract© 2014 IEEE. In this paper, for the first time, we define a general notion for proxy re-encryption (PRE), which we call deterministic finite automata-based functional PRE (DFA-based FPRE). Meanwhile, we propose the first and concrete DFA-based FPRE system, which adapts to our new notion. In our scheme, a message is encrypted in a ciphertext associated with an arbitrary length index string, and a decryptor is legitimate if and only if a DFA associated with his/her secret key accepts the string. Furthermore, the above encryption is allowed to be transformed to another ciphertext associated with a new string by a semitrusted proxy to whom a re-encryption key is given. Nevertheless, the proxy cannot gain access to the underlying plaintext. This new primitive can increase the flexibility of users to delegate their decryption rights to others. We also prove it as fully chosen-ciphertext secure in the standard model.
Persistent Identifierhttp://hdl.handle.net/10722/280553
ISSN
2023 Impact Factor: 6.3
2023 SCImago Journal Rankings: 2.890
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLiang, Kaitai-
dc.contributor.authorAu, Man Ho-
dc.contributor.authorLiu, Joseph K.-
dc.contributor.authorSusilo, Willy-
dc.contributor.authorWong, Duncan S.-
dc.contributor.authorYang, Guomin-
dc.contributor.authorPhuong, Tran Viet Xuan-
dc.contributor.authorXie, Qi-
dc.date.accessioned2020-02-17T14:34:20Z-
dc.date.available2020-02-17T14:34:20Z-
dc.date.issued2014-
dc.identifier.citationIEEE Transactions on Information Forensics and Security, 2014, v. 9, n. 10, p. 1667-1680-
dc.identifier.issn1556-6013-
dc.identifier.urihttp://hdl.handle.net/10722/280553-
dc.description.abstract© 2014 IEEE. In this paper, for the first time, we define a general notion for proxy re-encryption (PRE), which we call deterministic finite automata-based functional PRE (DFA-based FPRE). Meanwhile, we propose the first and concrete DFA-based FPRE system, which adapts to our new notion. In our scheme, a message is encrypted in a ciphertext associated with an arbitrary length index string, and a decryptor is legitimate if and only if a DFA associated with his/her secret key accepts the string. Furthermore, the above encryption is allowed to be transformed to another ciphertext associated with a new string by a semitrusted proxy to whom a re-encryption key is given. Nevertheless, the proxy cannot gain access to the underlying plaintext. This new primitive can increase the flexibility of users to delegate their decryption rights to others. We also prove it as fully chosen-ciphertext secure in the standard model.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Information Forensics and Security-
dc.subjectfunctional proxy re-encryption-
dc.subjectchosen-ciphertext security-
dc.subjectFunctional encryption-
dc.titleA DFA-based functional proxy re-encryption scheme for secure public cloud data sharing-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TIFS.2014.2346023-
dc.identifier.scopuseid_2-s2.0-84907468655-
dc.identifier.volume9-
dc.identifier.issue10-
dc.identifier.spage1667-
dc.identifier.epage1680-
dc.identifier.isiWOS:000342383700005-
dc.identifier.issnl1556-6013-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats