Efficient privacy-preserving variable-length substring match for genome sequence

DOI10.4230/LIPICS.WABI.2021.2MaRDI QIDQ6133861zbMATH OpenOpenAlexFDO

Authors Satsuya Ohata, Kana Shimizu

Publication date 24 July 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2021/14355/pdf/LIPIcs-WABI-2021-2.pdf/

zbMATH Keywords

FM-indexmaximal exact matchprivate genome sequence searchsecret sharingsecure multiparty computationsuffix tree

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Private computation on encrypted genomic data
• Communication-Efficient Private Protocols for Longest Common Subsequence
• Combinatorial Pattern Matching
• On limitations and alternatives of privacy-preserving cryptographic protocols for genomic data

Cited in

(1)

• Faster privacy-preserving computation of edit distance with moves

This page was built for publication: Efficient privacy-preserving variable-length substring match for genome sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133861)