Multi-table join method supporting Boolean query in encrypted database

By adopting efficient symmetric encryption technology and indexing technology in relational secret databases, multi-table connections for Boolean queries are realized, solving the problems of insufficient functionality and security in existing technologies, improving query efficiency and reducing information leakage.

CN120336352BActive Publication Date: 2025-09-26NANDA SHUAN (TIANJIN) TECHNOLOGY CO LTD
2 Cites 0 Cited by

Patent Information

Application Number
CN202510408440.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-04-02
Publication Date
2025-09-26
Estimated Expiration
2045-04-02

AI Technical Summary

Technical Problem

Existing technologies have difficulty effectively supporting multi-table joins for Boolean queries in relational confidential databases, especially under complex Boolean conditions, and are unable to balance query functionality and privacy protection requirements. In addition, existing solutions have high computational complexity and low query efficiency.

Method used

It uses efficient symmetric encryption and indexing technologies, and implements Boolean condition filtering and multi-table join queries through the EDBSetup and Search protocols jointly executed by the client and server. This includes plaintext database parsing, Boolean attribute orthogonalization, index construction, and data encryption, and utilizes pseudo-random functions and Bloom filters to ensure security and efficiency.

Benefits of technology

It implements secure and efficient multi-table join queries on relational encrypted databases, enhances functionality, reduces information leakage, improves query efficiency, and reduces storage pressure, and supports join operations for any Boolean condition matching items.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

This invention belongs to the research field of data privacy protection and efficient secret computation in secret databases, particularly relational secret databases. Specifically, it relates to a multi-table join method supporting Boolean queries in secret databases. The method comprises the following steps: Step 1: The client executes a secret database initialization protocol (including four modules: plaintext data parsing, Boolean attribute orthogonalization, index construction, and database encryption); Step 2: The client and server interact to implement a search protocol (including the client generating a "query message" and sending it to the server, and the server generating a "response message" and sending it to the client); Step 3: The client decrypts the response and obtains matching results for plaintext row identifiers that meet the query criteria.
Need to check novelty before this filing date? Find Prior Art