Gotowe bibliografie tematyczne / Dynamic Searchable Symmetric Encryption / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Dynamic Searchable Symmetric Encryption.

Artykuły w czasopismach na temat „Dynamic Searchable Symmetric Encryption”

Autor: Grafiati

Data publikacji: 6 września 2023

Data aktualizacji: 19 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Dynamic Searchable Symmetric Encryption”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

Du, Ruizhong, Yuqing Zhang, and Mingyue Li. "Database Padding for Dynamic Symmetric Searchable Encryption." Security and Communication Networks 2021 (December 31, 2021): 1–12. http://dx.doi.org/10.1155/2021/9703969.

Pełny tekst źródła

Streszczenie:

Dynamic symmetric searchable encryption (DSSE) that enables the search and update of encrypted databases outsourced to cloud servers has recently received widespread attention for leakage-abuse attacks against DSSE. In this paper, we propose a dynamic database padding method to mitigate the threat of data leakage during the update operation of outsourcing data. First, we introduce an outlier detection technology where bogus files are generated for padding according to the outlier factors, hiding the document information currently matching search keywords. Furthermore, we design a new index structure suitable for the padded database using the bitmap index to simplify the update operation of the encrypted index. Finally, we present an application scenario of the padding method and realize a forward and backward privacy DSSE scheme (named PDB-DSSE). The security analysis and simulation results show that our dynamic padding algorithm is suitable for DSSE scheme and PDB-DSSE scheme maintains the security and efficiency of the retrieval and update of the DSSE scheme.

Style APA, Harvard, Vancouver, ISO itp.

Guo, Chen, Xingbing Fu, Yaojun Mao, Guohua Wu, Fagen Li, and Ting Wu. "Multi-User Searchable Symmetric Encryption with Dynamic Updates for Cloud Computing." Information 9, no. 10 (2018): 242. http://dx.doi.org/10.3390/info9100242.

Pełny tekst źródła

Streszczenie:

With the advent of cloud computing, more and more users begin to outsource encrypted files to cloud servers to provide convenient access and obtain security guarantees. Searchable encryption (SE) allows a user to search the encrypted files without leaking information related to the contents of the files. Searchable symmetric encryption (SSE) is an important branch of SE. Most of the existing SSE schemes considered single-user settings, which cannot meet the requirements for data sharing. In this work, we propose a multi-user searchable symmetric encryption scheme with dynamic updates. This scheme is applicable to the usage scenario where one data owner encrypts sensitive files and shares them among multiple users, and it allows secure and efficient searches/updates. We use key distribution and re-encryption to achieve multi-user access while avoiding a series of issues caused by key sharing. Our scheme is constructed based on the index structure where a bit matrix is combined with two static hash tables, pseudorandom functions and hash functions. Our scheme is proven secure in the random oracle model.

Style APA, Harvard, Vancouver, ISO itp.

Kissel, Zachary A., and Jie Wang. "Generic Adaptively Secure Searchable Phrase Encryption." Proceedings on Privacy Enhancing Technologies 2017, no. 1 (2017): 4–20. http://dx.doi.org/10.1515/popets-2017-0002.

Pełny tekst źródła

Streszczenie:

Abstract In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement, and is proven secure under adaptively chosen query attacks (CQA2) in the random oracle model with an honest-but-curious adversary. To our knowledge, this is the first encrypted phrase search system that achieves CQA2 security. Moreover, we demonstrate that our document collection preprocessing algorithm allows us to extend a dynamic SSE construction so that it supports phrase queries. We also provide a compiler theorem which transforms any CQA2-secure SSE construction for keyword queries into a CQA2-secure SSE construction that supports phrase queries.

Style APA, Harvard, Vancouver, ISO itp.

Etemad, Mohammad, Alptekin Küpçü, Charalampos Papamanthou, and David Evans. "Efficient Dynamic Searchable Encryption with Forward Privacy." Proceedings on Privacy Enhancing Technologies 2018, no. 1 (2018): 5–20. http://dx.doi.org/10.1515/popets-2018-0002.

Pełny tekst źródła

Streszczenie:

Abstract Searchable symmetric encryption (SSE) enables a client to perform searches over its outsourced encrypted files while preserving privacy of the files and queries. Dynamic schemes, where files can be added or removed, leak more information than static schemes. For dynamic schemes, forward privacy requires that a newly added file cannot be linked to previous searches. We present a new dynamic SSE scheme that achieves forward privacy by replacing the keys revealed to the server on each search. Our scheme is efficient and parallelizable and outperforms the best previous schemes providing forward privacy, and achieves competitive performance with dynamic schemes without forward privacy. We provide a full security proof in the random oracle model. In our experiments on the Wikipedia archive of about four million pages, the server takes one second to perform a search with 100,000 results.

Style APA, Harvard, Vancouver, ISO itp.

Wang, Jiafan, and Sherman S. M. Chow. "Forward and Backward-Secure Range-Searchable Symmetric Encryption." Proceedings on Privacy Enhancing Technologies 2022, no. 1 (2021): 28–48. http://dx.doi.org/10.2478/popets-2022-0003.

Pełny tekst źródła

Streszczenie:

Abstract Dynamic searchable symmetric encryption (DSSE) allows a client to query or update an outsourced encrypted database. Range queries are commonly needed. Previous range-searchable schemes either do not support updates natively (SIGMOD’16) or use file indexes of many long bit-vectors for distinct keywords, which only support toggling updates via homomorphically flipping the presence bit. (ESORICS’18). We propose a generic upgrade of any (inverted-index) DSSE to support range queries (a.k.a. range DSSE), without homomorphic encryption, and a specific instantiation with a new trade-off reducing client-side storage. Our schemes achieve forward security, an important property that mitigates file injection attacks. Moreover, we identify a variant of injection attacks against the first somewhat dynamic scheme (ESORICS’18). We also extend the definition of backward security to range DSSE and show that our schemes are compatible with a generic upgrade of backward security (CCS’17). We comprehensively analyze the computation and communication overheads, including implementation details of client-side index-related operations omitted by prior schemes. We show high empirical efficiency for million-scale databases over a million-scale keyword space.

