Proxy Server Research Articles

A Secured Proxy-Based Data Sharing Module in IoT Environments Using Blockchain.

Access and utilization of data are central to the cloud computing paradigm. With the advent of the Internet of Things (IoT), the tendency of data sharing on the cloud has seen enormous growth. With data sharing comes numerous security and privacy issues. In the process of ensuring data confidentiality and fine-grained access control to data in the cloud, several studies have proposed Attribute-Based Encryption (ABE) schemes, with Key Policy-ABE (KP-ABE) being the prominent one. Recent works have however suggested that the confidentiality of data is violated through collusion attacks between a revoked user and the cloud server. We present a secured and efficient Proxy Re-Encryption (PRE) scheme that incorporates an Inner-Product Encryption (IPE) scheme in which decryption of data is possible if the inner product of the private key, associated with a set of attributes specified by the data owner, and the associated ciphertext is equal to zero . We utilize a blockchain network whose processing node acts as the proxy server and performs re-encryption on the data. In ensuring data confidentiality and preventing collusion attacks, the data are divided into two, with one part stored on the blockchain network and the other part stored on the cloud. Our approach also achieves fine-grained access control.

Design and implementation of an SDN-enabled DNS security framework

The Domain Name System (DNS) is suffering from the vulnerabilities exploited to launch the cache poisoning attack. Inspired by biodiversity, we design and implement a non-intrusive and tolerant secure architecture Multi-DNS (MDNS) to deal with it. MDNS consists of Scheduling Proxy and DNS server pool with heterogeneous DNSs in it. And the Scheduling Proxy dynamically schedules m DNSs to provide service in parallel and adopts the vote results from majority of DNSs to decide valid replies. And benefit from the centralized control of software defined networking (SDN), we implement a proof of concept for it. Evaluation results prove the validity and availability of MDNS and its intrusion/fault tolerance, while the average delay can be controlled in 0.3s.

Enhancing Greedy Web Proxy caching using Weighted Random Indexing based Data Mining Classifier

Web Proxy caching system is an intermediary between the Web users and servers that try to alleviate the loads on the origin servers by caching particular Web objects and behaves as the proxy for the server and services the requests that are made to the servers. In this paper, the performance of a Proxy system is measured by the number of hits at the Proxy. Higher number of hits at the Proxy server reflects the effectiveness of the Proxy system. The number of hits is determined by the replacement policies chosen by the Proxy systems. Traditional replacement policies that are based on time and size are reactive and do not consider the events that will possibly happen in the future. The performance of the web proxy caching system is improved by adapting Data Mining Classifier model based on Web User clustering and Weighted Random Indexing Methods. The outcome of the paper are proactive strategies that augment the traditional replacement policies such as GDS, GDSF, GD∗ which uses the Data Mining techniques.

A delegation token-based method to authenticate the third party in TLS

Transport layer security is an important security protocol, which is used to protect end-to-end communication. However, limitation occurs when it is applied to content delivery networks, in which the proxy server rather than the origin server provides service to the client. Under such circumstances, the proxy server serves as a third party and the client is not able to authenticate. This paper discusses the authentication problem for the proxy server. Afterwards, a delegation token-based method is proposed to authenticate the proxy server, with multi-level proxy servers being taken into consideration. Furthermore, a client-based cache strategy is employed to improve the proposed method in terms of time consumption. Then the security of the method is also analysed. Experimental results demonstrate the effectiveness of our method. Moreover, with client-based cache strategy, the authentication process can be accomplished much more efficiently, with a 15.63% decrease in terms of connection time.

Practical Evaluation of Multi-Source Coded Downloads

In this paper, we introduce two multi-source download protocols for loosely orchestrated networks that have high potential in Information-Centric Networking (ICN). We focus on services with high bandwidth and low delay requirements, such as video streaming. We propose MUlti-source Transmission Protocol (MUTP) for uncoded multi-source data delivery and extend it with network coding capabilities to create Coded MUTP. We investigate their throughput using a custom-designed system that includes browser extensions and proxy servers. The browser extensions intercept YouTube video downloads and forward them through our proxy server, using parallel HTTP requests, Uncoded MUTP or Coded MUTP approach. We present measurement results collected in 2018-2019, over eleven months that include 1,300,000 log records from more than 960 GBs of video download. We show that even when downloading from only two sources, our protocols can match the heavily optimized HTTP. Furthermore, by increasing the number of sources to four or higher, MUTP protocols can outperform HTTP, reaching an up to three-fold goodput (useful throughput) increase. In addition, we show that the proposed solution avoids the straggler problem, therefore adding more sources to a network increases its goodput.

