Sciweavers

106 search results - page 17 / 22
» Optimistic Fair Secure Computation
Sort
View
SAC
2010
ACM
13 years 8 months ago
Cooperation enablement for centralistic early warning systems
From large-scale acquisition of information on security incidents by early warning systems (EWS) arises the opportunity to draw up a situation picture that allows detection of tre...
Ulrich Flegel, Johannes Hoffmann, Michael Meier
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
14 years 10 months ago
Using randomized response techniques for privacy-preserving data mining
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...
Wenliang Du, Zhijun Zhan
INDOCRYPT
2003
Springer
14 years 3 months ago
Practical Mental Poker Without a TTP Based on Homomorphic Encryption
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
ACSAC
2009
IEEE
14 years 2 months ago
A Guided Tour Puzzle for Denial of Service Prevention
Abstract—Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a l...
Mehmud Abliz, Taieb Znati
TDSC
2011
13 years 4 months ago
A Policy Enforcing Mechanism for Trusted Ad Hoc Networks
To ensure fair and secure communication in Mobile Ad hoc Networks (MANETs), the applications running in these networks must be regulated by proper communication policies. However,...
Gang Xu, Cristian Borcea, Liviu Iftode