Style APA, Harvard, Vancouver, ISO itp.

Zhang, Xi, Ye Su, and Jing Qin. "A Dynamic Searchable Symmetric Encryption Scheme for Multiuser with Forward and Backward Security." Security and Communication Networks 2020 (October 20, 2020): 1–13. http://dx.doi.org/10.1155/2020/8893016.

Pełny tekst źródła

Streszczenie:

Dynamic Searchable Symmetric Encryption for Multiuser (M-DSSE) is an advanced form of symmetric encryption. It extends the traditional symmetric encryption to support the operations of adding and deleting the encrypted data and allow an authenticated group of data users to retrieve their respective desired encrypted data in the dynamic database. However, M-DSSE would suffer from the privacy concerns regarding forward and backward security. The former allows an attacker to identify the keywords contained in the added data by lunching file-injection attacks, while the latter allows to utilize the search results and the deleted data to learn the content. To our knowledge, these privacy concerns for M-DSSE have not been fully considered in the existing literatures. Taking account of this fact, we focus on the dynamic searchable symmetric encryption for multiuser meeting the needs of forward and backward security. In order to propose a concrete scheme, the primitives of Pseudorandom Functions (PRF) and the Homomorphic Message Authenticator (HMAC) are employed to construct the inverted index and update the search token. The proposed scheme is proven secure in the random model. And the performance analysis shows that the proposed scheme achieves the enhanced security guarantees at the reasonable price of efficiency.

Style APA, Harvard, Vancouver, ISO itp.

Cui, Shujie, Xiangfu Song, Muhammad Rizwan Asghar, Steven D. Galbraith, and Giovanni Russello. "Privacy-preserving Dynamic Symmetric Searchable Encryption with Controllable Leakage." ACM Transactions on Privacy and Security 24, no. 3 (2021): 1–35. http://dx.doi.org/10.1145/3446920.

Pełny tekst źródła

Streszczenie:

Searchable Encryption (SE) is a technique that allows Cloud Service Providers to search over encrypted datasets without learning the content of queries and records. In recent years, many SE schemes have been proposed to protect outsourced data. However, most of them leak sensitive information, from which attackers could still infer the content of queries and records by mounting leakage-based inference attacks, such as the count attack and file-injection attack . In this work, first we define the leakage in searchable encrypted databases and analyse how the leakage is leveraged in existing leakage-based attacks. Second, we propose a <underline>P</underline>rivacy-preserving <underline>M</underline>ulti-<underline>c</underline>loud based dynamic symmetric SE scheme for relational <underline>D</underline>ata<underline>b</underline>ase ( P-McDb ). P-McDb has minimal leakage, which not only ensures confidentiality of queries and records but also protects the search, intersection, and size patterns. Moreover, P-McDb ensures both forward and backward privacy of the database. Thus, P-McDb could resist existing leakage-based attacks, e.g., active file/record-injection attacks. We give security definition and analysis to show how P-McDb hides the aforementioned patterns. Finally, we implemented a prototype of P-McDb and tested it using the TPC-H benchmark dataset. Our evaluation results show that users can get the required records in 2.16 s when searching over 4.1 million records.

Style APA, Harvard, Vancouver, ISO itp.

Zhang, Yu, Yin Li, and Yifan Wang. "Efficient Searchable Symmetric Encryption Supporting Dynamic Multikeyword Ranked Search." Security and Communication Networks 2020 (July 16, 2020): 1–16. http://dx.doi.org/10.1155/2020/7298518.

Pełny tekst źródła

Streszczenie:

Searchable symmetric encryption that supports dynamic multikeyword ranked search (SSE-DMKRS) has been intensively studied during recent years. Such a scheme allows data users to dynamically update documents and retrieve the most wanted documents efficiently. Previous schemes suffer from high computational costs since the time and space complexities of these schemes are linear with the size of the dictionary generated from the dataset. In this paper, by utilizing a shallow neural network model called “Word2vec” together with a balanced binary tree structure, we propose a highly efficient SSE-DMKRS scheme. The “Word2vec” tool can effectively convert the documents and queries into a group of vectors whose dimensions are much smaller than the size of the dictionary. As a result, we can significantly reduce the related space and time cost. Moreover, with the use of the tree-based index, our scheme can achieve a sublinear search time and support dynamic operations like insertion and deletion. Both theoretical and experimental analyses demonstrate that the efficiency of our scheme surpasses any other schemes of the same kind, so that it has a wide application prospect in the real world.

Style APA, Harvard, Vancouver, ISO itp.

Bilbul, Salim, and Ayad Abdulsada. "Backward Private Searchable Symmetric Encryption with Improved Locality." Iraqi Journal for Electrical and Electronic Engineering 17, no. 2 (2021): 17–26. http://dx.doi.org/10.37917/ijeee.17.2.3.

Pełny tekst źródła

Streszczenie:

Searchable symmetric encryption (SSE) enables clients to outsource their encrypted documents into a remote server and allows them to search the outsourced data efficiently without violating the privacy of the documents and search queries. Dynamic SSE schemes (DSSE) include performing update queries, where documents can be added or removed at the expense of leaking more information to the server. Two important privacy notions are addressed in DSSE schemes: forward and backward privacy. The first one prevents associating the newly added documents with previously issued search queries. While the second one ensures that the deleted documents cannot be linked with subsequent search queries. Backward has three formal types of leakage ordered from strong to weak security: Type-I, Type-II, and Type-III. In this paper, we propose a new DSSE scheme that achieves Type-II backward and forward privacy by generating fresh keys for each search query and preventing the server from learning the underlying operation (del or add) included in update query. Our scheme improves I/O performance and search cost. We implement our scheme and compare its efficiency against the most efficient backward privacy DSSE schemes in the literature of the same leakage: MITRA and MITRA*. Results show that our scheme outperforms the previous schemes in terms of efficiency in dynamic environments. In our experiments, the server takes 699ms to search and return (100,000) results.