PCR: caching replacement algorithm in proxy server

The efficiency of caching is a key factor affecting the performance of content delivery network (CDN). The main aim of current CDN caching is to obtain a higher hit ratio, since the validation and freshness of outdated pages have not received due consideration in their replacement model. In this paper, a new improved cache profit model is clearly defined, and the freshness factors of web pages have been taken into adequate account. Based on the profit model, a new replacement algorithm – proxy cache replacement (PCR) – is recommended, and it can be proved optimal under the rational hypothesis. To conclude, a series of comparative experiments verified the efficiency of PCR in web caching replacement.

Toward Supporting Unplanned Dynamic Changes of Service-Based Business Processes

Service-oriented architecture (SOA) has become an application development paradigm widely recognized both in academia and in industry. Although SOA-based applications may vertically implement business processes through the composition of loosely coupled services, they have to face frequent changes, such as unavailability of service (due to the uncontrollable, dynamic, and distributed environments) or dynamic replacement of service (due to specific user requirements). This indicates that the service compositions are expected to be adaptable enough to cater to such changing situations. In this paper, we propose an approach to supporting unplanned dynamic changes of service compositions by combining variability management and dynamic binding. The proposed approach introduces the concept of abstract proxy services in a variability-supporting service composition language, namely VxBPEL, and provides a mechanism to support variation design and dynamic binding for unplanned changes at run time. To realize the proposed approach, we have developed a service composition engine that supports abstract proxy services and their run-time replacement via service discovery or user intervention. Finally, a case study has been conducted to demonstrate the feasibility of the proposed approach and quantify the performance overhead resulting from runtime variability management and dynamic binding. The experimental results show that the proposed approach overcomes the limitation of imperative variability-based approaches in handling unplanned dynamic changes and further enhances the dynamic adaptability of VxBPEL-based service compositions.

Flow Context and Host Behavior Based Shadowsocks’s Traffic Identification

Cloud Virtual Private Server (VPS) services provide the chance of rapid deployment of anonymous proxy services, becoming an important part of many anonymous proxy solutions. The anonymous system represented by ShadowSocks (SS), through proxy services deployed on VPSs provided by different cloud service providers, has become an important mean for illegal network activists to engage in illegal network activities such as cyber-attacks and darknet transactions. It is difficult for local network administrators to supervise SS traffic from the cloud. While from the local network, the task faces the challenges of Invisible Negotiation Process and Data Transparent Transmission. In this paper, we present a novel SS detection method based on flow context and host behavior. The method can not only accurately identify SS flows, but also be applicable to a large-scale network environment. In this method, we extract 12-dimensional features from three aspects: the relationship between flows, hosts' flow behavior, and hosts' DNS behavior to build the detection model. Among them, the four features about flow burst and the feature of unassociated domain names' number are innovatively proposed in this paper. Moreover, the big data statistical and association techniques are used in the method. To verify the effectiveness of the method, we first built a real SS running environment based on the campus network and two VPSs on two different public cloud platforms. Moreover, we conduct a series of experiments on the NTCI-BDP data platform which is a big data platform built by our team. The experimental results show that our method achieves 93.43% accuracy on experimental data sets and can effectively identify SS traffic.

Verifiable and Multi-Keyword Searchable Attribute-Based Encryption Scheme for Cloud Storage

