Information and Communications Security

DOI10.1007/11602897zbMath1122.68494OpenAlexW4301079923MaRDI QIDQ5393994

Sven Laur, Helger Lipmaa, Taneli Mielikäinen

Publication date: 24 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602897

zbMATH Keywords

privacy-preserving data miningprivate frequent itemset miningprivate itemset support countingprivate subset inclusion test

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Privacy-preserving algorithms for distributed mining of frequent itemsets ⋮ Privacy-preserving linear programming ⋮ Efficient Disjointness Tests for Private Datasets ⋮ Privacy-preserving horizontally partitioned linear programs ⋮ Privacy-preserving linear and nonlinear approximation via linear programming

This page was built for publication: Information and Communications Security