Style APA, Harvard, Vancouver, ISO itp.

Huang, Ke, Xiaolei Dong, Zhenfu Cao, and Jiachen Shen. "Dynamic searchable symmetric encryption schemes with forward and backward security." IOP Conference Series: Materials Science and Engineering 715 (January 3, 2020): 012062. http://dx.doi.org/10.1088/1757-899x/715/1/012062.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

He, Kun, Jing Chen, Qinxi Zhou, Ruiying Du, and Yang Xiang. "Secure Dynamic Searchable Symmetric Encryption With Constant Client Storage Cost." IEEE Transactions on Information Forensics and Security 16 (2021): 1538–49. http://dx.doi.org/10.1109/tifs.2020.3033412.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hiemenz, Benedikt, and Michel Krämer. "Dynamic searchable symmetric encryption for storing geospatial data in the cloud." International Journal of Information Security 18, no. 3 (2018): 333–54. http://dx.doi.org/10.1007/s10207-018-0414-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Du, Leilei, Kenli Li, Qin Liu, Zhiqiang Wu, and Shaobo Zhang. "Dynamic multi-client searchable symmetric encryption with support for boolean queries." Information Sciences 506 (January 2020): 234–57. http://dx.doi.org/10.1016/j.ins.2019.08.014.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Duan, Gangqiang, and Shuai Li. "Verifiable and Searchable Symmetric Encryption Scheme Based on the Public Key Cryptosystem." Electronics 12, no. 18 (2023): 3965. http://dx.doi.org/10.3390/electronics12183965.

Pełny tekst źródła

Streszczenie:

With the rapid development of Internet of Things technology and cloud computing technology, all industries need to outsource massive data to third-party clouds for storage in order to reduce storage and computing costs. Verifiable and dynamic searchable symmetric encryption is a very important cloud security technology, which supports the dynamic update of private data and allows users to perform search operations on the cloud server and verify the legitimacy of the returned results. Therefore, how to realize the dynamic search of encrypted cloud data and the effective verification of the results returned by the cloud server is a key problem to be solved. To solve this problem, we propose a verifiable dynamic encryption scheme (v-PADSSE) based on the public key cryptosystem. In order to achieve efficient and correct data updating, the scheme designs verification information (VI) for each keyword and constructs a verification list (VL) to store it. When dynamic update operations are performed on the cloud data, it is easy to quickly update the security index through obtaining the latest verification information in the VL. The safety and performance evaluation of the v-PADSSE scheme proved that the scheme is safe and effective.

Style APA, Harvard, Vancouver, ISO itp.

Wang, Wei, Dongli Liu, Peng Xu, Laurence Tianruo Yang, and Kaitai Liang. "Keyword Search Shareable Encryption for Fast and Secure Data Replication." IEEE Transactions on Information Forensics and Security 18 (August 21, 2023): 5537–52. https://doi.org/10.1109/TIFS.2023.3306941.

Pełny tekst źródła

Streszczenie:

It has become a trend for clients to outsource their encrypted databases to remote servers and then leverage the Searchable Encryption technique to perform secure data retrieval. However, the method has yet to be considered a crucial need for replication on searchable encrypted data. It calls for challenging works on Dynamic Searchable Symmetric Encryption (DSSE) since clients must share the search capability of the encrypted data replicas and guarantee forward and backward privacy. We define a new notion called “Keyword Search Shareable Encryption” (KS2E2E) and the corresponding security model capturing forward and backward privacy. In our notion, data owners are allowed to share search indexes of the encrypted data with users. A search index will be updated with a new search key before sharing to guarantee the data privacy of the source database. The target database also inherits data search efficiency along with the shared data. We further construct an instance of KS2E called Branch, prove its security, and use real-world datasets to evaluate Branch. The evaluation results show that Branch’s performance is comparable to classical DSSE schemes on search efficiency and demonstrate the effectiveness of searching encrypted data replicas from multiple owners.

Style APA, Harvard, Vancouver, ISO itp.

Bulbul, Salim Sabah, Zaid Ameen Abduljabbar, Duaa Fadhel Najem, Vincent Omollo Nyangaresi, Junchao Ma, and Abdulla J. Y. Aldarwish. "Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control." Journal of Sensor and Actuator Networks 13, no. 1 (2024): 12. http://dx.doi.org/10.3390/jsan13010012.

Pełny tekst źródła

Streszczenie:

Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model.

Style APA, Harvard, Vancouver, ISO itp.

Yoon, Hyundo, Muncheon Yu, Changhee Hahn, Dongyoung Koo, and Junbeom Hur. "Exploiting Hidden Information Leakages in Backward Privacy for Dynamic Searchable Symmetric Encryption." Applied Sciences 14, no. 6 (2024): 2287. http://dx.doi.org/10.3390/app14062287.

Pełny tekst źródła

Streszczenie:

Dynamic searchable symmetric encryption (DSSE) enables searches over encrypted data as well as data dynamics such as flexible data addition and deletion operations. A major security concern in DSSE is how to preserve forward and backward privacy, which are typically achieved by removing the linkability between the newly added data and previous queries, and between the deleted data and future queries, respectively. After information leakage types were formally defined for different levels of backward privacy (i.e., Type-I, II, III), many backward private DSSE schemes have been constructed under the definitions. However, we observed that the backward privacy can be violated by leveraging additional secondary leakage, which is typically leaked in specific constructions of schemes in spite of their theoretical guarantees. In this paper, in order to understand the security gap between the theoretical definitions and practical constructions, we conduct an in-depth analysis of the root cause for the secondary leakage, and demonstrate how it can be abused to violate Type-II backward privacy (e.g., the exposure of the deletion history) of DSSE constructions in practice. We then propose a novel Type-II backward private DSSE scheme based on Intel SGX, which is resilient to the secondary leakage abuse attack. According to the comparative analysis of our scheme with the state-of-the-art SGX-based DSSE schemes, Bunker-B (EuroSec’19) and SGX-SE1 (ACNS’20), our scheme shows higher efficiency in terms of the search latency with a negligible utility loss under the same security level (cf. Bunker-B) while showing similar efficiency with a higher security level (cf. SGX-SE1). Finally, we formally prove that our scheme guarantees Type-II backward privacy.

