{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:44:03Z","timestamp":1771613043138,"version":"3.50.1"},"reference-count":0,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["PoPETs"],"abstract":"<jats:p>Gene Multiple Sequence Alignment is crucial for genomic data analysis, forming the basis for studying its biological significance. The digitization of genomic data allows collaborative analysis on cloud platforms, improving the efficiency and precision of genomic research. However, gene sequences contain sensitive information, posing a risk of privacy leakage with unauthorized access. Balancing privacy, accuracy, and efficiency in multiple sequence alignment for long gene sequences remains a challenge. In this paper, we propose a distributed privacy-preserving multiple sequence alignment scheme for long sequences based on secure multi-party computation. Our scheme includes a method for segmenting long sequences to achieve partially distributed computing and a privacy-preserving method for calculating edit distance among subsequences using secret sharing. The scheme consists of a distributed computing phase and an aggregate computing phase, optimizing efficiency by dropping repeated subsequences alignment. Our proposed scheme achieves accurate and efficient privacy-preserving alignment for long gene sequences.<\/jats:p>","DOI":"10.56553\/popets-2025-0014","type":"journal-article","created":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T19:21:16Z","timestamp":1731266476000},"page":"236-249","source":"Crossref","is-referenced-by-count":2,"title":["Privacy-preserving Multiple Sequence Alignment Scheme for Long Gene Sequence"],"prefix":"10.56553","volume":"2025","author":[{"given":"Yatong","family":"Jiang","sequence":"first","affiliation":[{"name":"Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Shang","sequence":"additional","affiliation":[{"name":"Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[{"name":"Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"35752","published-online":{"date-parts":[[2025,1]]},"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T19:20:46Z","timestamp":1731525646000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2025\/popets-2025-0014.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["10.56553\/popets-2025-0014"],"URL":"https:\/\/doi.org\/10.56553\/popets-2025-0014","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}