Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols

DOI10.1007/978-3-319-26059-4_20MaRDI QIDQ3464410zbMATH OpenOpenAlexFDO

Authors Bernardo David, Rafael Dowsley, Raj Katti, Anderson Nascimento

Publication date 27 January 2016

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26059-4_20

zbMATH Keywords

commodity based modelprivate machine learningsecure comparisonunconditional security

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Privacy-preserving classifier learning
• Efficient secure multi-party protocols for decision tree classification
• New protocols for secure equality test and comparison
• Privacy-preserving support vector machines with flexible deployment and error correction
• Secure two-party integer comparison protocol without any third party

Cited in

(6)

• Unsupervised Machine Learning on encrypted data
• Constant-round client-aided secure comparison protocol
• Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
• Privacy-preserving support vector machines with flexible deployment and error correction
• Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
• Client-aided privacy-preserving machine learning

This page was built for publication: Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols

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