English
Related papers

Related papers: On The Round Complexity of Secure Quantum Computat…

200 papers

Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…

Quantum Physics · Physics 2025-11-12 David Reichmuth , Ittoop Vergheese Puthoor , Petros Wallden , Erika Andersson

Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation…

Quantum Physics · Physics 2015-09-01 Shih-Min Hung , Tzonelih Hwang

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long…

Quantum Physics · Physics 2010-08-03 Iordanis Kerenidis , Stephanie Wehner

Knowledge extraction, typically studied in the classical setting, is at the heart of several cryptographic protocols. We introduce the notion of secure quantum extraction protocols. A secure quantum extraction protocol for an NP relation…

Quantum Physics · Physics 2020-09-28 Prabhanjan Ananth , Rolando L. La Placa

We introduce a scheme for secure multi-party computation utilising the quantum correlations of entangled states. First we present a scheme for two-party computation, exploiting the correlations of a Greenberger-Horne-Zeilinger state to…

Quantum Physics · Physics 2010-07-27 Klearchos Loukopoulos , Daniel E. Browne

In this paper, we extend the protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev to make the verification efficient. Our result is obtained in the following three steps: $\bullet$ We show that…

Quantum Physics · Physics 2020-03-16 Nai-Hui Chia , Kai-Min Chung , Takashi Yamakawa

The application of secure multiparty computation (MPC) in machine learning, especially privacy-preserving neural network training, has attracted tremendous attention from the research community in recent years. MPC enables several data…

Cryptography and Security · Computer Science 2021-02-11 Ziyao Liu , Ivan Tjuawinata , Chaoping Xing , Kwok-Yan Lam

Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are…

Quantum Physics · Physics 2007-05-23 Claude Crepeau , Daniel Gottesman , Adam Smith

Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a protocol that lifts classical SMPC to quantum SMPC in a…

Quantum Physics · Physics 2023-03-17 Theodoros Kapourniotis , Elham Kashefi , Dominik Leichtle , Luka Music , Harold Ollivier

Secure multi-party computation (MPC) allows a set of parties to compute a function jointly while keeping their inputs private. Compared with the MPC based on garbled circuits,some recent research results show that MPC based on secret…

Cryptography and Security · Computer Science 2020-01-07 Satsuya Ohata , Koji Nuida

We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are…

Quantum Physics · Physics 2013-06-17 Li Yang

Motivated by the applications of secure multiparty computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum…

We propose a new concept, oblivious quantum computation, which requires performing oblivious transfer with respect to the computation outcome of the quantum computation, where the secrecy of the input qubits and the program to identify the…

Quantum Physics · Physics 2023-05-12 Masahito Hayashi

Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We construct a round-optimal (2 rounds)…

Cryptography and Security · Computer Science 2017-10-24 Paulo S. L. M. Barreto , Bernardo David , Rafael Dowsley , Kirill Morozov , Anderson C. A. Nascimento

After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner,…

Quantum Physics · Physics 2011-03-02 Roger Colbeck

Since the negative result of Lo (Physical Review A, 1997), it has been left open whether there exist some functions that can be securely computed in two-party setting in quantum domain when one of the parties is malicious. In this paper, we…

Cryptography and Security · Computer Science 2016-05-03 Arpita Maitra , Goutam Paul , Asim K. Pal

Inspired by the semi-quantum protocols, this paper defines the lightweight quantum security protocols, in which lightweight participants can only operate two out of four very lightweight quantum operations. Subsequently, this study proposes…

Quantum Physics · Physics 2020-11-17 Tzonelih Hwang , Yen-Jie Chen , Chia-Wei Tsai , Cheng-Ching Kuo

MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious…

Quantum Physics · Physics 2020-12-01 Alex B. Grilo , Huijia Lin , Fang Song , Vinod Vaikuntanathan

We propose protocols for obliviously evaluating finite-state machines, i.e., the evaluation is shared between the provider of the finite-state machine and the provider of the input string in such a manner that neither party learns the…

Cryptography and Security · Computer Science 2022-01-07 Rafael Dowsley , Caleb Horst , Anderson C. A. Nascimento

We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get efficiency via OT extension in the…

Cryptography and Security · Computer Science 2012-02-15 Jesper Buus Nielsen , Peter Sebastian Nordholt , Claudio Orlandi , Sai Sheshank Burra