{"title":"Greedy Clustering with Sample-Based Heuristics for K-Anonymisation","authors":"G. Loukides, J. Shao","doi":"10.1109/ISDPE.2007.79","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.79","url":null,"abstract":"Developing techniques for k-anonymising data has received much recent attention from the database research community. Good k-anonymisations should retain data utility and preserve privacy, but these are conflicting requirements and can only be traded-off. A method proposed recently attempted to achieve a balance between these two requirements, but its efficiency and effectiveness depend heavily on several empirically set parameters. In this paper, we propose sampling-based heuristics to optimally set up these parameters. We test the effectiveness of our methods by evaluating anonymisations in terms of accuracy in query answering and ability to prevent linking attacks.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115706635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Trust: Transaction History Based Peer-to-Peer Trust Model","authors":"Shaojie Qiao, Xingshu Chen, Changjie Tang","doi":"10.1109/ISDPE.2007.131","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.131","url":null,"abstract":"In Pere-to-Peer network, trust and reputation mechanism can be used to build trust in peers for choosing the suitable peer to collaborate with. Aim at solving the problem that the traditional concentrated trust method can not be used in P2P networks, this paper proposed a new transaction history based global trust model, the model used an easy method to compute global reputation values according to historical transaction information and avoided the divergence of iteration for trust computation; proposed a new concept named global transaction table which was used to store the trust value; gave the formal definition of time decay factor and proved that it has the time decay feature. The simulation results show that the model has better performance than other trust models and can deal with some security problems, such as slander, exaggeration and impostor attack.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121093558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Network Security Evaluation System Based on Immune Principle","authors":"J. Yang, T. Li, S.J. Liu, G. Liang","doi":"10.1109/ISDPE.2007.20","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.20","url":null,"abstract":"One significant feature of the theory immunology is the ability to adapt to changing environments and dy- namically learning continuously. Inspired by the the- ory of artificial immune systems (AIS), a novel model of Agents of Network Danger Evaluation is presented. The concepts and formal definitions of immune cells are given, and dynamically evaluative equations for self, antigen, immune tolerance, mature-lymphocyte lifecycle and immune memory are presented, and the hierarchical and distributed management framework of the proposed model are built. Furthermore, the idea of dynamic immunological surveillance period is ap- plied for enhancing the self-learning ability to adapt continuously variety environments. The experimental results show that the proposed model has the features of real-time processing that provide a good solution for network surveillance.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Genetic Algorithms Designed for Solving Support Vector Classifier","authors":"Ma Shu","doi":"10.1109/isdpe.2007.134","DOIUrl":"https://doi.org/10.1109/isdpe.2007.134","url":null,"abstract":"The support vector machine (SVM) is a newly developed approach in data mining. Using SVM, the classification and the regression problems can be converted into optimization problems with linear constraints. In this paper, a genetic algorithm employing mixed coding scheme, dual evolutionary iteration and some specially designed operators is proposed to perform comprehensive optimization for SVM and to process the constraints at the same time. The experiments upon several benchmark datasets prompts that the proposed algorithm performs better comparing to some other classification methods.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Quick Algorithmfor Reduction of Attribute in Information Systems","authors":"Yuejin Lv, Jinhai Li","doi":"10.1109/ISDPE.2007.24","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.24","url":null,"abstract":"Reduction of attribute is one of the key problems in rough set theory. In this paper, Using recursive idea, we design a new approach to calculate partition U/C, whose time complexity is O(C U). Then two new and relatively reasonable formulas measuring attribute significance are designed for reducing searching space, which are used as heuristic information to develop a quick attribute reduction algorithm; the theoretical analysis shows that this algorithm is much less time complexity than those existed algorithms. Finally, experimental results demonstrate its feasibility and effectiveness, respectively.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114637022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. Liao, Shengfeng Tian, Houkuan Huang, Tinghua Wang
{"title":"A Network Intrusion Detection System Based Soft Computing","authors":"N. Liao, Shengfeng Tian, Houkuan Huang, Tinghua Wang","doi":"10.1109/ISDPE.2007.8","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.8","url":null,"abstract":"Intrusion detection is important in network security. Soft computing is a consortium of methodologies, which deal with various kinds of inaccuracies and uncertainties contained in real-world problems. In this paper, we present the system based on soft computing. We discuss the advantages of the system and also report our experimental results over the KDD99 dataset. The results show that the proposed approach can improve the detection performance of the NIDSs, Experiment results clearly show that soft computing approach could play a major role for intrusion detection.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121491956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SEDBRS: A Secure and Efficient Desktop Backup and Recovery System","authors":"Dejun Wang, Lina Wang, J. Song","doi":"10.1109/ISDPE.2007.117","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.117","url":null,"abstract":"Desktop system plays a significant role in today's computing environment. The major challenge in enterprise desktop backup system is to keep efficient and maintain privacy. In this paper, we propose global compression and fast recovery algorithm, which can identify redundancy in datasets and enhances the system's performance by reducing the number of data really transferred and stored in the backup and recovery process. Also we suggest a novel encryption algorithm which uses hash of the data block as encryption key and produces the same cipher-text for the same plain-text. These two algorithms cooperate well and achieve both privacy and efficiency. Based on this idea, we implement a Secure and efficient backup and recovery system called \"H-info desktop backup system\", Results show that this system can achieve good performance and scalability, and meet the need of enterprise desktop system backup.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Document Analysis Method Using Compressibility Vector","authors":"Nuo Zhang, T. Watanabe, D. Matsuzaki, H. Koga","doi":"10.1109/ISDPE.2007.18","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.18","url":null,"abstract":"Similarity analysis and keyword extraction are widely used as document relation analysis techniques. These methods are based on dictionary-base morphological analysis. However, they cannot meet the need when Internet grows fast and new words appear but dictionary can not be renewed fast enough. In this study, we propose a new document relation analysis method based on the document's compressibility. The effectiveness of the proposed method will be examined in simulations.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115729824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel anti-spam scheme for image-based email","authors":"Jianshe Dong, Zhanting Yuan, Qiuyu Zhang, Yufeng Zheng","doi":"10.1109/ISDPE.2007.78","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.78","url":null,"abstract":"Spam has become a serious problem not only to the Internet but also to society. In past years, researchers studied the problem mainly on textual features. As the content of spam removing from text-only to multimedia-enriched, the existing text-based spam filters are no longer effective for these emails. This paper proposes a novel filter approach that focuses on the spam which contains images. The approach based on detection and counting the similar image-based emails. A special challenge-response mechanism also is introduced in this paper in order to avoid legitimate being chucked. By this mechanism, users no longer need cost time to check the spam folder.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124366656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Security Analysis of DVB Common Scrambling Algorithm","authors":"Wei Li","doi":"10.1109/ISDPE.2007.116","DOIUrl":"https://doi.org/10.1109/ISDPE.2007.116","url":null,"abstract":"The Common Scrambling Algorithm (CSA) is used to encrypt streams of video data in the Digital Video Broadcasting (DVB) system. To date, CSA is secure against classical attacks, but vulnerable to side channel attacks. This paper presents a differential power analysis , one of side channel attacks, on DVB CSA. By decrypting the block cipher part, the common key of the whole algorithm can be derived. It provides a general method for other ciphers against side channel attacks.","PeriodicalId":267563,"journal":{"name":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}