Results 241 to 250 of about 8,870 (281)
Some of the next articles are maybe not open access.
Decryptable Searchable Encryption
2007As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces searchable encryption schemes which enable decryption. An additional feature is that the decryption key and the trapdoor derivation key are totally independent,
Thomas Fuhr, Pascal Paillier
openaire +1 more source
Computationally Efficient Searchable Symmetric Encryption
2010Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client.
Liesdonk, van, P.P. +4 more
openaire +3 more sources
Updatable Searchable Symmetric Encryption: Definitions and Constructions
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiwen Wang +4 more
openaire +1 more source
Dynamic searchable symmetric encryption
Proceedings of the 2012 ACM conference on Computer and communications security, 2012Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it.SSE has been the focus of ...
Seny Kamara +2 more
openaire +1 more source
Boolean symmetric searchable encryption
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, 2013In this article we tackle the issue of searchable encryption with a generalized query model. Departing from many previous works that focused on queries consisting of a single keyword, we consider the the case of queries consisting of arbitrary boolean expressions on keywords, that is to say conjunctions and disjunctions of keywords and their complement.
Tarik Moataz, Abdullatif Shikfa
openaire +1 more source
Unconditionally secure searchable encryption
2017 51st Annual Conference on Information Sciences and Systems (CISS), 2017Searchable symmetric encryption (SSE) enables us to search encrypted data with an arbitrarily chosen keyword without leaking information on the data and keyword. SSE is expected to be used in, for example, cloud computing and genome analyses. In particular, privacy of genome data must be guaranteed for long periods, and therefore unconditionally secure
Takahiro Yoshizawa +2 more
openaire +1 more source
Broadcast Searchable Keyword Encryption
2014 IEEE 17th International Conference on Computational Science and Engineering, 2014Broadcast Searchable Keywords Encryption (BSKE) is a novel scheme that allows searching in encrypted data without knowing a secret key. Consider Bob wants to encrypt the same data under master public key for a group of users and stores this encrypted data with Alice, Malice is one of those recipients he asks Alice using his private key whether or not ...
Mohamed Ali +5 more
openaire +1 more source
Searchable Encryption for Outsourced Data Analytics
2011Two sets of privacy requirements need to be fulfilled when a company's accounting data is audited by an external party: the company needs to safeguard its data, while the auditors do not want to reveal their investigation methods. This problem is usually addressed by physically isolating data and auditors during the course of an audit.
Kerschbaum F., Sorniotti A.
openaire +1 more source
Asymmetric Searchable Encryption from Inner Product Encryption
2016Asymmetric searchable encryption(ASE) enables one to retrieve encrypted data stored on an untrusted server without revealing the contents. Now, beyond single keyword search, more and more attention have already been paid to the problem of multi-keyword search. However, existing schemes are mainly based on composite-order bilinear groups. In this paper,
Siyu Xiao +4 more
openaire +1 more source

