• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 331
Next 10 →

Semantic Searchable Encryption Scheme based on Lattice in Quantum-era

by Yang Yang, Maode Ma
"... Abstract. When data is outsourced to a remote storage server, search-able encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. ..."
Abstract - Add to MetaCart
Abstract. When data is outsourced to a remote storage server, search-able encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map

Searchable Encryption for Outsourced Data

by Florian Kerschbaum, Ro Sorniotti
"... Abstract. Two 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 d ..."
Abstract - Add to MetaCart
data and auditors during the course of an audit. This approach however no longer works when auditing is performed remotely. In this paper we present an efficient construction for a searchable encryption scheme for outsourcing data analytics. In this scheme the data owner needs to encrypt his data only

Non-Malleable Cryptography

by Danny Dolev, Cynthia Dwork, Moni Naor - SIAM Journal on Computing , 2000
"... The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract - Cited by 480 (20 self) - Add to MetaCart
The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related

Searchable Encryption with Secure and Efficient Updates

by Florian Hahn, Florian Kerschbaum - in CCS’14. ACM
"... Searchable (symmetric) encryption allows encryption while still enabling search for keywords. Its immediate applica-tion is cloud storage where a client outsources its files while the (cloud) service provider should search and selectively retrieve those. Searchable encryption is an active area of re ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
-tent. Unfortunately, efficient, dynamic searchable encryp-tion schemes suffer from various drawbacks. Either they deteriorate from semantic security to the security of deter-ministic encryption under updates, they require to store in-formation on the client and for deleted files and keywords or they have very large

Optimal Asymmetric Encryption

by Mihir Bellare, Phillip Rogaway , 1994
"... Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme ca ..."
Abstract - Cited by 275 (14 self) - Add to MetaCart
Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme

Multi-Key Searchable Encryption

by Raluca Ada Popa, Nickolai Zeldovich
"... We construct a searchable encryption scheme that enables keyword search over data encrypted with different keys. The scheme is practical and was designed to be included in a new system for protecting data confidentiality in client-server applications against attacks on the server. 1 ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
We construct a searchable encryption scheme that enables keyword search over data encrypted with different keys. The scheme is practical and was designed to be included in a new system for protecting data confidentiality in client-server applications against attacks on the server. 1

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

Optimal Asymmetric Encryption – How to Encrypt with RSA

by Mihir Bellare, Phillip Rogaway , 1995
"... Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(rx), where rx is a simple probabilistic encoding of x depending on the hash function; and (ii) the scheme ..."
Abstract - Cited by 224 (21 self) - Add to MetaCart
Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(rx), where rx is a simple probabilistic encoding of x depending on the hash function; and (ii

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

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
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
Next 10 →
Results 1 - 10 of 331
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University