String sorting based efficient secure database query

DOI10.13328/J.CNKI.JOS.005358MaRDI QIDQ4624682zbMATH OpenFDO

Authors Shundong Li, Jia Kang, Xiaoyi Yang, Jiawei Dou

Publication date 22 February 2019

zbMATH Keywords

cryptographyhomomorphic encryptionsecure multi-party computationstring sortingmillionaires' problemsecure database query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Searching and sorting (68P10) Database theory (68P15)

Recommendations

• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• A secure multi-party computation protocol for the sorting problem
• Secure \(k\)-skyband computation framework in distributed multi-party databases
• Practically efficient multi-party sorting protocols from comparison sort algorithms
• Efficient secure multiparty computation protocol for sequencing problem over insecure channel

Cited in

(2)

• Practically efficient multi-party sorting protocols from comparison sort algorithms
• A novel quantum solution to privacy-preserving lexicographical string sorting problem

This page was built for publication: String sorting based efficient secure database query

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