Page 2 - Searchable Encryption News Today : Breaking News, Live Updates & Top Stories | Vimarsana

Stay updated with breaking news from Searchable encryption. Get real-time updates on events, politics, business, and more. Visit us for reliable news and exclusive interviews.

Top News In Searchable Encryption Today - Breaking & Trending Today

Vaultree Launches Preview of Fully Homomorphic and Searchable Cloud Encryption Solution via Google's AlloyDB

Vaultree's Fully Homomorphic and Searchable Encryption breakthroughs now available for preview in Google's AlloyDB for PostgreSQL Vaultree today announced the release of its Data-in-Use Encryption ....

Google Alloy , Tilo Weigandt , Ryan Lasmaili , Matt Culbertson , Privacy Enhancing Technology , Fully Homomorphic , Searchable Encryption , Data In Use Encryption ,

"Message-Locked Searchable Encryption: A New Versatile Tool for Secure " by Xueqiao Liu, Guomin Yang et al.

Message-Locked Encryption (MLE) is a useful tool to enable deduplication over encrypted data in cloud storage. It can significantly improve the cloud service quality by eliminating redundancy to save storage resources, and hence user cost, and also providing defense against different types of attacks, such as duplicate faking attack and brute-force attack. A typical MLE scheme only focuses on deduplication. On the other hand, supporting search operations on stored content is another essential requirement for cloud storage. In this article, we present a message-locked searchable encryption (MLSE) scheme in a dual-server setting, which achieves simultaneously the desirable features of supporting deduplication and enabling users to perform search operations over encrypted data. In addition, it supports both multi-keyword and negative keyword searches. We formulate the security notions of MLSE and prove our scheme satisfies all the security requirements. Moreover, we provide an interesting ....

Locked Encryption , Essage Locked Encryption , Proof Of Ownership , Roof Of Storage , Searchable Encryption ,

"A fast and flexible attribute-based searchable encryption scheme suppo" by Haiyan Wang, Yuan Li et al.

How to use efficient search mechanisms to realize data sharing while ensuring data security has become an important research topic at present. In this paper, we propose a new searchable algorithm based on LSSS (Linear Secret Sharing Scheme) access policy, which is superior to previous work in computational and storage efficiency. Our scheme supports various search mechanisms, such as exact search, boolean search and range search mechanism. We use 0,1-coding theory to reduce the number of the numeric keywords, thus improving the range search mechanism. We also prove that our scheme is secure against the selectively chosen-keyword attack (SCKA) in the generic bilinear group model. Furthermore, we evaluate the performance of our scheme by theoretical analysis and experimental simulation, and the result show that our scheme achieves significant improvement in both computational and storage efficiency. To enhance the security and practicality of our scheme, we also deploy our scheme on a pr ....

Linear Secret Sharing Scheme , 1 Coding Theory , Data Security , Searchable Encryption , Electively Chosen Keyword Attack Scka ,

"Functional Encryption for Pattern Matching with a Hidden String" by Jongkil Kim, Yang Wai Chow et al.

We propose a new functional encryption for pattern matching scheme with a hidden string. In functional encryption for pattern matching (FEPM), access to a message is controlled by its description and a private key that is used to evaluate the description for decryption. In particular, the description with which the ciphertext is associated is an arbitrary string w and the ciphertext can only be decrypted if its description matches the predicate of a private key which is also a string. Therefore, it provides fine-grained access control through pattern matching alone. Unlike related schemes in the literature, our scheme hides the description that the ciphertext is associated with. In many practical scenarios, the description of the ciphertext cannot be public information as an attacker may abuse the message description to identify the data owner or classify the target ciphertext before decrypting it. Moreover, some data owners may not agree to reveal any ciphertext information since it s ....

Functional Encryption , Attern Matching System , Searchable Encryption ,

"Practical Multi-Keyword and Boolean Search over Encrypted E-mail in Cl" by Peiming Xu, Shaohua Tang et al.

With the outbreak of e-mail message leakage events, such as the Hillary Clinton's Email Controversy, privacy and security of sensitive e-mail information have become users' primary concern. Encrypted email seems to be a viable solution for providing security, but it will greatly limit their operations. Public encryption with keyword search (PEKS) scheme is a popular technology to incorporate security protection and favorable operability functions together, which can play an important role in searching over encrypted email in a cloud server. In this paper, we propose a practical PEKS scheme named as public-key multi-keyword searchable encryption with hidden structures (PMSEHS). It could enable e-mail receivers to do the multi-keyword and boolean search in the large encrypted email database as fast as possible, without revealing more information to the cloud server. We also give comparative experiments, which demonstrate that our scheme has a higher efficiency in multi-keyword ....

Hillary Clinton , Boolean Query , Onjunctive Search , Ncryptede Mail , Ulti Keyword Search , Searchable Encryption ,