Privacy-Preserving Data Mining: A Game-Theoretic Approach - Data and Applications Security and Privacy XXV Access content directly
Conference Papers Year : 2011

Privacy-Preserving Data Mining: A Game-Theoretic Approach


Privacy-preserving data mining has been an active research area in recent years due to privacy concerns in many distributed data mining settings. Protocols for privacy-preserving data mining have considered semi-honest, malicious, and covert adversarial models in cryptographic settings, whereby an adversary is assumed to follow, arbitrarily deviate from the protocol, or behaving somewhere in between these two, respectively. Semi-honest model provides weak security requiring small amount of computation, on the other hand, malicious and covert models provide strong security requiring expensive computations like homomorphic encryptions. However, game theory allows us to design protocols where parties are neither honest nor malicious but are instead viewed as rational and are assumed (only) to act in their own self-interest. In this paper, we build efficient and secure set-intersection protocol in game-theoretic setting using cryptographic primitives. Our construction avoids the use of expensive tools like homomorphic encryption and oblivious transfer. We also show that our protocol satisfies computational versions of strict Nash equilibrium and stability with respect to trembles.
Fichier principal
Vignette du fichier
978-3-642-22348-8_15_Chapter.pdf (181.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01586580 , version 1 (13-09-2017)





Atsuko Miyaji, Mohammad Shahriar Rahman. Privacy-Preserving Data Mining: A Game-Theoretic Approach. 23th Data and Applications Security (DBSec), Jul 2011, Richmond, VA, United States. pp.186-200, ⟨10.1007/978-3-642-22348-8_15⟩. ⟨hal-01586580⟩
422 View
93 Download



Gmail Facebook X LinkedIn More