Results 1 - 10 of 1,803

Searchable Keyword-Based Encryption

by Dong Jin Park, Juyoung Cha, Pil Joong Lee , 2005
"... To solve the problem of searching on encrypted data, many keyword search schemes have been proposed in recent years. The goal of such schemes is to enable a user to give an untrusted storage server the ability only to test whether an encrypted document contains a few keywords without learning anyt ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
#cient construction whose security is proved in a random oracle model under the Bilinear Di#e-Hellman Inversion assumption. The scheme is constructed based on the Public Key Encryption with Conjunctive Field Keyword Search scheme in [21] by using a hybrid encryption technique.

Secure Conjunctive Keyword Search over Encrypted Data

by Philippe Golle, Jessica Staddon, Brent Waters - ACNS 04: 2nd International Conference on Applied Cryptography and Network Security , 2004
"... We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterion, the user gives the server a capability that allows the server to identify exactly those documents. ..."
Abstract - Cited by 105 (1 self) - Add to MetaCart
We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterion, the user gives the server a capability that allows the server to identify exactly those documents.

Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions

by Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-lee, Gregory Neven, Pascal Paillier, Haixia Shi , 2005
"... We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of [7] is compu ..."
Abstract - Cited by 143 (3 self) - Add to MetaCart
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of [7

Secure Conjunctive Keyword Searches For Unstructured Text

by Florian Kerschbaum
"... Abstract-There are a number of searchable encryption schemes that allow secure conjunctive keyword searches over encrypted data, but all of them assume that the position of the keywords is known. This is a pity, since in unstructured text, e.g. the body of an e-mail, this position is unknown and on ..."
Abstract - Add to MetaCart
Abstract-There are a number of searchable encryption schemes that allow secure conjunctive keyword searches over encrypted data, but all of them assume that the position of the keywords is known. This is a pity, since in unstructured text, e.g. the body of an e-mail, this position is unknown

Solving Forward-Backward Stochastic Differential Equations Explicitly – a Four Step Scheme

by Jiongmin Yong - Prob. Th. Rel. Fields , 1994
"... Abstract. The problem of nding adapted solutions to systems of coupled linear forwardbackward stochastic di erential equations (FBSDEs, for short) is investigated. A necessary condition of solvability leads to a reduction of general linear FBSDEs to a special one. By some ideas from controllability ..."
Abstract - Cited by 243 (19 self) - Add to MetaCart
is derived using the idea of the Four-Step-Scheme (introduced in [11] for general FBSDEs). The solvability of such a Riccati type equation is studied which leads to a representation of adapted solutions to linear FBSDEs. Keywords. Linear forward-backward stochastic di erential equations, adapted solution

Correlation-resistant storage via keyword-searchable encryption

by Lucas Ballard, Matthew Green, Breno de Medeiros, Fabian Monrose , 2005
"... We consider the problem of using untrusted components to build correlation-resistant survivable storage systems that protect file replica locations, while allowing nodes to continuously re-distribute files throughout the network. The principal contribution is a chosen-ciphertext secure, searchable p ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
public key encryption scheme which allows for dynamic re-encryption of ciphertexts, and provides for node-targeted searches based on keywords or other identifiers. The scheme is provably secure under the SXDH assumption which holds in certain subgroups of elliptic curves, and a closely related assumption

Keywords

by F. Moayyedian, M. Kadkhodayan
"... In this paper derivation of the second differentiation of a general yield surface by implicit time stepping method along with its consistent elastic-plastic modulus is studied. Moreover, the explicit, trapezoidal implicit and fully implicit time stepping schemes are compared in rate-dependant plasti ..."
Abstract - Add to MetaCart
In this paper derivation of the second differentiation of a general yield surface by implicit time stepping method along with its consistent elastic-plastic modulus is studied. Moreover, the explicit, trapezoidal implicit and fully implicit time stepping schemes are compared in rate

Keywords:

by Aneurysm Detection , 2009
"... urys carr posed in this study. Applied to the segmented cerebral vasculature, the method detects aneurysms as sus-is a s 2000; Johnson et al., 2001). However, in the case of a ruptured aneurysm, the initial bleed is fatal in 10–20 % of instances and de-spite improvements in patient management, the i ..."
Abstract - Add to MetaCart
urys carr posed in this study. Applied to the segmented cerebral vasculature, the method detects aneurysms as sus-is a s 2000; Johnson et al., 2001). However, in the case of a ruptured aneurysm, the initial bleed is fatal in 10–20 % of instances and de-spite improvements in patient management

Oblivious Conjunctive Keyword Search ⋆

by Hyun Sook Rhee, Jin Wook Byun, Dong Hoon Lee, Jongin Lim
"... Abstract. We study the problem of keyword search in which a server contains various multimedia contents and a user of server wishes to retrieve some multimedia item containing specific keywords without revealing to the server which item it is. Recently, Ogata and Kurosawa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. We study the problem of keyword search in which a server contains various multimedia contents and a user of server wishes to retrieve some multimedia item containing specific keywords without revealing to the server which item it is. Recently, Ogata and Kurosawa

Parallel and Dynamic Searchable Symmetric Encryption

by Seny Kamara, Charalampos Papamanthou
"... Abstract. Searchable 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 kn ..."
Abstract - Cited by 51 (4 self) - Add to MetaCart
Abstract. Searchable 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
Results 1 - 10 of 1,803