Style APA, Harvard, Vancouver, ISO itp.

Guo, Cheng, Xue Chen, Yingmo Jie, Zhangjie Fu, Mingchu Li, and Bin Feng. "Dynamic Multi-Phrase Ranked Search over Encrypted Data with Symmetric Searchable Encryption." IEEE Transactions on Services Computing 13, no. 6 (2020): 1034–44. http://dx.doi.org/10.1109/tsc.2017.2768045.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ti, Yen-Wu, Chia-Feng Wu, Chia-Mu Yu, and Sy-Yen Kuo. "Benchmarking Dynamic Searchable Symmetric Encryption Scheme for Cloud-Internet of Things Applications." IEEE Access 8 (2020): 1715–32. http://dx.doi.org/10.1109/access.2019.2961971.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Li, Hongwei, Yi Yang, Yuanshun Dai, Shui Yu, and Yong Xiang. "Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data." IEEE Transactions on Cloud Computing 8, no. 2 (2020): 484–94. http://dx.doi.org/10.1109/tcc.2017.2769645.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Liu, Chang, Liehuang Zhu, and Jinjun Chen. "Efficient searchable symmetric encryption for storing multiple source dynamic social data on cloud." Journal of Network and Computer Applications 86 (May 2017): 3–14. http://dx.doi.org/10.1016/j.jnca.2016.09.010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sun, Lixue, Chunxiang Xu, and Yuan Zhang. "A dynamic and non-interactive boolean searchable symmetric encryption in multi-client setting." Journal of Information Security and Applications 40 (June 2018): 145–55. http://dx.doi.org/10.1016/j.jisa.2018.03.002.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zhao, Minghao, Han Jiang, Zhen Li, Qiuliang Xu, Hao Wang, and Shaojing Li. "An efficient symmetric searchable encryption scheme for dynamic dataset in cloud computing paradigms." International Journal of High Performance Computing and Networking 12, no. 2 (2018): 179. http://dx.doi.org/10.1504/ijhpcn.2018.094368.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Li, Shaojing, Hao Wang, Qiuliang Xu, Han Jiang, Zhen Li, and Minghao Zhao. "An efficient symmetric searchable encryption scheme for dynamic dataset in cloud computing paradigms." International Journal of High Performance Computing and Networking 12, no. 2 (2018): 179. http://dx.doi.org/10.1504/ijhpcn.2018.10015546.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Xu, Wanshan, Jianbiao Zhang, Yilin Yuan, Xiao Wang, Yanhui Liu, and Muhammad Irfan Khalid. "Towards efficient verifiable multi-keyword search over encrypted data based on blockchain." PeerJ Computer Science 8 (March 21, 2022): e930. http://dx.doi.org/10.7717/peerj-cs.930.

Pełny tekst źródła

Streszczenie:

Searchable symmetric encryption (SSE) provides an effective way to search encrypted data stored on untrusted servers. When the server is not trusted, it is indispensable to verify the results returned by it. However, the existing SSE schemes either lack fairness in the verification of search results, or do not support the verification of multiple keywords. To address this, we designed a multi-keyword verifiable searchable symmetric encryption scheme based on blockchain, which provides an efficient multi-keyword search and fair verification of search results. We utilized bitmap to build a search index in order to improve search efficiency, and used blockchain to ensure fair verification of search results. The bitmap and hash function are combined to realize lightweight multi-keyword search result verification, compared with the existing verification schemes using public key cryptography primitives, our scheme reduces the verification time and improves the verification efficiency. In addition, our scheme supports the dynamic update of files and realizes the forward security in update. Finally, formal security analysis proves that our scheme is secure against Chosen-Keyword Attacks (CKA), experimental analysis demonstrations that our scheme is efficient and viable in practice.

Style APA, Harvard, Vancouver, ISO itp.

Peng, Xu, Susilo Willy, Wang Wei, et al. "ROSE: Robust Searchable Encryption with Forward and Backward Security." IEEE Transactions on Information Forensics and Security 17 (March 2, 2022): 1115–30. https://doi.org/10.1109/TIFS.2022.3155977.

Pełny tekst źródła

Streszczenie:

Dynamic searchable symmetric encryption (DSSE) has been widely recognized as a promising technique to delegate update and search queries over an outsourced database to an untrusted server while guaranteeing the privacy of data. Many efforts on DSSE have been devoted to obtaining a good tradeoff between security and performance. However, it appears that all existing DSSE works miss studying on what will happen if the DSSE client issues irrational update queries carelessly, such as duplicate update queries and delete queries to remove non-existent entries (that have been considered by many popular database system in the setting of plaintext). In this scenario, we find that (1) most prior works lose their claimed correctness or security, and (2) no single approach can achieve correctness, forward and backward security, and practical performance at the same time. To address this problem, we study for the first time the notion of robustness of DSSE. Generally, we say that a DSSE scheme is robust if it can keep the same correctness and security even in the case of misoperations. Then, we introduce a new cryptographic primitive named key-updatable pseudo-random function and apply this primitive to constructing ROSE, a robust DSSE scheme with forward and backward security. Finally, we demonstrate the efficiency of ROSE and give the experimental comparisons.

Style APA, Harvard, Vancouver, ISO itp.

Yuan, Dandan, Cong Zuo, Shujie Cui, and Giovanni Russello. "Result-pattern-hiding Conjunctive Searchable Symmetric Encryption with Forward and Backward Privacy." Proceedings on Privacy Enhancing Technologies 2023, no. 2 (2023): 40–58. http://dx.doi.org/10.56553/popets-2023-0040.

Pełny tekst źródła

Streszczenie:

