Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for a constant-depth circuit C of size s with an m-bit input x, we obtain the following types

Commitment schemes are fundamental bricks for guaranteeing fairness in upper level cryptographic protocols. Most commitment schemes in the literature rely on hash functions, which should be strongly collision free for the scheme to be secure. We present a commitment scheme, which avoids hash functions by using a public-key cryptosystem based on braid conjugator search problem instead.

Nearest neighbor search is one of the most fundamental queries on massive datasets, and it has extensive applications such as pattern recognition, statistical classification, graph algorithms, Location-Based Services and online recommendations. In this report, we propose a new searchable scheme, which can efficiently and securely enable nearest neighbor search over encrypted data on untrusted n...

With searchable encryption, a data user is able to perform meaningful search on encrypted data stored in the public cloud without revealing data privacy. Besides handling simple queries (e.g., keyword queries), complex search functions, such as multi-dimensional (conjunctive) range queries, have also been studied in several approaches to support the search of multi-dimensional data. However, cu...

Here is described a preliminary method that enables secure “anti-search-engine” encryption, where the middleman can participate in the encrypted information exchange, without being able to understand the exchanged information, encrypted using a one-way function, as well as being unaware of one of two main exchange participants.

As cloud computing become more flexible & effective in terms of economy, data owners are motivated to outsource their complex data systems from local sites to commercial public cloud. But for security of data, sensitive data has to be encrypted before outsourcing, which overcomes method of traditional data utilization based on plaintext keyword search. Considering the large number of data users...

Weng et al. introduced the notion of conditional proxy re-encryption (or C-PRE, for short), whereby only the ciphertext satisfying one condition set by the delegator can be transformed by the proxy and then decrypted by delegatee. Nonetheless, they left an open problem on how to construct CCA-secure C-PRE schemes with anonymity. Fang et al. answered this question by presenting a construction of...

Cloud servers are virtual servers that can be run on cloud computing environmental and it encrypts data by a common key. Due to this accessing client through server is easy. In this paper, client can encrypt, store and search data by their own key on server. If client sends encrypted queries to the server for searching, it returns the encrypted matching data without knowing about plain text. In...