Cyber-physical-social systems (CPSS) are revolutionizing the relationships between humans, computers, and things. Outsourcing computation to cloud can offer resources-constrained enterprises consumers sustainable computing in CPSS. However, ensuring security of data such an outsourced environment remains a research challenge. Principal eigentensor has emerged as powerful tool dealing with multi...

Abstract Secure multi-party computation (MPC) is a promising technique for privacy-persevering applications. A number of MPC frameworks have been proposed to reduce the burden designing customized protocols, allowing non-experts quickly develop and deploy To improve performance, recent allow users declare variables secret only these which are be protected. However, in practice, it usually highl...

We present a computationally secure classical homomorphic encryption scheme for quantum circuits. The scheme allows a classical server to blindly delegate a quantum computation to a quantum server; the server is able to run the computation without learning about the computation itself. This result relies on postquantum classical cryptographic tools, including sub-exponentially secure indistingu...

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

By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether ...

We discuss various aspects of secure distributed computation and look at weakening both the goals of such computation and the assumed capabilities of adversaries. We present a new protocol for a conditional form of probabilistic coordination and present a model of secure distributed computation in which friendly and hostile nodes are represented in competing interwoven networks of nodes. It is ...