Papers by Tran Hai Dang B1706980
Future data and security engineering : first international conference, FDSE 2014, Ho Chi Minh City, Vietnam, November 19-21, 2014, proceedings
On Context- and Sequence-Aware Document Enrichment and Retrieval towards Personalized Recommendat... more On Context- and Sequence-Aware Document Enrichment and Retrieval towards Personalized Recommendations.- Forests of Oblique Decision Stumps for Classifying Very Large Number of Tweets.- Performance Evaluation of a Natural Language Processing Approach Applied in White Collar Crime Investigation.- An Efficient Similarity Search in Large Data Collections with MapReduce.- Memory-Based Multi-pattern Signature Scanning for ClamAV Antivirus.- Constructing Private Indexes on Encrypted Data for Outsourced Databases.- An Extensible Framework for Web Application Vulnerabilities Visualization and Analysis.- A Combination of Negative Selection Algorithm and Artificial Immune Network for Virus Detection.- De-anonymising Set-Generalised Transactions Based on Semantic Relationships.- An Implementation of a Unified Security, Trust and Privacy (STP) Framework for Future Integrated RFID System.- Toward a Nexus Model Supporting the Establishment of Business Process Crowdsourcing.- Link Prediction in Social Networks Based on Local Weighted Paths.- An Architecture Utilizing the Crowd for Building an Anti-virus Knowledge Base.- Two-Way Biometrics-Based Authentication Scheme on Mobile Devices.- Prospective Cryptography in NFC with the Lightweight Block Encryption Algorithm LEA.- Enhance Fuzzy Vault Security Using Nonrandom Chaff Point Generator.- Smart Card Based User Authentication Scheme with Anonymity.- Cloud-Based ERP Solution for Modern Education in Vietnam.- Heuristics for Energy-Aware VM Allocation in HPC Clouds.- Information-Flow Analysis of Hibernate Query Language.- Investigation of Regularization Theory for Four-Class Classification in Brain-Computer Interface.- Enhancing Genetic Algorithm with Cumulative Probabilities to Derive Critical Test Scenarios from Use-Cases.- Towards a Semantic Linked Data Retrieval Model.
Polibits, 2012
The tremendous development of location-based services and mobile devices has led to an increase i... more The tremendous development of location-based services and mobile devices has led to an increase in location databases. Through the data mining process, valuable information can be discovered from such location databases. However, the malicious data miner or attackers may also extract private and sensitive information about the user, and this can create threats against the user location privacy. Therefore, location privacy protection becomes a key factor to the success in privacy protection for the users of location-based services. In this paper, we propose a novel approach as well as an algorithm to guarantee k-anonymity in a location database. The algorithm will maintain the association rules that have significance for the data mining process. Moreover, there may appear new significant association rules created after anonymization, they maybe affect the data mining result. Therefore, the algorithm also considers excluding new significant association rules that are created during the run of the algorithm. Theoretical analyses and experimental results with real-world datasets will confirm the practical value of our newly proposed approach.
Lecture Notes in Computer Science, 2003
Things have been changing increasingly since the first DEXA events due to the new challenges pose... more Things have been changing increasingly since the first DEXA events due to the new challenges posed by new issues ubiquitously appearing in modern application domains nowadays. In this paper, a quick review of contributions to the DEXA international conferences will be given. The different research trends and challenges that have been posed are succinctly analysed. Some predictions about the future trend of the DEXA events are also presented.
A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System
Lecture Notes in Computer Science, 2002
X. Meng, J. Su, and Y. Wang (Eds.): WAIM 2002, LNCS 2419, pp. 367-378, 2002. © Springer-Verlag Be... more X. Meng, J. Su, and Y. Wang (Eds.): WAIM 2002, LNCS 2419, pp. 367-378, 2002. © Springer-Verlag Berlin Heidelberg 2002 ... A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System ... Tran Khanh Dang, Josef Küng, and ...
An Extensible Framework for Web Application Vulnerabilities Visualization and Analysis
Lecture Notes in Computer Science, 2014
The popularity of web-based applications makes them interesting targets of cyber attacks. To deal... more The popularity of web-based applications makes them interesting targets of cyber attacks. To deal with that threat, discovering existing vulnerabilities is a proactive step. Although there are many web application scanners designed for this task, they lack visual analysis capability and do not collaborate well together. In this paper, we propose a novel visualization technique and a flexible framework to solve the two problems mentioned above. We also develop a prototype based on the proposal and use it to experiment with virtual websites. Experiment results indicate the unique benefits our work offers. But more importantly, it shows that not only improving the visualization technique from a technical viewpoint is needed, but also improving it from a human cognitive viewpoint should be placed at a higher priority.
BMC medical genetics, Jan 17, 2014
Dengue shock syndrome (DSS), a severe life-threatening form of dengue infection, mostly occurs in... more Dengue shock syndrome (DSS), a severe life-threatening form of dengue infection, mostly occurs in children. A recent genome wide association study (GWAS) identified two SNPs, rs3132468 of major histocompatibility complex class I polypeptide-related sequence B (MICB) and rs3765524 of phospholipase C, epsilon 1 (PLCE1), associated with DSS in Vietnamese children. In this study, to examine whether an identical association is found in a different population, the association of these two SNPs with DSS was assessed in Thai children with dengue. The rs3132468 and rs3765524 SNPs were genotyped in 917 Thai children with dengue: 76 patients with DSS and 841 patients with non-DSS. The allele frequencies were compared between DSS and non-DSS groups by one-sided Fisher's exact test. The association of rs3132468 and rs3765524 with the mRNA expression levels of MICB and PLCE1 were assessed in EBV-transformed lymphoblastoid cell lines. The reported DSS-risk alleles were significantly associated...
2011 4th IFIP International Conference on New Technologies, Mobility and Security, 2011
The k-anonymity is an efficient model to preserve data privacy. Of late, this model has been appl... more The k-anonymity is an efficient model to preserve data privacy. Of late, this model has been applied to the area of privacy-preserving data mining but the state-of-the-arts are still far from practical needs. In this paper, we propose a new approach that preserves privacy and maintains data utility in data mining. Concretely, we use a k-anonymity model to preserve privacy while discovering and maintaining association rules through a novel algorithm, M3AR-member migration technique for maintaining association rules. We do not use the existing generalization and suppression techniques to achieve a kanonymity model. Instead, we propose a member migration technique that is more appropriate for the requirements of maintaining association rules. Experimental results establish the practical value and theoretical analyses of our new technique.
Lecture Notes in Computer Science, 2010
Privacy preservation (PP) has become an important issue in the information age to prevent exposit... more Privacy preservation (PP) has become an important issue in the information age to prevent expositions and abuses of personal information. This has attracted much research and k-anonymity is a well-known and promising model invented for PP. Based on the k-anonymity model, this paper introduces a novel and efficient member migration algorithm, called eM 2 , to ensure kanonymity and avoid information loss as much as possible, which is the crucial weakness of the model. In eM 2 , we do not use the existing generalization and suppression technique. Instead we propose a member migration technique that inherits advantages and avoids disadvantages of existing k-anonymity-based techniques. Experimental results with real-world datasets show that eM 2 is superior to other k-anonymity algorithms by an order of magnitude.
Lecture Notes in Computer Science, 2012
The next generation of location-based services has been being predicted to achieve its superior d... more The next generation of location-based services has been being predicted to achieve its superior development over the coming years. Keeping pace with this growth are new trends of predictive applications emerging to meet the demands of end-users and satisfy their matters of life. The violation of users' private information from their position disclosure, however, cuts off their beliefs when they enjoy such services. In this paper, therefore, we propose a novel index structure known as PP ST-tree, which is able to deal with predictive and aggregate queries and is aware of trajectory privacy protection towards future positions of moving objects. Moreover, the prediction model and related strategies are also introduced in order to support location-based applications whereas user privacy is still preserved. Last but not least, privacy analyses and performance experiments show how well the proposed method can help.
An Elastic Approximate Similarity Search in Very Large Datasets with MapReduce
Lecture Notes in Computer Science, 2014
The outbreak of data brings an era of big data and more challenges than ever before to traditiona... more The outbreak of data brings an era of big data and more challenges than ever before to traditional similarity search which has been spread to a wide range of applications. Furthermore, an unprecedented scale of data being processed may be infeasible or may lead to the paralysis of systems due to the slow performance and high overheads. Dealing with such an unstoppable data growth paves the way not only to similarity search consolidates but also to new trends of data-intensive applications. Aiming at scalability, we propose an elastic approximate similarity search that efficiently works in very large datasets. Moreover, our proposed scheme effectively adapts itself to the well-known similarity searches with pairwise documents, pivot document, range query, and k-nearest neighbour query. Last but not least, these methods, together with our filtering strategies, are implemented and verified by experiments on real large data collections in Hadoop showing their promising effectiveness and efficiency.
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia - MoMM '09, 2009
Along with the rapid development of mobile devices having embedded positioning technology, locati... more Along with the rapid development of mobile devices having embedded positioning technology, location-based services have become more and more popular. In order to use the services, users often disclose some parts of their private information, especially their location-related information. Thus, it raises a great concern in the users' privacy preserving in location-based services. This paper proposes a solution with a memorizing algorithm working on a trusted middleware. With the proposed solution, the space is organized in a flexible grid and the middleware cloaks the user's location information in an anonymization area before sending it to the service providers. A concerned problem is that overlapped areas among anonymization areas can be used to explore the true position of a user because the overlapped areas have a higher probability of having a user. Our newly introduced memorizing algorithm calculates on the spatial grid to decrease the overlapped areas as much as possible. The solution aims at protecting the user's privacy not only at the time using the service but also against data mining techniques wrt. their history location data. Experimental results with synthesis moving objects over real world maps will establish our theoretical analyses as well as the practical value of the proposed solution.
Modeling, Simulation and Optimization of Complex Processes, 2008
Outsourcing database services is emerging as an important new trend thanks to continued developme... more Outsourcing database services is emerging as an important new trend thanks to continued developments of the Internet and advances in the networking technology. In this outsourced database service (ODBS) model, organizations rely upon the premises of an external service provider for the storage and retrieval management of their data. Since a service provider is typically not fully trusted, this model introduces numerous interesting research challenges. Among them, most crucial security research questions relate to (1) data confidentiality, (2) user privacy, (3) data privacy, and (4) query assurance. Although there exist a number of research work on these topics, to the best of our knowledge, none of them has dealt with ensuring query assurance for outsourced tree-indexed data. To address this issue, the system must prove authenticity and data integrity, completeness and, not less importantly, provide freshness guarantees for the result set. These objectives imply that (1) data in the result set is originated from the actual data owner and has not been tampered with; (2) the server did not omit any tuples matching the query conditions; and (3) the result set was generated with respect to the most recent snapshot of the database. This is not a trivial task, especially as tree-based index structures are outsourced to untrusted servers. In this paper, we discuss and propose solutions to security issues in order to provide query assurance for outsourced databases that come together with tree-based index structures. Our techniques allow clients to operate on their outsourced tree-indexed data on untrusted servers with high query assurance and at reasonable costs. Experimental results with real datasets confirm the efficiency of our approach and theoretical analyzes.
Hybrid Stop Discovery in Trajectory Records
2013 24th International Workshop on Database and Expert Systems Applications, 2013
ABSTRACT The advance of GPS tracking technique brings a large amount of trajectory data. These da... more ABSTRACT The advance of GPS tracking technique brings a large amount of trajectory data. These data can be used in many application domains such as traffic management, urban planning, tourism, and bird migration. Recently, a semantic model which expresses trajectory as a sequence of stops and moves was introduced and become a hot topic for trajectory data analysis. Stops are important parts of trajectories, such as "working at office", "shopping in a mall", "waiting for the bus". Although several works have been developed to discover stops, they considered the characteristics of the stops separately. Because of this limitation, these approaches only focus on certain well-defined trajectories. They cannot work well for heterogeneous cases like diverse and sparse trajectories. Towards stop discovery in trajectories, in this paper, we propose a comprehensive hybrid feature-based method to discover stops. We also evaluate our approach with real-life GPS datasets, and show that this newly proposed approach can provide a good abstraction on the trajectory, with efficient computation.
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication - ICUIMC '12, 2012
The world of location-based services (LBS) has been becoming more diversifying and amazing with i... more The world of location-based services (LBS) has been becoming more diversifying and amazing with its rapid growth in recent years. Moreover, the development has spread to many aspects in all walks of life and got powerful promotion from advanced information and communication technologies. Its pervasive moves, however, leave great concerns behind, which can cause roadblocks in the path of its prosperity. Three of them, identified as heterogeneity, user privacy, and context-awareness, have called for much attention and investigation in both research and industry community worldwide. In response to the call, we propose an elastic and open design platform named OpenLS Privacy-aware Middleware (OPM) for location-based applications as a unified solution to these issues.
Utilizing Spatio-temporal Data Index for Location Privacy Protection
2013 24th International Workshop on Database and Expert Systems Applications, 2013
ABSTRACT Situation management systems are developing quickly nowadays. Among their vast applicati... more ABSTRACT Situation management systems are developing quickly nowadays. Among their vast applications, disaster management, homeland security and traffic management are of the most important ones. In domains above, the locations of people inside the observed areas are great sources of information. While we can put the accuracy of the location information first in emergency domains, such as disaster management, we need to care about users' locations privacy in civil domains, such as traffic management. Thus, privacy-preserving techniques have gained special attention from researchers, such as obfuscation-based or k-anonymity. While existing solutions have integrated obfuscation-based into the indexed Spatio-temporal data to gain performance boost, the lack of reciprocity in these solutions grants the attackers ability to infer the exact users location by using some tricks, e.g. Query Sampling Attacks. Meanwhile, an important property of Hilbert Cloaking algorithm is reciprocity. This property ensures that any user in the k-Anonymizing Spatial Region has the same blurred region, thus the disadvantage of the above solutions is overcome. In this paper, we propose a new solution that combines Hilbert Cloaking algorithm and obfuscation-based technique to increase the privacy protection. Our solution is also integrated into Spatio-temporal data index structure so that it can be used for commercial Database Management Systems.
Lecture Notes in Computer Science, 2013
In this paper, we introduce a novel electronic voting protocol which is resistant to more powerfu... more In this paper, we introduce a novel electronic voting protocol which is resistant to more powerful corrupted parties and coercers than any previous works. They can be the voting authorities inside the system who can steal voters' information and the content of their votes, or the adversaries outside who try to buy the votes, and force voters to follow their wishes. The worst case is that the adversaries outside collude with all voting authorities inside to destroy the whole system. In previous works, authors suggested many complicated cryptographic techniques for fulfilling all security requirements of electronic voting protocol. However, they cannot avoid the sophisticated inside and outside collusion. Our proposal prevents these threats from happening by the combination of blind signature, dynamic ballots and other techniques. Moreover, the improvement of blind signature scheme together with the elimination of physical assumptions makes the newly proposed protocol faster and more efficient. These enhancements make some progress towards practical security solution for electronic voting system.
Enhanced security in internet voting protocol using blind signatures and dynamic ballots
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services - IIWAS '12, 2012
ABSTRACT In this paper, we introduce a novel internet voting protocol which satisfies all desired... more ABSTRACT In this paper, we introduce a novel internet voting protocol which satisfies all desired security requirements of electronic voting system. The main contribution of the newly proposed protocol is the ability to debate more powerful adversaries than any previous works. In particularly, they can force voters to follow their wish, collude with one or more voting authorities to get the contents of votes or to destroy the voting system. To against these kinds of adversaries, blind signature and dynamic ballots techniques are employed instead of complex cryptographic one such as homomorphic encryption and mix-net. Moreover, we also aim at a practical system by improving the blind signature scheme and removing physical assumptions. Finally, with blind signature and dynamic ballots, we will present an enhancement of protocol which is unsusceptible to most of sophisticated attacks.
International Journal of Mobile Computing and Multimedia Communications, 2010
The rapid development of location-based services, which make use of the location information of t... more The rapid development of location-based services, which make use of the location information of the user, presents both opportunities and challenges. Users can benefit from these services; however, they must often disclose their location information, which may lead to privacy problems. In this regard, the authors propose a solution with a memorizing algorithm, using trusted middleware that organizes space in an adaptive grid where it cloaks the user’s location information in an anonymization area before sending it to the service providers. This newly introduced memorizing algorithm calculates on the spatial grid to decrease the overlapped areas as much as possible, which helps conceal users’ locations. This solution protects the user’s privacy while using the service, but also against data mining techniques with respect to their history location data. Experimental results with a user activities map establishes this theoretical analyses as well as the practical value of the proposed ...
Lecture Notes in Computer Science, 2011
The development of location-based services and mobile devices has lead to an increase in the loca... more The development of location-based services and mobile devices has lead to an increase in the location data. Through the data mining process, some valuable information can be discovered from location data. However, the attackers may also extract some private (sensitive) information of the user and this can make threats against the user location privacy. Therefore, location privacy protection becomes a key factor to the success in privacy preserving in location-based services. In this paper, we propose a new approach as well as an algorithm to guarantee k-anonymity in a location database. The algorithm will maintain the association rules which have significance for the data mining process. Moreover, the algorithm also considers excluding new significant association rules created during the run of the algorithm.
International Journal of Web Information Systems, 2013
Purpose-By reviewing different information visualization techniques for securing web information ... more Purpose-By reviewing different information visualization techniques for securing web information systems, this paper aims to provide a foundation for further studies of the same topic. Another purpose of the paper is to discover directions in which there is a lack of extensive research, thereby encouraging more investigations. Design/methodology/approach-The related techniques are classified first by their locations in the web information systems architecture: client side, server side, and application side. Then the techniques in each category are further classified based on attributes specific to that category. Findings-Although there is much research on information visualization for securing web browser user interface and server side systems, there are very few studies about the same techniques on web application side. Originality/value-This paper is the first published paper reviewing extensively information visualization techniques for securing web information systems. The classification used here offers a framework for further studies as well as in-depth investigations.
Uploads
Papers by Tran Hai Dang B1706980