Results 1  10
of
16
Secure Multiparty Quantum Computation with (Only) a Strict Honest
 Proc. 47th Annual IEEE Symposium on the Foundations of Computer Science (FOCS ’06
, 2006
"... ..."
Discreetly distributing computation via selfassembly
, 2007
"... One aspect of large networks, such as the Internet, is the colossal amount of computation its nodes could perform if that computation were distributed efficiently. The Internet has already led to solving some problems, e.g., NPcomplete problems, that were unlikely to have been solved on individual ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
(Show Context)
One aspect of large networks, such as the Internet, is the colossal amount of computation its nodes could perform if that computation were distributed efficiently. The Internet has already led to solving some problems, e.g., NPcomplete problems, that were unlikely to have been solved on individual computers. However, the methods leading to those solutions disclosed inputs, algorithms, and outputs to the Internet nodes. It has even been argued in the literature that it is not possible to ask an entity for help with solving NPcomplete problems without disclosing the input and algorithm. In this paper, we present an architectural style that distributes computation over a network discreetly, such that no small group of computers (asymptotically smaller than Θ(n log n) for an nbit input) knows the algorithm or the input. The style abstracts away the distribution and only requires writing nonparallel code, automating in turn the parallelization of computation. Further, the style is faultand adversarytolerant (malicious, faulty, and unstable nodes may not break the computation) and scalable (communication among the nodes does not increase with network or problem size). Systems designed and constructed according to the style free the architect from having to worry about these nonfunctional properties. We formally argue that our architectural style has all three properties: discreetness, fault and adversary tolerance, and scalability. 1.
Quantum coins
 In ErrorCorrecting Codes, Finite Geometries and Cryptography
, 2010
"... ar ..."
(Show Context)
Preserving privacy in distributed computation via selfassembly
, 2008
"... We present the tile style, an architectural style that allows the creation of distributed software systems for solving NPcomplete problems on large public networks. The tile style preserves the privacy of the algorithm and data, tolerates faulty and malicious nodes, and scales well to leverage the ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
We present the tile style, an architectural style that allows the creation of distributed software systems for solving NPcomplete problems on large public networks. The tile style preserves the privacy of the algorithm and data, tolerates faulty and malicious nodes, and scales well to leverage the size of the public network to accelerate the computation. We exploit the known property of NPcomplete problems to transform important realworld problems, such as protein folding, image recognition, and resource allocation, into canonical problems, such as 3SAT, that the tile style solves. We provide a full formal analysis of the tile style that indicates the style preserves data privacy as long as no adversary controls more than half of the public network. We also present an empirical evaluation showing that problems requiring privacypreservation can be solved on a very large network using the tile style orders of magnitude faster than using existing alternatives. 1
Symmetric quantum fully homomorphic encryption with perfect security. arXiv: 1304.5087
"... Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic enc ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then we construct a symmetric QFHE scheme based on quantum onetime pad. This scheme permits any unitary transformation on any nqubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security.
SelfAssembly for Discreet, FaultTolerant, and Scalable Computation on InternetSized Distributed Networks
, 2008
"... ..."
Unconditionally verifiable blind computation
, 2014
"... Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client’s input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the serv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client’s input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed a universal and unconditionally secure BQC scheme where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. In this paper we extend that protocol with new functionality allowing blind computational basis measurements, which we use to construct a new verifiable BQC protocol based on a new class of resource states. We rigorously prove that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter. The new resource state allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead. This is a significant improvement on the original scheme, which required that all computations to be performed must first be put into a nearest neighbour form, incurring linear overhead in the number of qubits. Such an improvement has important consequences for efficiency and faulttolerance thresholds. 1
unknown title
, 807
"... Abstract. We present the first protocol which allows Alice to have Bob carry out a quantum computation for her such that Alice’s inputs, outputs and computation remain perfectly private, and where Alice does not require any quantum computational power or memory. She only needs to be able to prepare ..."
Abstract
 Add to MetaCart
Abstract. We present the first protocol which allows Alice to have Bob carry out a quantum computation for her such that Alice’s inputs, outputs and computation remain perfectly private, and where Alice does not require any quantum computational power or memory. She only needs to be able to prepare single qubits from a finite set and send them to Bob, who has the balance of the required quantum computational resources. Our protocol is interactive: after the initial preparation of quantum states, Alice and Bob use twoway classical communication which enables Alice to drive the computation, giving singlequbit measurement instructions to Bob, depending on previous measurement outcomes. The interaction is polynomial in the size of Alice’s underlying quantum circuit. Our protocol works for inputs and outputs that are either classical or quantum. We also discuss the use of authentication in order for Alice to detect an interfering Bob. Furthermore, our construction involves a new, regular universal resource for measurementbased quantum computing called the brickwork state which may also be of independent interest.