A privacy protection method for genome multiple sequence alignment based on secret sharing

By combining arithmetic secret sharing, Boolean secret sharing, and Yao's secret sharing methods, a secret-sharing data slice is constructed, which solves the privacy protection problem in genome multiple sequence alignment, achieves efficient approximate multiple sequence alignment, and ensures the privacy and security of genome data as well as computational utility.

CN119885256BActive Publication Date: 2025-11-25BEIHANG UNIV +1
2 Cites 0 Cited by

Patent Information

Application Number
CN202411850546.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-12-16
Publication Date
2025-11-25
Estimated Expiration
2044-12-16

AI Technical Summary

Technical Problem

Existing technologies pose a risk of privacy information leakage in genome multiple sequence alignment, and existing privacy protection methods are inefficient and inflexible, making it difficult to meet computational needs.

Method used

A secure multi-party computation method based on secret sharing is adopted. By combining arithmetic secret sharing, Boolean secret sharing and Yao's secret sharing, secret sharing data slices are constructed to protect the privacy of genome sequences. Seed sequence construction and rearrangement methods are used to reduce the time overhead in the multiple sequence alignment process and achieve approximate multiple sequence alignment.

Benefits of technology

It improves the efficiency of privacy protection and computation in genome multiple sequence alignment, ensuring the privacy and security of genomic data while maintaining the accuracy of computation results.

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

Abstract

The application provides a privacy protection method for genome multi-sequence alignment based on secret sharing, comprising the following steps: step one, a query party splits a genome sequence in a genome dataset; step two, the query party constructs a local public sub-sequence set; step three, a computing node A acquires a seed sequence set by alignment; step four, the query party locally reconstructs a seed sequence order; step five, the query party splits the genome sequence to obtain a sequence to be aligned; step six, the query party locally constructs secret sharing data slices; step seven, the computing nodes A and B perform multi-sequence alignment on the secret sharing data slices; and step eight, the query party restores and obtains a multi-sequence alignment calculation result. The application protects the privacy information of the genome sequence in the multi-sequence alignment process when realizing high-precision approximate multi-sequence alignment, and realizes the privacy protection of the genome multi-sequence alignment.
Need to check novelty before this filing date? Find Prior Art