The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Chameleon authentication tree (CAT) is an important authenticated data structure for verifiable data streaming in 5G networks. But the typical CAT cannot support the dynamic scenario very well because it cannot expend freely since its height is fixed. Therefore, we proposed a dynamic CAT (DCAT) with the feature of adaptive expansion. We divided the algorithms of the DCAT with the following phases:...
Cloud storage has been gaining tremendous popularity, which provides facilitative data storage and sharing services for distributed clients. To maximize the availability and reliability, some customers may store multiple replicas of critical data on cloud servers. However, cloud servers may collude to make it look like they are storing multiple copies of data, whereas in fact they only store a single...
Some authenticated data structures (ADS) can reduce authentication cost with using signature aggregation method, such as authenticated skip list, merkle hash tree etc. But these ADS cannot solve the complicated authenticated problems, such as relational query authentication. Pang et al present signature chain scheme aims at various types of relational query but has high cost. Therefore an improved...
By analyzing metagenomic data from microbial communities, the taxonomical and functional component of hundreds of previously unknown microbial communities have been elucidated in the past few years. However, metagenomic data analyses are both data- and computation-intensive, which require extensive computational power. Most of the current metagenomic data analysis software were designed to be used...
Location based services (LBS) is one of the fastest growing areas in recent years. Location update of mobile clients is fundamental in all types of LBS. But algorithms proposed in this field generally didn't concern the restricted context of road network and caused some unnecessary update. This paper proposed a revised vector-based update algorithm which taking characteristics of road network into...
Privacy preserving in location-based service (LBS) has been an important issue in Vehicular Ad hoc Network (VANET). Traditional k-anonymity algorithm dealing with location privacy protecting problem does not consider vehicle's mobility and inner collaborator. In this paper, we propose a new algorithm which uses dynamic and mobile aware anonymous peer selecting algorithm to improve the anonymity and...
In this paper, we focus on challenges of supporting a decision support system (DSS) based on a hybrid approach (i.e. a federation system with data placement) for agile business intelligence applications. A DSS needs to be designed to handle a workload of potentially complex queries for important decision-making processes. The response time requirement (and a realistic goal) for such a DSS is near...
As multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet, the research of the multicast key management is becoming a hot issue. Firstly, we analyze the n-party GDH.2 multicast key management protocol and point out that it has the following flaws: lack of certification, vulnerability to man-in-the-middle attacks, and a single-point...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.