what-when-how
In Depth Tutorials and Information
algorithm is based upon a powerful server which may not be achieved in the envi-
ronment of sociotechnical networks. hus, some distributed methods such as the
extension of the algorithm mentioned above should be involved. To tackle this
problem, the users may directly generate the collaborative STNs to distribute the
process of the update and query issues. Because some identification issues must be
taken into account, this distributed system is very challenging.
10.6 Conclusions
In this chapter, we have presented some privacy models which are based on STNs and
can also be extended to the applications of sociotechnical networks. Furthermore,
we have analyzed the advantage and disadvantages of these privacy models. here
are still some unsolved problems in the privacy preservation. For example, it is diffi-
cult to deploy the anonymity protocols in highly dynamic environments, especially
when the nodes leave or add to the network frequently. Besides, it is more effective
to associate privacy preservation with trust models. In this way, the trustees (deter-
mined by the trust computation) of a node can work coordinately to defend exter-
nal and internal attacks. In future research, the privacy model should be improved
to adapt to the characteristics of STNs, especially considering the privacy between
the layers in multilevel STNs.
References
1. Bin Zhou and Jian Pei. Preserving privacy in social networks against neighborhood
attacks. Data Engineering, 2008.
IEEE24thInternationalConferenceonICDE2008
.
April 7-12, 2008, pp. 506-515.
2. Sweeney, L. K-anonymity: a model for protecting privacy,
International Journal on
Uncertainty,FuzzinessandKnowledge-BasedSystem
, vol. 10, no. 5, pp. 557-570, 2002.
3. Garey, M. R. and Johnson, D. S.
ComputersandIntractability:AGuidetotheheoryof
NP-Completeness
. New York: W. H. Freeman & Co., 1979.
4. Cormen, T. H. et al.
Introduction to Algorithms
, Second edition. MIT Press and
McGraw Hill, 2002.
5. Yan, X. and Han, J. gspan: Graph-based substructure pattern mining, in
Proc.ICDM'02
,
pp. 721, 2002, Maebashi city, Japan.
6. Xu, J. et al., Utility-based anonymization using local recoding, in
Proc.KDD'06
, pp.
785-790, 2006, Philadelphia, PA, USA.
7. Machanavajjhala, A. et al. L-diversity: Privacy beyond k-anonymity, in
ACMTransactions
onknowledgeDiscoveryfromData,
Vol I, Issue I, March 2007.
8. Cutillo, L. A., Molva, R., and Strufe, T. Privacy preserving social networking through
decentralization.
SixthInternationalConferenceonWirelessOn-DemandNetworkSystems
andServices
(
WONS)2009
. February 2-4, 2009, pp. 145-152.
9. Douceur, J. R. he Sybil attack, in
International Workshop on Peer-to-Peer Systems,
2002
, pp. 251-260.
