2019
DOI: 10.1016/j.ins.2019.05.059
|View full text |Cite
|
Sign up to set email alerts
|

FSSE: Forward secure searchable encryption with keyed-block chains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(18 citation statements)
references
References 26 publications
0
16
0
Order By: Relevance
“…Subsequently, the first scheme with good communication costs and computational complexity was proposed by Bost [12], which hides the relationship between document identifiers and keywords through trapdoors replacement in the indexing process and does not disclose the information of previously queried files when new files are injected. Subsequently, scholars have successively proposed various forward secure searchable encryption schemes [18][19][20] on the basis of the oϕoς scheme. e application of the FSSE scheme has also become a research hotspot recently.…”
Section: Forward Secure Searchable Encryption (Fsse)mentioning
confidence: 99%
“…Subsequently, the first scheme with good communication costs and computational complexity was proposed by Bost [12], which hides the relationship between document identifiers and keywords through trapdoors replacement in the indexing process and does not disclose the information of previously queried files when new files are injected. Subsequently, scholars have successively proposed various forward secure searchable encryption schemes [18][19][20] on the basis of the oϕoς scheme. e application of the FSSE scheme has also become a research hotspot recently.…”
Section: Forward Secure Searchable Encryption (Fsse)mentioning
confidence: 99%
“…There are also many scholars who have developed many security algorithms according to the characteristics of blockchain. Wei's team has proposed a forward security SSE scheme based on blockchain [33], which is proved to be four times faster than the latest forward private SSE scheme through experiments. Phan's team proposed an incremental hash function [34] based on the block link through the research of the blockchain ledger, which can calculate the hash value of the update message faster, but there will be some conflicts with the original hash function.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In order to study similar techniques with higher performance and broader application scopes, Wei Y et.al [7] propose FSSE, which uses symmetric primitive to replace asymmetric primitive, performs better than Sophos. In addition, FSSE use KBBC to break Sophos's dependence on token generation rule, expands its application scope.…”
Section: B Need Of Forward Privacymentioning
confidence: 99%
“…In order to store this structure, the server needs to spend extra storage space. Therefore, we think that we can use symmetric encryption primitives to achieve forward privacy just like [7], at the same time, we use simple data structure to reduce the storage space of the server data and improve the search efficiency. Therefore, we propose a state chain structure of symmetric encryption primitives, which does not use complex data structure, but only uses symmetric encryption primitives to achieve forward privacy.…”
Section: Motivationmentioning
confidence: 99%
See 1 more Smart Citation