Dynamic searchable symmetric encryption (DSSE) enables the data owner to outsource its database (document sets) to an untrusted server and make searches and updates securely and efficiently. Conjunctive DSSE can process conjunctive queries that return the documents containing multiple keywords. However, a conjunctive search could leak the keyword pair result pattern (KPRP), where attackers can learn which documents contain any two keywords involved in the query. File-injection attack shows that KPRP can be utilized to recover searched keywords. To protect data effectively, DSSE should also achieve forward privacy, i.e., hides the link between updates to previous searches, and backward privacy, i.e., prevents deleted entries being accessed by subsequent searches. Otherwise, the attacker could recover updated/searched keywords and records. However, no conjunctive DSSE scheme in the literature can hide KPRP in sub-linear search efficiency while guaranteeing forward and backward privacy. In this work, we propose the first sub-linear KPRP-hiding conjunctive DSSE scheme (named HDXT) with both forward and backward privacy guarantees. To achieve these three security properties, we introduce a new cryptographic primitive: Attribute-updatable Hidden Map Encryption (AUHME). AUHME enables HDXT to efficiently and securely perform conjunctive queries and update the database in an oblivious way. In comparison with previous work that has weaker security guarantees, HDXT shows comparable, and in some cases, even better performance.

Style APA, Harvard, Vancouver, ISO itp.

Bulbul, Salim Sabah, and Zaid Ameen Abduljabbar. "Performing Encrypted Cloud Data Keyword Searches Using Blockchain Technology on Smart Devices." Basrah Researches Sciences 50, no. 1 (2024): 17. http://dx.doi.org/10.56714/bjrs.50.1.24.

Pełny tekst źródła

Streszczenie:

