Authorized and Verifiable Searchable Encryption Based on Public Key Equality Test for Cloud Storage

• URL: http://arxiv.org/abs/2606.07319v1
• Date: Fri, 05 Jun 2026 14:38:57 GMT
• Title: Authorized and Verifiable Searchable Encryption Based on Public Key Equality Test for Cloud Storage
• Abstract summary: Cloud storage revolutionizes data management but raises conflicts between functionality and privacy.<n>PKEET can enable multi-user searchable encryption (SE) through cross-key ciphertext comparison without shared keys.<n>Existing PKEET-based SE schemes lack ciphertext-file-level authorization, public verifiability, or SE-level support.<n>This paper first proposes a novel PKEET scheme, AVPKEET (Authorized and Verifiable PKEET)<n>It enables non-transferable and non-replayable authorization of ciphertext files, while supporting public verifiability, all without the need for trusted third parties
• Score: 9.042313728893694
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cloud storage revolutionizes data management but raises conflicts between functionality and privacy. Public Key Encryption with Equality Test (PKEET), an advanced cryptographic technique, can enable multi-user searchable encryption (SE) through cross-key ciphertext comparison without shared keys. However, existing PKEET-based SE schemes lack ciphertext-file-level authorization, public verifiability, or SE-level support. This paper first proposes a novel PKEET scheme, AVPKEET (Authorized and Verifiable PKEET). It enables non-transferable and non-replayable authorization of ciphertext files, while supporting public verifiability, all without the need for trusted third parties. Then we propose an AVPKEET-based SE scheme, denoted as AVSE (Authorized and Verifiable SE), featuring one-time non-transferable tokens bound to users and nonces, batch operations, and fine-grained access control (ALL, PARTIAL, SINGLE). We prove OW-CCA2 security, token unforgeability, and verification soundness under standard assumptions. Experiment results demonstrate that AVSE achieves the most compact token size (168 bytes) while uniquely providing both ciphertext-file-level authorization and public verification, with acceptable overhead for cloud storage deployment.

Related papers

• Send the Key in Cleartext: Halving Key Consumption while Preserving Unconditional Security in QKD Authentication [59.664950447941386]
  Quantum Key Distribution (QKD) protocols require Information-Theoretically Secure (ITS) authentication of the classical channel to preserve the unconditional security of the distilled key.<n>Since QKD requires mutual authentication, two independent one-time keys are typically consumed per round, imposing a non-trivial overhead on the net secure key rate.<n>We present a novel ITS authentication scheme based on $varepsilon$-Almost Strongly Universal$ ($varepsilon$-ASU$)
  arXiv  Detail & Related papers  (2026-03-26T14:36:05Z)
• Multiparty Authorization for Secure Data Storage in Cloud Environments using Improved Attribute-Based Encryption [0.0]
  Attribute-Based Encryption (ABE) is one of the potential security and access control techniques for secure data storage and authorization.<n>The proposed work divides into two objectives: (i) provide access to authorized users and (ii) secure data storage in a cloud environment.<n>The security and performance analysis results demonstrate that the proposed scheme is more robust and secure.
  arXiv  Detail & Related papers  (2025-12-29T05:41:08Z)
• 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)
• Public Key Encryption with Equality Test from Tag-Based Encryption [0.5729426778193397]
  We propose a generic construction of a PKEET scheme based on tag-based encryption without the random oracle model.<n>Our scheme allows to derive new PKEET schemes without the random oracle model.
  arXiv  Detail & Related papers  (2025-09-22T12:55:46Z)
• Encrypted Federated Search Using Homomorphic Encryption [0.0]
  This paper introduces a privacy-preserving federated search system that allows law enforcement agencies to conduct queries on encrypted criminal databases.<n>The key innovation here is the ability to execute encrypted queries across distributed databases, without the decryption of the data.
  arXiv  Detail & Related papers  (2025-05-05T07:03:30Z)
• 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)
• Hades: Homomorphic Augmented Decryption for Efficient Symbol-comparison -- A Database's Perspective [1.3824176915623292]
  This paper introduces HADES, a novel cryptographic framework that enables efficient and secure comparisons on encrypted data.<n>Based on the Ring Learning with Errors (RLWE) problem, HADES provides CPA-security and incorporates perturbation-aware encryption to mitigate frequency-analysis attacks.
  arXiv  Detail & Related papers  (2024-12-28T02:47:14Z)
• 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)
• Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
  We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss. We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query. We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
  arXiv  Detail & Related papers  (2024-04-10T08:11:12Z)
• The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption [43.669192188610964]
  Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated databases to an honest-but-curious server. This paper studies a new and practical security risk to DSSE, namely, secret key compromise. We introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates.
  arXiv  Detail & Related papers  (2024-03-22T09:21:47Z)
• 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)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• 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.