Results 121 to 130 of about 321 (155)
Some of the next articles are maybe not open access.
Forward secure searchable symmetric encryption
2017 12th International Conference for Internet Technology and Secured Transactions (ICITST), 2017Data outsourcing to third party clouds poses numerous data security threats. Access by unauthorized users is one of the security threat to the outsourced data. Unauthorized access can be avoided by encrypting the data before outsourcing. However, encrypting data before outsourcing renders it unsearchable to the data owner. Searchable encryption schemes
Muhammad Saqib Niaz, Gunter Saake
openaire +1 more source
Symmetric Searchable Encryption with Sharing and Unsharing
2018In this paper, we study Symmetric Searchable Encryption (SSE) in a multi-user setting in which each user dynamically shares its documents with selected other users, allowing sharees also to perform searches. We introduce the concept of a Symmetric Searchable Encryption with Sharing and Unsharing, an extension of Multi-Key Searchable Encryption (NSDI ...
Patel S., Persiano G., Yeo K.
openaire +3 more sources
Attribute-Based Symmetric Searchable Encryption
2020Symmetric Searchable Encryption (SSE) is an encryption technique that allows users to search directly on their outsourced encrypted data while preserving the privacy of both the files and the queries. Unfortunately, majority of the SSE schemes allows users to either decrypt the whole ciphertext or nothing at all.
Hai-Van Dang +3 more
openaire +2 more sources
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.
Peter van Liesdonk +4 more
openaire +3 more sources
Toward Practical Searchable Symmetric Encryption
2013Searchable symmetric encryption is a good building block toward ensuring privacy preserving keyword searches in a cloud computing environment. This area has recently attracted a great deal of attention and a large quantity of research has been conducted.
Wakaha Ogata +3 more
openaire +1 more source
A Mechanized Proof of Security for Searchable Symmetric Encryption
2015 IEEE 28th Computer Security Foundations Symposium, 2015We present a mechanized proof of security for an efficient Searchable Symmetric Encryption (SSE) scheme completed in the Foundational Cryptography Framework (FCF). FCF is a Coq library for reasoning about cryptographic schemes in the computational model that features a small trusted computing base and an extensible design.
Adam Petcher, Greg Morrisett
openaire +1 more source
Searchable symmetric encryption over multiple servers
Cryptography and Communications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geong Sen Poh +2 more
openaire +1 more source
UC-Secure Searchable Symmetric Encryption
2012For searchable symmetric encryption schemes (or symmetric-key encryption with keyword search), the security against passive adversaries (i.e. privacy) has been mainly considered so far. In this paper, we first define its security against active adversaries (i.e. reliability as well as privacy). We next formulate its UC-security.
Kaoru Kurosawa, Yasuhiro Ohtaki
openaire +1 more source
Garbled Searchable Symmetric Encryption
2014In a searchable symmetric encryption (SSE) scheme, a client can keyword search over symmetrically-encrypted files which he stored on the server (ideally without leaking any information to the server). In this paper, we show the first multiple keyword search SSE scheme such that even the search formula \(f\) (AND, OR and so on) is kept secret.
openaire +1 more source
Parallel and Dynamic Searchable Symmetric Encryption
2013Searchable symmetric encryption (SSE) enables a client to outsource a collection of encrypted documents in the cloud and retain the ability to perform keyword searches without revealing information about the contents of the documents and queries. Although efficient SSE constructions are known, previous solutions are highly sequential.
Seny Kamara, Charalampos Papamanthou
openaire +2 more sources