Data owners seeking to boost processing power, storage, or bandwidth can take advantage of cloud computing services. However, this shift poses new challenges related to privacy and data security. Searchable Encryption (SE), which combines encryption and search techniques, addresses these issues (violation of data users' privacy) by allowing user data to be encrypted, transmitted to a cloud server, and searched using keywords. Despite its benefits, several recent real-world attacks have raised concerns about the security of searchable encryption. Ensuring forward and backward privacy is likely to become a standard requirement in the development of new SE systems. To address these issues, we propose a scheme that exclusively uses symmetric cryptographic primitives, achieving high communication efficiency and forward and backward privacy. In addition, we emphasize improved I/O efficiency because only the results of subsequent updates are loaded when searching. The time required to retrieve results is so significantly reduced compared to existing SE methods that we have shown that our scheme achieves superior efficiency. Moreover, by integrating blockchain network services with cloud services, we have developed a searchable intelligent cryptosystem suitable for lightweight smart devices. In our study conducted on the Ethereum network, we found our method to be both efficient and secure, especially when compared to methods such as PPSE and Jiang. The results indicate that our system delivers results in terms of performance and privacy within dynamic cloud environments making it a solution for protecting confidential information.

Style APA, Harvard, Vancouver, ISO itp.

Peng, Tianqi, Bei Gong, and Jiangjiang Zhang. "Towards Privacy Preserving in 6G Networks: Verifiable Searchable Symmetric Encryption Based on Blockchain." Applied Sciences 13, no. 18 (2023): 10151. http://dx.doi.org/10.3390/app131810151.

Pełny tekst źródła

Streszczenie:

The blockchain-based searchable symmetric encryption (SSE) scheme allows the retrieval and verification of outsourced data on cloud servers in sixth generation (6G) networks while ensuring the privacy of data. However, existing schemes are challenging to comprehensively meet the requirements of 6G-based intelligent application systems for low latency, high security, and high reliability. To address these limitations, we present VSSE, a novel blockchain-based SSE scheme designed for 6G-based intelligent application systems. Our scheme constructs a state chain structure to resist file injection attacks, thereby ensuring forward privacy. Moreover, we execute the search and verification operations separately on the cloud server and blockchain, while introducing a bitmap index structure and message authentication code (MAC) technology to achieve efficient searching and dynamic verification. Notably, VSSE also includes access control functionality, permitting only authorized users to access relevant files. The combination of remarkable efficiency and strong security establishes our VSSE as an ideal solution suitable for implementation in G-based intelligent application systems.

Style APA, Harvard, Vancouver, ISO itp.

Amjad, Ghous, Seny Kamara, and Tarik Moataz. "Breach-Resistant Structured Encryption." Proceedings on Privacy Enhancing Technologies 2019, no. 1 (2019): 245–65. http://dx.doi.org/10.2478/popets-2019-0014.

Pełny tekst źródła

Streszczenie:

Abstract Motivated by the problem of data breaches, we formalize a notion of security for dynamic structured encryption (STE) schemes that guarantees security against a snapshot adversary; that is, an adversary that receives a copy of the encrypted structure at various times but does not see the transcripts related to any queries. In particular, we focus on the construction of dynamic encrypted multi-maps which are used to build efficient searchable symmetric encryption schemes, graph encryption schemes and encrypted relational databases. Interestingly, we show that a form of snapshot security we refer to as breach resistance implies previously-studied notions such as a (weaker version) of history independence and write-only obliviousness. Moreover, we initiate the study of dual-secure dynamic STE constructions: schemes that are forward-private against a persistent adversary and breach-resistant against a snapshot adversary. The notion of forward privacy guarantees that updates to the encrypted structure do not reveal their association to any query made in the past. As a concrete instantiation, we propose a new dual-secure dynamic multi-map encryption scheme that outperforms all existing constructions; including schemes that are not dual-secure. Our construction has query complexity that grows with the selectivity of the query and the number of deletes since the client executed a linear-time rebuild protocol which can be de-amortized. We implemented our scheme (with the de-amortized rebuild protocol) and evaluated its concrete efficiency empirically. Our experiments show that it is highly efficient with queries taking less than 1 microsecond per label/value pair.

Style APA, Harvard, Vancouver, ISO itp.

Zuo, Cong, Shangqi Lai, Shi-Feng Sun, et al. "Searchable Encryption for Conjunctive Queries with Extended Forward and Backward Privacy." Proceedings on Privacy Enhancing Technologies 2025, no. 1 (2025): 440–55. http://dx.doi.org/10.56553/popets-2025-0024.

Pełny tekst źródła

Streszczenie:

Recent developments in the field of Dynamic Searchable Symmetric Encryption (DSSE) with forward and backward privacy have attracted much attention from both research and industrial communities. However, most DSSE schemes with forward and backward privacy schemes only support single keyword queries, which impedes its prevalence in practice. Although some forward and backward private DSSE schemes with expressive queries (e.g., conjunctive queries) have been introduced, their backward privacy either essentially corresponds to single keyword queries or forward privacy is not comprehensive. In addition, the deletion of many DSSE schemes is achieved by addition paired with a deletion mark (i.e., lazy deletion). To address these problems, we present two novel DSSE schemes with conjunctive queries (termed SDSSE-CQ and SDSSE-CQ-S), which achieve both forward and backward privacy. To analyze their security, we present two new levels of backward privacy (named Type-O and Type-O-, more and more secure), which give a more comprehensive understanding of the leakages of conjunctive queries in the OXT framework. Eventually, the security analysis and experimental evaluations show that the proposed schemes achieve better security with reasonable computation and communication increase.

Style APA, Harvard, Vancouver, ISO itp.

Peng, Tianqi, Bei Gong, Shanshan Tu, et al. "Forward and Backward Private Searchable Encryption for Cloud-Assisted Industrial IoT." Sensors 24, no. 23 (2024): 7597. http://dx.doi.org/10.3390/s24237597.

Pełny tekst źródła

Streszczenie:

In the cloud-assisted industrial Internet of Things (IIoT), since the cloud server is not always trusted, the leakage of data privacy becomes a critical problem. Dynamic symmetric searchable encryption (DSSE) allows for the secure retrieval of outsourced data stored on cloud servers while ensuring data privacy. Forward privacy and backward privacy are necessary security requirements for DSSE. However, most existing schemes either trade the server’s large storage overhead for forward privacy or trade efficiency/overhead for weak backward privacy. These schemes cannot fully meet the security requirements of cloud-assisted IIoT systems. We propose a fast and firmly secure SSE scheme called Veruna to address these limitations. To this end, we design a new state chain structure, which can not only ensure forward privacy with less storage overhead of the server but also achieve strong backward privacy with only a few cryptographic operations in the server. Security analysis proves that our scheme possesses forward privacy and Type-II backward privacy. Compared with many state-of-the-art schemes, our scheme has an advantage in search and update performance. The high efficiency and robust security make Veruna an ideal scheme for deployment in cloud-assisted IIoT systems.

Style APA, Harvard, Vancouver, ISO itp.

Makhmudov, Teimur, and Vitalii Yesin. "Analysis of data search methods in cryptographically protected databases." Computer Science and Cybersecurity, no. 2 (December 26, 2022): 6–21. http://dx.doi.org/10.26565/2519-2310-2022-2-01.

Pełny tekst źródła

Streszczenie:

The issue of compliance with data security, namely their confidentiality and integrity, generally being resolved through the use of appropriate cryptographic primitives, taking into account the development of computing power (and/or computational complexity of algorithms). But, in connection with the specific method of storage (in the cloud), the question arises of the effectiveness of the search for the necessary information. The problem considered in this paper is that encryption makes it impossible for an attacker to access data without access key, but deprives the legal owner of the data, of the ability to search for this information. The article reviewe several encryption methods with searchable. For each of them algorithms given, examples of the use of these methods, explanatory figures and tables were provided. The considered methods are symmetric and dynamic, due to which they are effective and have a relatively high level of security, but low query expressiveness, which is why they are most used in NoSQL data-bases. The analysis was conducted to evaluate the complexity and level of security of the methods, and the performance of practical implementations was also considered. It was concluded that, conclusions were made about the feasibility of using one or another searchable encryption method in practice, and recommendations were made regarding the combination of the described methods to obtain expected results.

Style APA, Harvard, Vancouver, ISO itp.

Bulbul, Salim Sabah, Zaid Ameen Abduljabbar, Rana Jassim Mohammed, et al. "A provably lightweight and secure DSSE scheme, with a constant storage cost for a smart device client." PLOS ONE 19, no. 4 (2024): e0301277. http://dx.doi.org/10.1371/journal.pone.0301277.

Pełny tekst źródła

Streszczenie:

Outsourcing data to remote cloud providers is becoming increasingly popular amongst organizations and individuals. A semi-trusted server uses Searchable Symmetric Encryption (SSE) to keep the search information under acceptable leakage levels whilst searching an encrypted database. A dynamic SSE (DSSE) scheme enables the adding and removing of documents by performing update queries, where some information is leaked to the server each time a record is added or removed. The complexity of structures and cryptographic primitives in most existing DSSE schemes makes them inefficient, in terms of storage, and query requests generate overhead costs on the Smart Device Client (SDC) side. Achieving constant storage cost for SDCs enhances the viability, efficiency, and easy user experience of smart devices, promoting their widespread adoption in various applications while upholding robust privacy and security standards. DSSE schemes must address two important privacy requirements: forward and backward privacy. Due to the increasing number of keywords, the cost of storage on the client side is also increasing at a linear rate. This article introduces an innovative, secure, and lightweight Dynamic Searchable Symmetric Encryption (DSSE) scheme, ensuring Type-II backward and forward privacy without incurring ongoing storage costs and high-cost query generation for the SDC. The proposed scheme, based on an inverted index structure, merges the hash table with linked nodes, linking encrypted keywords in all hash tables. Achieving a one-time O(1) storage cost without keyword counters on the SDC side, the scheme enhances security by generating a fresh key for each update. Experimental results show low-cost query generation on the SDC side (6,460 nanoseconds), making it compatible with resource-limited devices. The scheme outperforms existing ones, reducing server-side search costs significantly.

Style APA, Harvard, Vancouver, ISO itp.

Narayanareddy, Mugireddy Satya, Lekireddy Rajasekharreddy, Isani Swetha, and P. V. Jagadeeswara Prasad. "SYMMETRIC-KEY BASED VERIFICATION OF KEYWORD SEARCH OVER DYNAMIC ENCRYPTED CLOUD DATA." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 11, no. 3 (2020): 2736–41. http://dx.doi.org/10.61841/turcomat.v11i3.14517.

Pełny tekst źródła

Streszczenie:

Searchable and Verifiable As a crucial method of cloud security, symmetric encryption enables users to search for encrypted data in the cloud using keywords and validate the accuracy of the results. One of the most prevalent and important requirements for data owners in such schemes is dynamic update for cloud data. To our knowledge, all of the verifiable SSE systems that permit data dynamic update currently in use are based on asymmetric-key cryptography verification, which necessitates time-consuming processes. The sheer volume of cloud data could make the overhead of verification a major burden. Consequently, a crucial unsolved topic is how to implement keyword search over dynamic encrypted cloud data with effective verification. In this research, we investigate how to accomplish keyword search over dynamically encrypted cloud data with symmetric-key based verification and suggest a workable technique. In order to support the efficient verification of dynamic data, we design a novel Accumulative Authentication Tag (AAT) based on the symmetric-key cryptography to generate an authentication tag for each keyword. Benefiting from the accumulation property of our designed AAT, the authentication tag can be conveniently updated when dynamic operations on cloud data occur. In order to achieve efficient data update, we design a new secure index composed by a search table ST based on the orthogonal list and a verification list VL containing AATs. Owing to the connectivity and the flexibility of ST, the update efficiency can be significantly improved. The security analysis and the performance evaluation results show that the proposed scheme is secure and efficient.

Style APA, Harvard, Vancouver, ISO itp.

Shenigaram, Vidhya, Ladhwe Shri Megha, Rajasekharaiah Matada Kattigehally, and Swarnaja Mettu. "SYMMETRIC-KEY BASED VERIFICATION OF KEYWORD SEARCH OVER DYNAMIC ENCRYPTED CLOUD DATA." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 11, no. 3 (2020): 2696–702. http://dx.doi.org/10.61841/turcomat.v11i3.14483.

Pełny tekst źródła

Streszczenie:

Style APA, Harvard, Vancouver, ISO itp.

Poh, Geong Sen, Ji-Jian Chin, Wei-Chuen Yau, Kim-Kwang Raymond Choo, and Moesfa Soeheila Mohamad. "Searchable Symmetric Encryption." ACM Computing Surveys 50, no. 3 (2017): 1–37. http://dx.doi.org/10.1145/3064005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Li, Huige, Fangguo Zhang, and Chun-I. Fan. "Deniable Searchable Symmetric Encryption." Information Sciences 402 (September 2017): 233–43. http://dx.doi.org/10.1016/j.ins.2017.03.032.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Chase, Melissa, and Emily Shen. "Substring-Searchable Symmetric Encryption." Proceedings on Privacy Enhancing Technologies 2015, no. 2 (2015): 263–81. http://dx.doi.org/10.1515/popets-2015-0014.

Pełny tekst źródła

Streszczenie:

AbstractIn this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) and structured encryption. Then, we construct a queryable encryption scheme for substring queries. Our construction uses suffix trees and achieves asymptotic efficiency comparable to that of unencrypted suffix trees. Encryption of a string of length n takes O(λn) time and produces a ciphertext of size O(λn), and querying for a substring of length m that occurs k times takes O(λm+k) time and three rounds of communication. Our security definition guarantees correctness of query results and privacy of data and queries against a malicious adversary. Following the line of work started by Curtmola et al. (ACM CCS 2006), in order to construct more efficient schemes we allow the query protocol to leak some limited information that is captured precisely in the definition. We prove security of our substring-searchable encryption scheme against malicious adversaries, where the query protocol leaks limited information about memory access patterns through the suffix tree of the encrypted string.

