Quantum secure blind decryption with two users

• URL: http://arxiv.org/abs/2606.01949v1
• Date: Mon, 01 Jun 2026 09:10:00 GMT
• Title: Quantum secure blind decryption with two users
• Abstract summary: We propose two types of protocols for quantum secure blind decryption.<n>Users ensure the secrecy of the text from the servers.<n>Servers maintain the secrecy of the keys from the users.
• Score: 41.41659382286553
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose two types of protocols for quantum secure blind decryption, involving two users and servers. User 1 holds the encrypted ciphertext. The servers store several indexed keys including the key encrypting the ciphertext. User 2 aims to obtain the decrypted text. The protocols are designed to preserve the following types of secrecy: Users ensure the secrecy of the text from the servers. Servers maintain the secrecy of the keys from the users. Our protocols enable User 2 to obtain the decrypted text while preserving these secrecy requirements. Additionally, the second protocol ensures the secrecy of the key index to identify the key encrypting the ciphertext from the servers, and the second protocol requires two non-commuting servers. Furthermore, we analyze the secrecy of the second protocol under post-attack scenarios, where the two servers communicates with each other after the completion of the protocol. We show that our quantum protocol satisfies the secrecy under these attacks, whereas its classical counterpart fails to do so.

Related papers

• Enhancing Distributed Authorization With Lagrange Interpolation And Attribute-Based Encryption [0.7829352305480287]
  In todays security landscape, every user wants to access large amounts of data with confidentiality and authorization.<n>To access secure data, researchers use access control lists to grant authentication and provide authorization.<n>To cope with these two problems, we proposed multiparty execution on the server.
  arXiv  Detail & Related papers  (2025-12-25T06:26:14Z)
• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Privacy-preserving server-supported decryption [2.2530496464901106]
  We consider encryption systems with two-out-of-two threshold decryption, where one of the parties initiates the decryption and the other one assists. Existing threshold decryption schemes disclose to the server the ciphertext that is being decrypted. We give a construction, where the identity of the ciphertext is not leaked to the server, and the client's privacy is preserved.
  arXiv  Detail & Related papers  (2024-10-25T06:47:53Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• 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)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• Device-independent uncloneable encryption [0.0]
  We introduce a variant of uncloneable encryption in which several possible decryption keys can decrypt a particular encryption.<n>We show that this variant of uncloneable encryption can be achieved device-independently.<n>We show that a simple modification of our scheme yields a single-decryptor encryption scheme.
  arXiv  Detail & Related papers  (2022-10-03T16:17:01Z)
• Two-way Unclonable Encryption with a vulnerable sender [2.355458445741348]
  Unclonable Encryption, introduced by Gottesman in 2003, is a quantum protocol that guarantees the secrecy of a successfully transferred classical message. We propose an Unclonable Encryption protocol with the additional property that the sender's key material is allowed to leak even in the case of an unsuccessful run.
  arXiv  Detail & Related papers  (2020-10-21T08:35:49Z)
• A quantum encryption design featuring confusion, diffusion, and mode of operation [0.0]
  We propose a non-OTP quantum encryption scheme utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features.
  arXiv  Detail & Related papers  (2020-10-06T22:23:30Z)

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.