Efficient Public Key Encryption with Disjunctive Keywords Search Using the New Keywords Conversion Method

Authors
  • YuZhang
  • YinLi
  • YifanWang
Abstract

برای دانلود باید عضویت طلایی داشته باشید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public Key Encryption with Searchable Keywords Based on Jacobi Symbols

Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 10 / 46 Vishal Saraswat Some other projects Abstract Public-key encryption with keyword search (PEKS) schemes are useful to delegate searching capabilities on encrypted data to a third party, who does not hold the entire secret key, but only an appropriate token which allows searching operations but preserves data privacy. PE...

متن کامل

Efficient Distributed Search for Multicast Session Keywords

mDNS is a proposed DNS-aware, hierarchical, and scalable multicast session directory architecture that enables multicast session registration and makes them discoverable in real time. It supports domain-specific as well as global searches for candidate sessions. This paper improves mDNS global search algorithm and addresses various security and scalability concerns that remained in mDNS. We pro...

متن کامل

Efficient Public Key Encryption with Keyword Search Schemes from Pairings

Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the keyword W , but learn nothing else. In this paper, we propose a new PKES scheme based on pairings. There is no pairing operation involved in the encryption procedure. Then, we provide further discussion on removing se...

متن کامل

A New Trapdoor-indistinguishable Public Key Encryption with Keyword Search

The public key encryption with keyword search (PEKS) provides a way for users to search data which are encrypted under the users’ public key on a storage system. However, the original schemes are based on the unrealistic assumption of a secure channel between the receiver and the server. Baek et al. [1] first proposed a secure channel-free public key encryption with keyword search (SCF-PEKS) to...

متن کامل

Robustly Anchoring Annotations Using Keywords Robustly Anchoring Annotations Using Keywords

As the number of systems which offer annotations on digital documents increases, robust anchoring of annotations is a key challenge. It is especially important if the annotator lacks write-access to the document being annotated. For example, if someone makes an annotation on a web page today and the web page changes tomorrow, what happens to the annotation? One approach is simply to “orphan” th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دسترسی به متن کامل این مقاله و 23 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

Article info

Journal name: Information

Year: 2018

ISSN: 2078-2489

DOI: 10.3390/info9110272