Style APA, Harvard, Vancouver, ISO itp.

Luo, Guangchun, Ningduo Peng, Ke Qin, and Aiguo Chen. "A Layered Searchable Encryption Scheme with Functional Components Independent of Encryption Methods." Scientific World Journal 2014 (2014): 1–16. http://dx.doi.org/10.1155/2014/153791.

Pełny tekst źródła

Streszczenie:

Searchable encryption technique enables the users to securely store and search their documents over the remote semitrusted server, which is especially suitable for protecting sensitive data in the cloud. However, various settings (based on symmetric or asymmetric encryption) and functionalities (ranked keyword query, range query, phrase query, etc.) are often realized by different methods with different searchable structures that are generally not compatible with each other, which limits the scope of application and hinders the functional extensions. We prove that asymmetric searchable structure could be converted to symmetric structure, and functions could be modeled separately apart from the core searchable structure. Based on this observation, we propose a layered searchable encryption (LSE) scheme, which provides compatibility, flexibility, and security for various settings and functionalities. In this scheme, the outputs of the core searchable component based on either symmetric or asymmetric setting are converted to some uniform mappings, which are then transmitted to loosely coupled functional components to further filter the results. In such a way, all functional components could directly support both symmetric and asymmetric settings. Based on LSE, we propose two representative and novel constructions for ranked keyword query (previously only available in symmetric scheme) and range query (previously only available in asymmetric scheme).

Style APA, Harvard, Vancouver, ISO itp.

OGATA, Wakaha, and Kaoru KUROSAWA. "No-Dictionary Searchable Symmetric Encryption." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A, no. 1 (2019): 114–24. http://dx.doi.org/10.1587/transfun.e102.a.114.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

