As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their high computational complexity and huge key size. In 2013, Coron et al. proposed a batch homomorphic encryption scheme, i.e. a scheme that supports encrypting and homomorphically evaluating several plaintext bits as...

In recent years, image sharing method has become a popular technique due to the characteristics of security and simplicity. However, pixel expansion and bad image contrast are two common disadvantages that must be improved. This paper proposes an image sharing method to improve the problems mentioned above. First, the homomorphic encryption is utilized to enhance the security of digital images....

To perform automatic, unconscious inference, the human brain must solve the ”binding problem” by correctly grouping properties with objects. We propose a connectionist, localist model that uses short signatures, rather than temporal synchrony or other means, to do this binding. The proposed system models our ability to both perform unification and handle multiple instantiations of logical terms...

An Oblivious Parallel RAM (OPRAM) provides a general method to simulate any Parallel RAM (PRAM) program, such that the resulting memory access patterns leak nothing about secret inputs. OPRAM was originally proposed by Boyle et al. as the natural parallel counterpart of Oblivious RAM (ORAM), which was shown to have broad applications, e.g., in cloud outsourcing, secure processor design, and sec...

We study the NP-complete Graph Motif problem: given a vertex-colored graph G = (V, E) and a multiset M of colors, does there exist an S ⊆ V such that G[S] is connected and carries exactly (also with respect to multiplicity) the colors in M? We present an improved randomized algorithm for Graph Motif with running time O(4.32 · |M | · |E|). We extend our algorithm to list-colored graph vertices a...