Privacy-Preserving Data Mining

Privacy-Preserving Data Mining

EnglishPaperback / softbackPrint on demand
Samet, Saeed
VDM Verlag Dr. Müller
EAN: 9783639358605
Print on demand
Delivery on Friday, 10. of July 2026
€69.46
Common price €77.18
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

Security and privacy represent crucial requirements in different scenarios as organizations and parties involved may not want to disclose their own private information to each other. Assuring adequate and verifiable security and privacy in these scenarios faces various challenges. One such challenge is whether proposed protocols can be used over public channels, like internet. Another possible issue is whether the complete final result of a protocol can be broadcasted to, or be received by all parties. Collusion attacks can pose another security challenge in multiparty settings. Finally, it may be desirable to design incremental versions of the protocols to improve security and efficiency. To address these problems we have designed new secure building blocks and privacy-preserving protocols, while considering their performance in terms of security and efficiency. Building blocks, and the resulting protocols which take advantage of these blocks can be implemented over public channels, have a balanced distribution of the final results, and are resistant to collusion attacks. These blocks are used to design novel privacy-preserving protocols for learning and data mining techniques.
EAN 9783639358605
ISBN 3639358600
Binding Paperback / softback
Publisher VDM Verlag Dr. Müller
Publication date June 5, 2011
Pages 164
Language English
Dimensions 229 x 152 x 10
Country Germany
Readership General
Authors Miri, Ali; Samet, Saeed
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.