Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

A Universal Problem in Secure and Verifiable Distributed Computation

Ming-Deli A. Huang, Shang‐Hua Teng

Published Jan 1, 1990• 2 citations
Publisher
DOI
10.1007/0-387-34799-2_27

Related papers

Verifiable Quantum Cloud Computation Scheme Based on Blind Computation

Jing Li, Yang Zhao, Yubo Yang +1 more

In this paper, we propose a verifiable quantum cloud computation scheme based on blind quantum computation which effectively solves the privacy and verifiability problem for clients when interfacing with quantum computer in cloud computation. Different from most of present works (e.g. using brickwork state as resource state), we use cluster state with grid distributed structure to realize the universal and cryptographic calculation which is more suitable for the distributed architecture of cloud computation. Throughout the process, the random key is always held by the client that effectively promote the confidentiality. Moreover, we propose a new method to make the client Alice verifies the correctness of the results through only classical calculation. Security analysis shows that cloud server Bob can only obtain the dimension of input state and cluster state from the calculation, but cannot obtain any information of the input, the output and the algorithm. Dishonest Bob will be detected during the verification.

IEEE Access•Jan 1, 2020•2 citations

The Varieties of Secure Distributed Computation

Matthew K. Franklin, Moti M. Yung

Springer eBooks•Jan 1, 1993•15 citations

Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data

Rafael Dowsley, Jörn Müller‐Quade, Akira Otsuka +3 more

This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data pre-distributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure protocols for performing multiplication of shares based on pre-distributed data which generalize two-party computations based on linear pre-distributed bit commitments. The main results of this paper are a non-interactive VSS, a simplified multiplication protocol for shared values based on pre-distributed random products, and non-interactive zero knowledge proofs for arbitrary polynomial relations. The security of the schemes is proved using the UC framework.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2011•16 citations

On necessary conditions for secure distributed computation

Rafail Ostrovsky, Moti Young

DIMACS series in discrete mathematics and theoretical computer science•Apr 3, 1991•2 citations

Verifiable Multi‐Party Universal Blind Quantum Computing in Distributed Networks

SHAN Ruiting, CHEN Xiubo, Gang Xu +4 more

Blind quantum computing (BQC) ensures that a classical client could delegate complex computing tasks to a remote quantum server safely. In order to detect the dishonest behavior of the participants, we present a verifiable multi-party universal BQC protocol in distributed networks. By using the stabilizer formalism, we propose an honesty check method to test the correctness of the graph states generated by the servers. The honesty of both the clients and the servers can be judged fairly with the help of the arbitrator. Moreover, a load balancer is introduced to control the possible breakdown of servers in the network. No-signaling principle ensures the unconditional security of the protocol. Through the use of universal resource states, our protocol can be applied in more multi-party verifiable universal BQC protocols. The failure management and workload balancing of the protocol also provide a promising prospect for the future BQC network.

Chinese Journal of Electronics•Jul 1, 2021•3 citations

Almost-Everywhere Secure Computation

Juan A. Garay, Rafail Ostrovsky

Springer eBooks•Apr 4, 2008•58 citations
In this paper, we propose a verifiable quantum cloud computation scheme based on blind quantum computation which effectively solves the privacy and verifiability problem for clients when interfacing with quantum computer in cloud computation. Different from most of present works (e.g. using brickwork state as resource state), we use cluster state with grid distributed structure to realize the universal and cryptographic calculation which is more suitable for the distributed architecture of cloud computation. Throughout the process, the random key is always held by the client that effectively promote the confidentiality. Moreover, we propose a new method to make the client Alice verifies the correctness of the results through only classical calculation. Security analysis shows that cloud server Bob can only obtain the dimension of input state and cluster state from the calculation, but cannot obtain any information of the input, the output and the algorithm. Dishonest Bob will be detected during the verification.
This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data pre-distributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure protocols for performing multiplication of shares based on pre-distributed data which generalize two-party computations based on linear pre-distributed bit commitments. The main results of this paper are a non-interactive VSS, a simplified multiplication protocol for shared values based on pre-distributed random products, and non-interactive zero knowledge proofs for arbitrary polynomial relations. The security of the schemes is proved using the UC framework.
Blind quantum computing (BQC) ensures that a classical client could delegate complex computing tasks to a remote quantum server safely. In order to detect the dishonest behavior of the participants, we present a verifiable multi-party universal BQC protocol in distributed networks. By using the stabilizer formalism, we propose an honesty check method to test the correctness of the graph states generated by the servers. The honesty of both the clients and the servers can be judged fairly with the help of the arbitrator. Moreover, a load balancer is introduced to control the possible breakdown of servers in the network. No-signaling principle ensures the unconditional security of the protocol. Through the use of universal resource states, our protocol can be applied in more multi-party verifiable universal BQC protocols. The failure management and workload balancing of the protocol also provide a promising prospect for the future BQC network.