Results 1 - 10 of 360

Verified Delegated Quantum Computing with One Pure Qubit

by Theodoros Kapourniotis, Elham Kashefi, Animesh Datta , 2014
"... While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit model have attracted considerable attention. An important step in the construction of these limited quantum computational devices is the un-derstanding of whether the ver ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
the verification of the computation within these models could be also performed in the restricted scheme. Encoding via blindness (a cryptographic protocol for dele-gated computing) has proven successful for the verification of universal quantum computation with a restricted verifier. In this paper, we present

Two 1-Round Protocols for Delegation of Computation

by Ran Canetti, Ben Riva, Guy N. Rothblum , 2011
"... Consider a weak client that wishes to delegate computation to an untrusted server and be able to succinctly verify the correctness of the result, all within one round of interaction. We provide solutions for two relaxed variants of this problem. Specifically: • We consider a model where the client d ..."
Abstract - Add to MetaCart
Consider a weak client that wishes to delegate computation to an untrusted server and be able to succinctly verify the correctness of the result, all within one round of interaction. We provide solutions for two relaxed variants of this problem. Specifically: • We consider a model where the client

Independently-Verifiable Decentralized Role-Based Delegation

by Roberto Tamassia, Danfeng Yao, William H. Winsborough , 2004
"... In open systems such as Grid computing and Internet, delegation transfers privileges among users across different administrative domains and facilitates information sharing. We present an independently-verifiable delegation mechanism, where a delegation credential can be verified without the partic ..."
Abstract - Add to MetaCart
In open systems such as Grid computing and Internet, delegation transfers privileges among users across different administrative domains and facilitates information sharing. We present an independently-verifiable delegation mechanism, where a delegation credential can be verified without

Rational arguments: Single round delegation with sublinear verification

by Siyao Guo, Alon Rosen, Margarita Vald - In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS ’14 , 2014
"... Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is neither honest nor malicious, but rather rational. The advantage of rational proofs over their classical counterparts is that they allow for extremely low communication and ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
by log-space uniform circuits of O(logn)-depth, admits rational protocols that are simultaneously one-round and polylog(n) time verifiable. This demonstrates the potential of rational arguments as a way to extend the notion of “super-efficient " rational proofs beyond the class TC0. The low

The Round Complexity of Verifiable Secret Sharing and Secure Multicast

by Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin , 2001
"... The round complexity of interactive protocols is one of their most important complexity measures. In this work we study the exact round complexity of two basic secure computation tasks: Verifiable Secret Sharing (VSS) and Secure Multicast. VSS allows a dealer to share a secret among several players ..."
Abstract - Cited by 27 (6 self) - Add to MetaCart
The round complexity of interactive protocols is one of their most important complexity measures. In this work we study the exact round complexity of two basic secure computation tasks: Verifiable Secret Sharing (VSS) and Secure Multicast. VSS allows a dealer to share a secret among several players

Refereed delegation of computation

by Ran Canetti, Ben Riva, Guy N. Rothblum
"... We consider a weak client that wishes to learn and verify the result of an expensive computation. When the client uses only a single untrusted server, current techniques suffer from disadvantages such as computational inefficiency for the client or the server, limited functionality, or high round co ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
We consider a weak client that wishes to learn and verify the result of an expensive computation. When the client uses only a single untrusted server, current techniques suffer from disadvantages such as computational inefficiency for the client or the server, limited functionality, or high round

The Heisenberg representation of quantum computers, talk at

by Daniel Gottesman - International Conference on Group Theoretic Methods in Physics , 1998
"... Since Shor’s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers — the difficulty of describing them on classical computers — also makes it diff ..."
Abstract - Cited by 101 (2 self) - Add to MetaCart
Since Shor’s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers — the difficulty of describing them on classical computers — also makes

Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols

by Gilles Brassard, Claude Crépeau, Moti Yung , 1991
"... A perfect zero-knowledge interactive protocol allows a prover to convince a verifier of the validity of a statement in a way that does not give the verifier any additional information [GMR,GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verifier. ..."
Abstract - Cited by 44 (5 self) - Add to MetaCart
. An important measure of efficiency for these protocols is the number of rounds in the interaction. In previously known perfect zero-knowledge protocols for statements concerning NP--complete problems [BCC], at least k rounds were necessary in order to prevent one party from having a probability of undetected

Verifying computations with streaming interactive proofs

by Graham Cormode, Justin Thaler, Ke Yi - In Proceedings of the 1st Symposium on Innovations in Computer Science , 2010
"... When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems can give the necessary assurance, but prior work is not sufficiently scalable or practical. In this paper, we develop ne ..."
Abstract - Cited by 26 (8 self) - Add to MetaCart
new proof protocols for verifying computations which are streaming in nature: the verifier (data owner) needs only logarithmic space and a single pass over the input, and after observing the input follows a simple protocol with a prover (service provider) that takes logarithmic communication spread

The Round-Complexity of Verifiable Secret-Sharing and Secure Multicast

by Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin , 2001
"... The round complexity of interactive protocols is one of their most important complexity measures. In this work we study the exact round complexity of two basic secure computation tasks: Veriable Secret Sharing (VSS) and Secure Multicast. VSS allows a dealer to share a secret among several players in ..."
Abstract - Add to MetaCart
The round complexity of interactive protocols is one of their most important complexity measures. In this work we study the exact round complexity of two basic secure computation tasks: Veriable Secret Sharing (VSS) and Secure Multicast. VSS allows a dealer to share a secret among several players
Results 1 - 10 of 360