In attribute-based searchable encryption (ABSE) scheme, data owners can encrypt their data with access policy for security consideration, and encrypt keywords to obtain keyword index for privacy keyword search, and data users can search interesting keyword on keyword indexes by keyword search trapdoor. However, many existing searchable encryption schemes only support single keyword search and most of the existing attribute-based encryption (ABE) schemes have high computational costs at user client. These problems significantly limit the application of attribute-based searchable encryption schemes in practice. In this paper, we propose a verifiable and multi-keyword searchable attribute-based encryption (VMKS-ABE) scheme for cloud storage, in our new scheme, multi-keyword can be searched and the search privacy is protected. That is, the cloud server can search the multi-keyword with keyword search trapdoor but it does not know any information about the keywords searched. In the proposed scheme, many computing tasks are outsourced to the cloud proxy server, which greatly reduces the computing burden at the user client. Besides, the scheme also supports the verification of the correctness of the outsourced private key. The proposed scheme is proved secure that the keyword index is indistinguishable under the adaptive keyword attacks in the general group model, and the ciphertext is selective secure under selective plaintext attacks in the random oracle model. The security and experimental results show that our scheme is suitable for practicability.

A Power and Latency Aware Cloudlet Selection Strategy for Multi-Cloudlet Environment

Fast interactive response in mobile cloud computing is an emerging area of interest. Execution of applications inside the remote cloud increases the delay and affects the service quality. To avoid this difficulty cloudlet is introduced. Cloudlet provides the same service to the device as cloud at low latency but at high bandwidth. But selection of a cloudlet for offloading computation at low power is a major challenge if more than one cloudlet is available nearby. In this paper we have proposed a power and latency aware optimum cloudlet selection strategy for multi-cloudlet environment with the introduction of a proxy server. Theoretical analysis show that using the proposed approach the power and the latency consumption are reduced by approximately 29-32 and 33-36 percent respectively than offloading to the remote cloud. An experimental analysis of the proposed cloudlet selection scheme is performed using cloudlets and cloud servers located at our university laboratory. Theoretical and experimental results demonstrate that using the proposed strategy power and latency aware cloudlet selection can be performed. The proposed approach is compared with the existing methods on multi-cloudlet scenario to demonstrate that the proposed approach reduces the power consumption and the system response time.

Efficient revocable CP-ABE for big data access control in cloud computing

Due to huge volume of big data, cloud is a better choice to store big data. Since the cloud is not trustworthy, privacy and access control is a big concern. Ciphertext policy attribute-based encryption (CP-ABE) is a promising technique to enable both privacy and access control in the cloud. However, directly applying CP-ABE scheme for big data in the cloud is a challenging task because of revocation. Existing CP-ABE with revocation schemes are lacking in efficiency. In this paper, we propose an efficient revocable CP-ABE (R-CP-ABE) scheme for big data access control in cloud using proxy-based updates in which the proxy server performs the ciphertext and secret key updates instead of data owner and data user respectively during revocation. This outsourced updates during revocation reduces the communication and computation overhead of data owner and data users. In security analysis, we prove that our R-CP-ABE scheme is secure against chosen plain-text and user collusion attacks. In addition, we also show that our scheme achieves forward and backward secrecy. The performance analysis demonstrates that our method is efficient when comparing with existing schemes.

Q-Learning Based Content Placement Method for Dynamic Cloud Content Delivery Networks

How to reduce the content placement cost of cloud content delivery networks (CCDNs) is a hot topic in recent years. Traditional content placement methods mainly reduce the cost of content placement by constructing delivery trees, but they cannot adapt to the dynamic deployment of cloud proxy servers in the CCDNs. In addition, the traditional content placement method only provides delivery paths according to local decision-making without considering global dynamics of the congestion in the CCDNs, which is also one of the main factors causing high cost of content placement. To solve these problems, we propose a content placement model based on Q-learning for the dynamic CCDNs, called Q-content placement model (Q-CPM). This Q-learning approach can lead to better routing decisions due to up-to-date and more reliable congestion values. Then, based on the Q-CPM model, an algorithm is proposed to construct the Q-adaptive delivery tree (Q-ADT). In this algorithm, local and nonlocal congestion information is propagated over network learning packets. Through this algorithm, the paths with low congestion cost will be selected and can adapt to the dynamic cloud delivery environment. The experimental results show that the method can adapt to the dynamic changes of the CCDNs flexibly and reduce the overall congestion cost of content placement effectively.

Quality of Service on Link Aggregation Network Virtualization for Docker Containers

