Quantum and semi-quantum sealed-bid auction: Vulnerabilities and advantages

• URL: http://arxiv.org/abs/2108.06388v1
• Date: Fri, 13 Aug 2021 20:34:50 GMT
• Title: Quantum and semi-quantum sealed-bid auction: Vulnerabilities and advantages
• Authors: Pramod Asagodu, Kishore Thapliyal and Anirban Pathak
• Abstract summary: Existing protocols for quantum sealed-bid auction are critically analyzed. A new protocol for sealed-bid auction is proposed which is semi-quantum in nature. The proposed protocol is free from the vulnerabilities reported here in the context of the existing protocols.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A family of existing protocols for quantum sealed-bid auction is critically analyzed, and it is shown that they are vulnerable under several attacks (e.g., the participant's and non-participant's attacks as well as the collusion attack of participants) and some of the claims made in these works are not correct. We obtained the bounds on the success probability of an eavesdropper in accessing the sealed-bids. Further, realizing the role of secure sealed-bid auction in the reduction of corruption, a new protocol for sealed-bid auction is proposed which is semi-quantum in nature, where the bidders do not have quantum resources but they can perform classical operations on the quantum states. The security of the proposed protocol is established against a set of attacks, and thus it is established that the proposed protocol is free from the vulnerabilities reported here in the context of the existing protocols.

Related papers

• Secure quantum bit commitment from separable operations [0.0]
  We show that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit commitment schemes. Specifically, we prove that in any perfectly hiding bit commitment protocol, an honestly-committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment.
  arXiv  Detail & Related papers  (2025-01-13T14:15:11Z)
• Loss-tolerant quantum key distribution with detection efficiency mismatch [39.58317527488534]
  We establish a security proof for the loss-tolerant P&M QKD protocol that incorporates imperfections in both the source and the detectors. Specifically, we demonstrate the security of this scheme when the emitted states deviate from the ideal ones.
  arXiv  Detail & Related papers  (2024-12-12T19:01:56Z)
• Why quantum state verification cannot be both efficient and secure: a categorical approach [0.0]
  We show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. Our findings show that the prevailing cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure.
  arXiv  Detail & Related papers  (2024-11-07T15:07:29Z)
• Certifying classes of $d$-outcome measurements with quantum steering [49.1574468325115]
  We provide a construction of a family of steering inequalities tailored to large classes of $d$-outcomes projective measurements. We prove that the maximal quantum violation of those inequalities can be used for certification of those measurements and the maximally entangled state of two qudits.
  arXiv  Detail & Related papers  (2024-10-27T15:32:53Z)
• Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
  We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection. Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
  arXiv  Detail & Related papers  (2024-09-30T15:57:17Z)
• A Secure Quantum Key Distribution Protocol Using Two-Particle Transmission [0.0]
  Unextendible Product Bases (UPBs) hold promise in quantum cryptography due to their inherent indistinguishability. This work introduces a protocol utilizing UPBs to establish quantum keys between distant parties.
  arXiv  Detail & Related papers  (2024-03-20T14:33:17Z)
• Collective attack free controlled quantum key agreement without quantum memory [0.0]
  We present a new protocol for controlled quantum key agreement and another protocol for key agreement with a specific focus on the security analysis. Specifically, detailed security proof is provided against impersonated fraudulent attack and collective attacks.
  arXiv  Detail & Related papers  (2023-08-10T09:51:23Z)
• Security of a Continuous-Variable based Quantum Position Verification Protocol [0.0]
  We present and analyze a protocol that utilizes coherent states and its properties. We prove security of the protocol against any unentangled attackers via entropic uncertainty relations. We show that attackers who pre-share one continuous-variable EPR pair can break the protocol.
  arXiv  Detail & Related papers  (2023-08-08T09:56:38Z)
• Semi-device independent nonlocality certification for near-term quantum networks [46.37108901286964]
  Bell tests are the most rigorous method for verifying entanglement in quantum networks. If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used. We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

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.