ETEMAD, Mohammad, and Alptekin KÜPÇÜ. "Verifiable dynamic searchable encryption." TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 27, no. 4 (2019): 2606–23. http://dx.doi.org/10.3906/elk-1901-157.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dai, Shuguang, Huige Li, and Fangguo Zhang. "Memory leakage-resilient searchable symmetric encryption." Future Generation Computer Systems 62 (September 2016): 76–84. http://dx.doi.org/10.1016/j.future.2015.11.003.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Li, Huige, Haibo Tian, Fangguo Zhang, and Jiejie He. "Blockchain-based searchable symmetric encryption scheme." Computers & Electrical Engineering 73 (January 2019): 32–45. http://dx.doi.org/10.1016/j.compeleceng.2018.10.015.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Poh, Geong Sen, Moesfa Soeheila Mohamad, and Ji-Jian Chin. "Searchable symmetric encryption over multiple servers." Cryptography and Communications 10, no. 1 (2017): 139–58. http://dx.doi.org/10.1007/s12095-017-0232-y.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Han, Jiujiang, Ziyuan Li, Jian Liu, et al. "Attribute-Based Access Control Meets Blockchain-Enabled Searchable Encryption: A Flexible and Privacy-Preserving Framework for Multi-User Search." Electronics 11, no. 16 (2022): 2536. http://dx.doi.org/10.3390/electronics11162536.

Pełny tekst źródła

Streszczenie:

Searchable encryption enables users to enjoy search services while protecting the security and privacy of their outsourced data. Blockchain-enabled searchable encryption delivers the computing processes that are executed on the server to the decentralized and transparent blockchain system, which eliminates the potential threat of malicious servers invading data. Recently, although some of the blockchain-enabled searchable encryption schemes realized that users can search freely and verify search results, unfortunately, these schemes were inefficient and costly. Motivated by this, we proposed an improved scheme that supports fine-grained access control and flexible searchable encryption. In our framework, the data owner uploads ciphertext documents and symmetric keys to cloud database and optional KMS, respectively, and manipulates the access control process and searchable encryption process through smart contracts. Finally, the experimental comparison conducted on a private Ethereum network proved the superiority of our scheme.

Style APA, Harvard, Vancouver, ISO itp.

Du, Haorui, Jianhua Chen, Fei Lin, Cong Peng, and Debiao He. "A Lightweight Blockchain-based Public-Key Authenticated Encryption with Multi-Keyword Search for Cloud Computing." Security and Communication Networks 2022 (October 15, 2022): 1–15. http://dx.doi.org/10.1155/2022/2309834.

Pełny tekst źródła

Streszczenie:

Cloud computing can provide users with sufficient computing resources, storage, and bandwidth to meet their needs. Data security and privacy protection are among the new threats faced by users. Searchable encryption is the combination of search technology and encryption technology. Searchable encryption can upload the user’s data to the cloud server after special encryption, and can realize the function of retrieving according to keywords. Comparatively to symmetric searchable encryption (SSE), public key searchable encryption (PEKS) simplifies key management greatly. However, most existing public key authenticated encryption with keyword search (PAEKS) schemes are based bilinear pairing, making them computationally expensive. Apart from this, complex retrieval requirements and the integrity of the results had not been considered. To address these problems, we propose a blockchain-based PAEKS schemes supporting multi-keyword queries and integrity verification. In addition, we provide security proofs for the PAEKS scheme under the decisional oracle Diffie-Hellman (DODH) assumption. This scheme a scheme that requires less storage and computational power than other schemes of the same kind.

Style APA, Harvard, Vancouver, ISO itp.

Cao, Suzhen, Junjian Yan, Zixuan Fang, and Caifen Wang. "A Searchable Encryption with Forward/Backward Security and Constant Storage." Applied Sciences 13, no. 4 (2023): 2181. http://dx.doi.org/10.3390/app13042181.

Pełny tekst źródła

Streszczenie:

Dynamic searchable encryption satisfies users’ needs for ciphertext retrieval on semi-trusted servers, while allowing users to update server-side data. However, cloud servers with dynamically updatable data are vulnerable to information abuse and file injection attacks, and current public key-based dynamic searchable encryption algorithms are often complicated in construction and high in computational overhead, which is not efficient for practical applications. In addition, the client’s storage costs grow linearly with the number of keywords in the database, creating a new bottleneck when the size of the keyword set is large. To solve the above problems, a dynamic searchable encryption scheme that uses a double-layer structure, while satisfying forward and backward security, is proposed. The double-layer structure maintains a constant client-side storage cost while guaranteeing forward and backward security and further reduces the algorithm overhead by avoiding bilinear pairings in the encryption and decryption operations. The analysis results show that the scheme is more advantageous in terms of security and computational efficiency than the existing dynamic searchable encryption scheme under the public key cryptosystem. It is also suitable for the big data communication environment.

Style APA, Harvard, Vancouver, ISO itp.

Choi, Daeseon, Seung-Hyun Kim, and Younho Lee. "Address Permutation for Privacy-Preserving Searchable Symmetric Encryption." ETRI Journal 34, no. 1 (2012): 66–75. http://dx.doi.org/10.4218/etrij.12.0111.0243.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

He, Wei, Yu Zhang, and Yin Li. "Fast, Searchable, Symmetric Encryption Scheme Supporting Ranked Search." Symmetry 14, no. 5 (2022): 1029. http://dx.doi.org/10.3390/sym14051029.

Pełny tekst źródła

Streszczenie:

Searchable encryption (SE) is one of the effective techniques for searching encrypted data without decrypting it. This technique can provide a secure indexing mechanism for encrypted data and utilize a secure trapdoor to search for the encrypted data directly, thus realizing a secure ciphertext retrieval function. Existing schemes usually build a secure index directly on the whole dataset and implement the retrieval of encrypted data by implementing a secure search algorithm on the index. However, this approach requires testing many non-relevant documents, which diminishes the query efficiency. In this paper, we adopt a clustering method to preclassify the dataset, which can filter out quite a portion of irrelevant documents, thus improving the query. Concretely, we first partition the dataset into multiple document clusters using the k-means clustering algorithm; then, we design index building and searching algorithms for these document clusters; finally, by using the asymmetric scalar-product-preserving encryption (ASPE) scheme to encrypt the indexes and queries, we propose a fast searchable symmetric encryption scheme that supports ranked search. Detailed security analysis demonstrates that the proposed scheme can guarantee the data and query security of the search process. In addition, theoretical and experimental analysis indicates that our scheme outperforms other similar schemes in terms of query efficiency.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!