Docker engine is an extremely powerful tool for PaaS platform of cloud computing. It gives benefits for large-scale of internet services. Web service is basic service for everyone who requires to access internet that web infrastructure must has scalability with load-balance web server called reverse proxy. The key answers for a large-scale web must have multiple web servers working together with high speed bandwidth. Moreover, multiple clusters can find in the same data center there are required to assign priority and quality of each cluster service. We investigate load-balance assign link aggregation with network QoS by using pipework script and traffic control tool in frontend reverse proxy server on each cluster. Our research evaluates scenario of network QoS ratios which include 50/50, 60/40, 70/30 and 80/20. We compare network bandwidth between both web reverse proxy clusters. The results present our designed and implementation tool not only can control network QoS on each web reverse proxy cluster in all load-balance link aggregation modes which include round-robin, XOR and ALB but also those of clusters can access multiple network interface. In experiment, average network bandwidths in all QoS cases are around 200 MB per second for link aggregation of 2 gigabit interface.

Towards Machine Learning Models as a Key Mean to Train and Optimize Multi-view Web Services Proxy Security Layer

<p class="0abstractCxSpFirst">Muti-view Web services have brought many advantages regarding the early abstraction of end users needs and constraints. Thus, security has been positively impacted by this paradigm, particularly, within Web services applications area, and then Multi-view Web services.</p><p class="0abstractCxSpMiddle">In our previous work, we introduce the concept of Multi-view Web services to Internet of Things architecture within a Cloud infrastructure by proposing a Proxy Security Layer which consists of Multi-view Web services allowing the identification and categorizing of all interacting IoT objects and applications so as to increase the level of security and improve the control of transactions.</p><p class="0abstractCxSpLast">Besides, Artificial Intelligence and especially Machine Learning are growing fast and are making it possible to simulate human being intelligence in many domains; consequently, it is more and more possible to process automatically a large amount of data in order to make decision, bring new insights or even detect new threats / opportunities that we were not able to detect before by simple human means.</p>In this work, we are bringing together the power of the Machine Learning models and The Multi-view Web services Proxy Security Layer so as to verify permanently the consistency of the access rules, detect the suspicious intrusions, update the policy and also optimize the Multi-view Web services for a better performance of the whole Internet of Things architecture.

A Novel Adaptive Caching Mechanism for Video on Demand System Over Wireless Mobile Network

Video on Demand system over the wireless mobile network is a system that provides video services to mobile clients.The main problem with these systems is the high service delay where the mobile clients have to wait to view their favorite movie.The importance of this paper is based on finding a solution on how to reduce the delay time in the VOD system.This paper introduces a novel caching mechanism named Proxy Server Cache mechanism to tackle the issue of service delay.This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. The delayed clients will directly acquire the first segment from the proxy server instead of waiting for the following broadcasting channel pertaining to the first segment. The proposed scheme ensures obtaining the first segment from mobile clients when they arrive. Additionally, the performance of the proposed scheme is validated by applying the VOD system, which can involve the balancing mechanism to retain particular requests through to the local proxy server to provide a fair dissemination for these requests. The obtained result confirms that the proposed scheme reduces the time delay of the system in comparison with the best existing schemes. The results of the average time delay in the Proxy-Cache scheme is 179.2505 milliseconds when 10 clients arrive each minute (Client/minute), the average time delay is 140 milliseconds when the video lengths are 30, 60 and 90. Meanwhile, the failure probability for obtaining the first segment of the video remains zero when the number of arrived requests is set to 2, 4, 6, 8 and 10.

Designing an Adaptive Bandwidth Management for Higher Education Institutions

