English
Related papers

Related papers: Delayed choice relativistic quantum bit commitment…

200 papers

We analyze Assessment Voting, a new two-round voting procedure that can be applied to binary decisions in democratic societies. In the first round, a randomly-selected number of citizens cast their vote on one of the two alternatives at…

Econometrics · Economics 2018-02-06 Hans Gersbach , Akaki Mamageishvili , Oriol Tejada

This paper proposes a cheat sensitive quantum bit commitment (CSQBC) scheme based on single photons, in which Alice commits a bit to Bob. Here, Bob only can cheat the committed bit with probability close to $0$ with the increasing of used…

Quantum Physics · Physics 2015-06-22 Yan-Bing Li , Sheng-Wei Xu , Wei Huang , Zhong-Jie Wan

Under rather general assumptions about the properties of a noisy quantum channel, a first quantum protocol is proposed which allows to implement the secret bit commitment with the probability arbitrarily close to unity.

Quantum Physics · Physics 2007-05-23 S. N. Molotkov , S. S. Nazin

We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the…

Quantum Physics · Physics 2022-12-06 Philippe Nain , Gayane Vardoyan , Saikat Guha , Don Towsley

We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. We observe that existing techniques readily give a polynomial-round…

Quantum Physics · Physics 2020-11-23 Amit Agarwal , James Bartusek , Vipul Goyal , Dakshita Khurana , Giulio Malavolta

Quantum repeaters are essential for achieving long-distance quantum communication due to photon loss, which grows exponentially with the channel distance. Current quantum repeater generations use entanglement distillation protocols, where…

Quantum Physics · Physics 2025-10-09 Iftach Yakar , Michael Ben-Or

We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its…

In this paper, we present a quantum secure multi-party summation protocol, which allows multiple mutually distrustful parties to securely compute the summation of their secret data. In the presented protocol, a semitrusted third party is…

Quantum Physics · Physics 2021-03-26 Hong Chang , Yiting Wu , Gongde Guo , Song Lin

We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…

Quantum Physics · Physics 2023-09-07 Kazuki Ikeda , Adam Lowe

We propose a new scheme for quantum secret sharing (QSS) that uses a modulated high-dimensional time-bin entanglement. By modulating the relative phase randomly by {0,pi}, a sender with the entanglement source can randomly change the sign…

Quantum Physics · Physics 2009-11-13 Hiroki Takesue , Kyo Inoue

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 communication game in the sequential measurement scenario, involving a sender and two receivers with restricted communication among the latter parties. In the framework of the prepare-transform-measure scenario, we find a…

Quantum Physics · Physics 2026-02-17 Pritam Roy , Subhankar Bera , A. S. Majumdar , Shiladitya Mal

A class of quantum protocols to teleport bipartite (entangled) states of two qubits is suggested. Our schemes require a single entangled pair shared by the two parties and the transmission of three bits of classical information, as well as…

Quantum Physics · Physics 2009-11-11 Mary M. Cola , Matteo G. A. Paris

Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…

Quantum Physics · Physics 2025-06-10 Debarupa Saha , Priya Ghosh , Kornikar Sen , Chirag Srivastava , Ujjwal Sen

Quantum digital signature is used to authenticate the identity of the signer with information theoretical security, while providing non-forgery and non-repudiation services. In traditional multi-receiver quantum digital signature schemes…

Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in this context are contention resolution schemes. Such schemes…

Data Structures and Algorithms · Computer Science 2019-05-22 Simon Bruggmann , Rico Zenklusen

Quantum bit commitment has been known to be impossible by the independent proofs of Mayers, and Lo and Chau, under the assumption that the whole quantum states right before the unveiling phase are static to users. We here provide an…

Quantum Physics · Physics 2009-09-15 Jeong Woon Choi , Dowon Hong , Ku-Young Chang , Dong Pyo Chi , Soojoon Lee

Quantum bit-string commitment[A.Kent, Phys.Rev.Lett., 90, 237901 (2003)] or QBSC is a variant of bit commitment (BC). In this paper, we propose a new QBSC protocol that can be implemented using currently available technology, and prove its…

Quantum Physics · Physics 2009-11-10 Toyohiro Tsurumaru

Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The distance that quantum communication schemes can cover via…

Quantum Physics · Physics 2020-05-12 Sebastiaan Brand , Tim Coopmans , David Elkouss

A simple un-entanglement based quantum bit commitment scheme is presented. Although commitment is unconditionally secure but concealment is not.

Cryptography and Security · Computer Science 2007-05-23 Arindam Mitra
‹ Prev 1 8 9 10 Next ›