A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem

• URL: http://arxiv.org/abs/2401.16679v1
• Date: Tue, 30 Jan 2024 02:05:38 GMT
• Title: A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem
• Abstract summary: The protocol supports an arbitrary number of cryptographers $n$, enabling scalability in both participant count and the volume of anonymous information transmitted. The protocol ensures uniformity by requiring all cryptographers to utilize identical private quantum circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents an innovative entanglement-based protocol to address the Dining Cryptographers Problem, utilizing maximally entangled $\ket{ GHZ_{ n } }$ tuples as its core. This protocol aims to provide scalability in terms of both the number of cryptographers $n$ and the amount of anonymous information conveyed, represented by the number of qubits $m$ within each quantum register. The protocol supports an arbitrary number of cryptographers $n$, enabling scalability in both participant count and the volume of anonymous information transmitted. While the original Dining Cryptographers Problem focused on a single bit of information, i.e., whether a cryptographer paid for dinner, the proposed protocol allows $m$, the number of qubits in each register, to be any arbitrarily large positive integer. This flexibility permits the conveyance of various information, such as the cost of the dinner or the timing of the arrangement. Another noteworthy aspect of the introduced protocol is its versatility in accommodating both localized and distributed versions of the Dining Cryptographers problem. The localized scenario involves all cryptographers gathering physically at the same location, such as a restaurant, simultaneously. In contrast, the distributed scenario accommodates cryptographers situated in different places, engaging in a virtual dinner at the same time. Finally, in terms of implementation, the protocol ensures uniformity by requiring all cryptographers to utilize identical private quantum circuits. This design establishes a completely modular quantum system where all modules are identical. Furthermore, each private quantum circuit exclusively employs the widely used Hadamard and CNOT quantum gates, facilitating straightforward implementation on contemporary quantum computers.

Related papers

• Cloning Encrypted Quantum States in Arbitrary Dimensions [0.0]
  We prove that encrypted qubits can be cloned in higher-order quantum systems.<n>We introduce a new operator to be used in the encryption process and show that it is unitary.<n>We adapt the decryption operator from the reference paper to fit in the framework of multi-level quantum systems.
  arXiv  Detail & Related papers  (2026-04-06T17:37:05Z)
• Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing [0.26217304977339473]
  homomorphic encryption integrates quantum computing with homomorphic encryption. We propose a $(k, n)$-threshold universal quantum homomorphic encryption scheme based on quantum state sharing.
  arXiv  Detail & Related papers  (2025-02-26T06:56:25Z)
• A distributed and parallel $(k, n)$ QSS scheme with verification capability [0.0]
  This article introduces a novel Quantum Secret Sharing scheme with $( k, n )$ threshold and endowed with verification capability. The primary novelty of the new protocol lies in its ability to operate completely parallelly in a fully distributed setup.
  arXiv  Detail & Related papers  (2024-10-24T11:12:38Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Efficient and secure quantum network coding based on quantum full homomorphic encryption [9.06651457984998]
  A quantum full homomorphic encryption protocol is constructed utilizing $d$-dimensional universal quantum gates. The proposed protocol not only enables to transfer information in $d$-dimensional quantum system, but also requires only 1 quantum gate and a key of length 2 in the encryption phase.
  arXiv  Detail & Related papers  (2023-05-25T12:17:15Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Universal construction of decoders from encoding black boxes [4.511923587827301]
  We propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method.
  arXiv  Detail & Related papers  (2021-10-01T08:33:38Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Quantum state preparation protocol for encoding classical data into the amplitudes of a quantum information processing register's wave function [0.0]
  We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition. The protocol combines partial CNOT gate rotations with probabilistic projection onto the desired state.
  arXiv  Detail & Related papers  (2021-07-29T16:02:38Z)
• A practical quantum encryption protocol with varying encryption configurations [0.0]
  We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states. The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
  arXiv  Detail & Related papers  (2021-01-22T20:09:03Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.