Purpose: This study proposes an adaptive bandwidth management system which can be explicitly used by educational institutions. The primary goal of the system is to increase the bandwidth of the users who access more on educational websites. Through this proposed bandwidth management, the users of the campus networks is encouraged to utilize the internet for educational purposes. Method: The weblog from a university's pfSense proxy server was utilized and undergo Web Usage Mining (WUM) to determine the number of educational and non-educational websites accessed by the users. Certain formulas were used in the computation of the bandwidth which was dynamically assigned to the users. A prototyping technique was applied in developing adaptive bandwidth management system. The prototype was simulated and evaluated by experts in compliance with ISO/IEC 14598-6 and ISO/IEC 9126-1 standards. Results: This study found that the prototype is capable of adjusting the bandwidth of the network users dynamically. The users who browsed more on educational websites or contents were assigned with higher bandwidth compared to those who are not. Further, the evaluated prototype met the software standards of ISO. Conclusion: The proposed adaptive bandwidth management can contribute to the continuous development in the area of computer networking, especially in designing and managing campus networks. It also helps the network administrators or IT managers in allocating bandwidth with minimal effort.

A Novel Adaptive Caching Mechanism for Video on Demand System Over Wireless Mobile Network

Video on Demand (VOD) system over the wireless mobile network is a system that provides video services to mobile clients. The main problem with these systems is the high service delay where the mobile clients have to wait to view their favorite movie. The importance of this paper is based on finding a solution on how to reduce the delay time in the VOD system. This paper introduces a novel caching mechanism named Proxy Server Cache mechanism to tackle the issue of service delay. This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. In this mechanism, the video’s first segment is stored on a server of a stationary proxy type. The delayed clients will directly acquire the first segment from the proxy server instead of waiting for the following broadcasting channel pertaining to the first segment. The proposed scheme ensuresobtaining the first segment from mobile clients when they arrive. Additionally, the performance of the proposed scheme is validated by applying the VOD system, which can involve the balancing mechanism to retain particular requests through to the local proxy server to provide a fair dissemination for these requests. The obtained result confirms that the proposed scheme reduces the time delay of the system in comparison with the best existing schemes. The results of the average time delay in the Proxy-Cache scheme is 179.2505 milliseconds when 10 clients arrive each minute (Client/minute), the average time delay is 140 milliseconds when the video lengths are 30, 60 and 90. Meanwhile, the failure probability for obtaining the first segment of the video remains zero when the number of arrived requests is set to2, 4, 6, 8 and 10.

PENERAPAN TEKNOLOGI CACHE SERVER BERBASIS IoT DENGAN RASPBERRY Pi3 MENGGUNAKAN METODE FORWARD CHAINNING

With the rapid technological development, the growing number of Internet clients over time, the internet access response is slow and it takes filtering of a few websites that can harm users. For that required cache proxy server to speed up internet access time and website filtering. The use of proxy servers usually still use the standard configuration on the proxy server. This configuration can be set or modified (tuning) in such a way as to create a proxy server that is reliable and have better performance. The play on the proxy server is done by changing some parameters that are inside the proxy server application and adapted to the needs of usage on the internet network. The application used to create this proxy server is squid that runs on raspberry pi3 with a rasbian operating system. Squid applications are mostly used in local and internet networks for storing web cache, blocking multiple websites, managing bandwidth up to access restrictions.

Improvement of fusion algorithm using cascade method and implementation on proxy server for replacing negative content on a porn site

Improvement of fusion algorithm using cascade method and implementation on proxy server for replacing negative content on a porn site

Cruisers: An automotive sensing platform for smart cities using door-to-door garbage collecting trucks

Due to the advance in information and communication technologies, smart cities have become an increasingly appealing vision. One indispensable basis in the research, development and implementation of smart cities is urban sensing technology. Automotive sensing is a novel urban sensing technology that equips sensors to vehicles, like buses, taxi cabs or garbage trucks and utilizes their mobility to help to conduct urban sensing tasks. In this paper, we present Cruisers, an automotive sensing platform for smart cities, based on the following ideas: a) Garbage collecting trucks are used to host sensors, b) Cellular communication network is used to deliver sensed data to servers, and c) Proxy server(s) are adopted to convert the format of sensed data to required ones, such as sampling rate, spatial interval or pub/sub protocol. To validate the feasibility of Cruisers, we implement a real system that consists of 66 customized sensing modulars integrating typical environmental and mobility sensors and deploy them into the garbage collecting trucks at Fujisawa, a medium-sized city in Japan. Performance evaluation is conducted to investigate the performance of Cruisers in terms of scalability, data publishing delay and spatial coverage.