Search

The distributed environment insists the protection of servers, while information sharing is achieved. The conventional biometrics-based password authentication mechanisms use single server, which can be compromised easily. The dual stage authentication mechanism has been already proved for its security over the single stage authentication mechanism in our previous work. In this paper, the protocol is improved to establish communication between the authentication server and the master server through a secure link. Since the hashed messages are prone to collision attacks, the proposed scheme uses elliptic curve cryptography-based ciphers for establishing connection at the initial stage. The security analysis of the proposed authentication scheme with secure server – server communication link reveals the robustness and the security features, which are offered over our previous as well as the conventional authentication mechanisms. Keywords: Authentication, Security, Server, Biometric, Protocol

In recent years, the internet of things has been widely utilized in various fields, such as in smart factories or connected cars. As its domain of application has expanded, it has begun to be employed using multi-server architectures for a more efficient use of resources. However, because users wishing to receive IoT(Internet of Things) services connect to multi-servers over wireless networks, this can expose systems to various attacks and result in serious security risks. To protect systems (and users) from potential security vulnerabilities, a secure authentication technology is necessary. In this paper, we propose a smart card-based authentication protocol, which performs the authentication for each entity by allowing users to go through the authentication process using a smart card transmitted from an authentication server, and to login to a server connected to the IoT. Furthermore, the security of our proposed authentication protocol is verified by simulating a formal verification scenario using AVISPA(Automated Validation of Internet Security Protocols and Applications), a security protocol-verification tool.

This paper proposes an online in-time service problem with minimal server assignment where the objective is to minimize the number of used servers. We mainly focus on the scenario where an offline optimal solution requires exactly two servers. For the case with general metric space, we present a 3 / 2-competitive algorithm, and also prove a matching lower bound. For a special case where the metric space is the positive axis, we present an online algorithm being optimally 1-competitive.

The advantage of having remote access motivates network administrators to connect mission-critical servers (e.g., enterprise management systems) as well as public web servers via the Internet, even though connecting these mission-critical servers to the Internet is not recommended. These mission-critical or public servers are accessible from any host on the Internet, allowing cyber attackers to engage the targeted server as part of a process to discover potential exploits and unpatched vulnerabilities. Although it would be difficult to eradicate all the potential vulnerabilities in advance, accessibility to a server can be controlled to limit or minimize the chance of exposing a vulnerable surface. We aimed to address the accessibility issue by designing and prototyping an Invi-server system, in which the IP and MAC addresses of the protected secret server remain invisible from external scanning and eavesdropping trials and even from compromised internal hosts on the network. This Invi-server system can be used as a way to reduce the attack surface of a protected server while allowing authorized users to send and receive packets via the protected server. We also implemented a prototype of the Invi-server system to demonstrate that our proposed system has the ability to reduce the attack surfaces significantly without increasing network performance overhead to any significant extent.

This paper proposes a dual-stage biometrics-based authentication mechanism using smart card. It is considered the improvement over the conventional single-stage biometrics-based authentication mechanism, which exploits only one server for authentication, whereas the proposed scheme exploits two servers. The user authentication is performed in one server and hence it is called an authentication server. The credentials of the authentication server are stored in the second server, called the master server. The master server facilitates the authentication by providing required credentials to the authentication server. Both the security analysis and complexity analysis are conducted between the proposed and the conventional schemes. The analysis results show that the proposed scheme is secure than the conventional schemes with negligible computational complexity.

Internet and Communication Technologies operates widely in a multi-server environment. Authentication is one of a primary concern in multiserver environment. There are so many remote user authentication schemes using smart cards that operate in multi-server environment. But there are some authentication bottlenecks that these schemes suffer from. We have analyzed some schemes on the grounds of some specific security requirements and goals. In this paper, we propose a scheme that integrates key exchange and session key agreement in one phase and also supports traceability feature and resists denial of service attack.

The authors proposed to design and implement a prototype research electronic automated teller machine service using Windows Communication Foundation to study the performance and scalability of implementing Web Service Security policy. The software chosen for building the service are C# programming language, Internet Information Service web server, Microsoft Structured Query Language database server and Visual Studio.NET Integrated Design Environment as development toolkits. To evaluate the different performance metrics, the Windows Communication Foundation Service has been tested by using testing tool Mercury LoadRunner, version 8.1. In this paper, the authors will present the architecture of the service, its testing procedures, and statistical analysis of the system performance.

In a multi-server authentication environment, a user only needs to register once at a central registration place before accessing the different services on the different registered servers. Both, from a user point of view as for the management and maintenance of the infrastructure, these types of environments become more and more popular. Smartcard- or smartphone-based approaches lead to more secure systems because they offer two- or three-factor authentication, based on the strict combination of the user’s password, the user’s biometrics and the possession of the device. In this paper, we propose an efficient anonymous authentication protocol in multiple server communication networks, called the EAAM protocol, which is able to establish user anonymity, mutual authentication, and resistance against known security attacks. The novelty of the proposed scheme is that it does not require a secure channel during the registration between the user and the registration center and is resistant to a curious but honest registration system. These features are established in a highly efficient way with the minimum amount of communication flows between user and server during the establishment of the secret shared key and by using light-weight cryptographic techniques such as Chebyshev chaotic map techniques and symmetric key cryptography. The performance and security of the protocol are analyzed and compared with the latest new proposals in this field.

Increasing geographical spreads of modern distributed interactive applications (DIAs) make distributed server deployment vital for combating network latency and improving the interactivity among participants. In this paper, we investigate the server provisioning problem that concerns where to place servers for DIAs. We formulate the server provisioning problem with an objective of reducing the network latency involved in the interaction between participants. We prove that the problem is NP-hard under several scenarios. We analyze the performance of the classical k-median server placement for DIAs and propose a new greedy server provisioning heuristic for DIAs. Theoretical analysis shows that the approximation ratio of the proposed greedy algorithm is much lower than that of the k-median placement. Experiments using real Internet latency data also show that our proposed algorithm significantly outperforms the k-median and other baseline server placements. MOE (Min. of Education, S’pore) Accepted version

Cloud Computing is a distributing computing technology which is used as pay per use basis. Now a day’s Cloud Computing is the most reputed topic due to its ability to offer guaranteed quality of service atmosphere, dynamic IT infrastructures, and conFigureurable software services. But many users could not satisfy on cloud services completely due to their uncovering security purpose for handling large numbers of data. Even the network becomes uncontrollable, when large numbers of user’s request to the server create network congestion and data losses vigorously. Content Delivery Network OR CDN is an eminent solution of this problem. Our objective is to create local and global server and connect the global server to system manager, which is worked over Content Delivery Network to deliver and direct the user request to the nearest global edge server except local server and establish the connection between them and transfer the respective content. For optimization of edge selection process and reduce the load over content delivery network we approach local server concept in this paper.

1,2,34 Abstract: Client-Server model is the backbone of today"s internet communication. In which normal user can not have control over particular website or server. By using the same processing model one can have unauthorised access to particular server. In this paper, we discussed about application scenario of hacking for simple website or server consist of unauthorized way to access the server database. This application emerge to autonomously take direct access of simple website or server and retrieve all essential information maintain by administrator. In this system, ip address of server given as input to retrieve user-id and password of server. This leads to breaking administrative security of server and acquires the control of server database. Where as virus helps to escape from server security by crashing the whole server

Video server providers invest more and more on the server, for how to provide a stable and low-cost continuous service to users of this problem. In this paper, hybrid architecture in the user how to choose a cloud server in-depth analysis. And how to choose a cloud server for this problem, this paper analyzes the current server selection method, coupled with P2P mode users the ability to upload and server memory on this basis for modeling, then verified through simulation experiments proposed the effectiveness of the method.

With the growth of the internet use, the reliability of servers that offer various services to clients are becoming an important issue. Power consumption and cost of a server system are also important issues to keep environments and satisfy budgets available for a project. This paper proposes a server management system that is tolerant of trouble that occurs simultaneously in two servers. In addition, the proposed system does not depend on the number of target servers for management. The key ideas in our approach are (1) construction of server groups to realize high reliability, (2) management function to monitor the operation status of the servers, (3) a server function recovery operation using a virtual server to continue internet services in case of server trouble. Experimental results show that our approach ensures high-reliable operation of internet services.

Mobile data collection systems (MDCS) in the health sector are of great benefit to health care providers and community workers especially in low-resource settings. MDCS enable the extension and provision of health services closer to the community by enabling data collection and diagnosis without the patient being in a hospital setting. MDCS, however, face a number security challenges including authentication and authorization of users, secure communication between a mobile client and the server, and secure application deployment. This paper provides a criteria and guidelines for evaluating an authentication model for MDCS. The criteria encompass key authentication dimensions including proper local and remote authentication, password management and recovery especially with no Internet connectivity. We assess the authentication models using two reference systems that are widely used in low-resource settings, namely, District Health Information Software (DHIS 2) and mUzima. The findings reveal gaps in the authentication model of the reference systems including insecure authentication, insecure storage of user credentials on the mobile device and no proper automatic logouts, among others.

Information systems security, access management, and privacy are normally understood through the processes of authentication and authorization. This entry provides a brief historical context and then describes several methods of authentication, such as passwords, digital signatures, network topology, smart cards, biometrics, and public key cryptography. It also discusses the most popular methods of authorization, including mandatory, discretionary, and role-based access control

New media has increased communication between people all over the world and the Internet. Problems can be solved by centralized management of SDN controller in 5G, such as security and limited bandwidth in new media. An authentication server and a database server are connecting to the same switch. SDN controller generates a flow table routing to the authentication server, when it receives requirements of accessing media content. With successful authentication, it optimizes network traffic. According to data type, a multiple route calculation method is proposed by modifying Dijkstra algorithm. The method provides reliable transmit routes for higher quality of service (QoS). To test the proposed strategies, prototype system was designed with an ODL controller and switches. And the system implements the authentication and hierarchical transmit functions.

The identity authentication system is based on multi-attribute and identity in broadcasting monitoring system. The scheme mainly uses the multi-attribute encryption Attribute-Based Encryption (ABE) as the core, draws Identity-Based Encryption (IBE) to generate the global unified Global Identifier (GID), and proposes the GID-Attribute-Based Encryption (GABE) encoded technology. The method is mainly aimed at the scenario of requesting authentication only from the sub-station server when disconnected from the central server. A static password authentication method for username and password, and data transmission process to MD5 and ABE combined with encryption are used in the distributed authentication system. The central server and the sub-station server each have some attributes, according to the number of decoded attributes to determine the user operator and visitor identity.

As the chat application grows, running integration tests on a developer’s machine becomes a boring task because it starts consuming a lot of time. Can you see the problem that could emerge? The application has good test coverage, but the developer doesn’t run the tests because they take too much time (the developer’s machine is not a powerful server, right?). Well, having tests and not running them is the same as not having tests, and you already know that having no tests is not a good idea!

The rapid increase of Internet of Things (IoT) devices will have a significant impact on people's daily life, providing a wide range of services, such as smart lights, door locks, and cameras remotely controlled by smartphones. Remote access within the same environment or via the Internet requires effective authentication and authorization mechanisms beyond those provided by static authentication methods. We believe a dynamic authentication mechanism for mobile users is needed to protect against unauthorized access. This paper proposes a context-aware authentication service for mobile users in Smart Home environments. The service we have designed and implemented provides secure and flexible access to local as well as remote users, as demonstrated by the evaluation results.

Real-time applicationisone of the internet-based applications that function with in a time frame that require a quick response between client and server. It has been improved to fulfill user's demand towards Next Generation Network(NGN), by injecting intensive and media-rich elements in the applications. All these innovations need sufficient bandwidth to ensure them to be delivered continuously, smoothly and successfully to the end users. However, current scenario has seen the internet population has raised rapidly so does the potential size of its traffic hat give significant impact to the online service. Hence, an efficient infrastructure is required to satisfy the demand of internet applications such as multimedia streaming. In this paper, we describe a frame work to allocate a temporary server to serve local clients within the same network domain during high traffic. This proposal has been tested on video streaming application to see the continuity of the service. from the primary server to the local alternative server instead of only pointing to one source of server. This approach is by remotely allocates a temporary server at local area that is near to the client domain network. This temporary server is allocated during network high congestion and it is done by primary server at a runtime. The temporary local server will serve the group of client in the same domain network.This method is diverse to the previous approaches such as Peer-to-Peer (P2P) networking, Content Delivery Network (CDN) and Replication/cache server (7)-(9). The previous solutions are not practical due to high cost to allocate the physical server, high maintenance and also need to verify the accurate location of the servers. In contrast, our proposal is more cost saving as we need only some space temporary during the network congestion and the server will return back to the primary server once the task of serving client's request have accomplished.

Energy aware server cluster aims to reduce power consumption at maximum while keeping QoS(quality of service) as much as energy non-aware server cluster. In the existing methods of energy aware server cluster, they calculate the minimum number of active servers needed to handle current user requests and control server power mode in a fixed time interval to make only the needed servers ON. When loads change rapidly, QoS of the existing methods become degraded because they cannot increase the number of active servers so quickly. To solve this QoS problem, we classify load change situations into five types of rapid growth, growth, normal, decline, and rapid decline, and apply five different thresholds respectively in calculating the number of active servers. Also, we use a flexible scheme to adjust the above classification criterion for multi threshold, considering not only load change but also the remaining capacity of servers to handle user requests. We performed experiments with a cluster of 15 servers. A special benchmarking tool called SPECweb was used to generate load patterns with rapid change. Experimental results showed that QoS of the proposed method is improved up to the level of energy non-aware server cluster and power consumption is reduced up to about 50 percent, depending on the load pattern.Keywords:Energy-Aware Server Clusters, Server Power Mode Control, QoS, Multi-Threshold

Where in a metropolitan area server controls the network management process and the service process of a node switch and a node server under it, while the node server controls the network management process and the service process of an access switch and a terminal under it. Where in the metropolitan area server or the node server allocates an address to each network device by sending a query packet to each communication port, and establishes a clear network topology on the main control server side during the allocation process, in a main control mode. Thus, during the transmission process of a specific data packet, the main control server (metropolitan area server or node server) directly allocates a corresponding communication link (because it clearly knows the device topology of the whole network), without the need of carrying out route negotiation between each network device, thus a stable transmission rate may be guaranteed, and delay may be avoided.

Load balancing can be done at two levels, the HTTP level and the network level. It refers to the distribution of the HTTP request made by the user across the web server in a server cluster and is achieved by various algorithms such as Random Selection, Round Robin, weighted Round Robin etc. At the network level load balancers are used for the purpose of balancing the load. The approach such as DNS forwarding and spraying the load across the servers is very useful and effective at the network level (11)(12). The load balancers receives the request and proxies the destination ip for forwarding the request to the less utilized servers in order to gain better performance. This paper proposes a server load balancing scheme mainly for the webservers by making the limited number of clients to work as a virtual server which are called virtual clients in the webserver network. This approach is done at the HTTP level by forwarding the HTTP request to the nearest and less loaded virtual client. The HTTP request is only forwarded to get the static content in order to save the current bandwidth utilization of the web server and process more dynamic request on the server side. The daemon routine controls the whole process of web server load balancing but it only processes the HTTP requests. The daemon routine only resides on the web server backend. The client virtualization provides a new anti-overloading technique to reduce the access time of the server and to utilize the server resources without any additional cost. The Client Virtualization also provides a better way to utilize the system bandwidth in web server network. clients the web server easily gets overload thus, it's better to migrate (10) (distribute) the load on other available servers too. The server load also has to be distributed so as not to overload the other available servers in the web-server network. The network congestion in system can reason the overloading which prompts break-down of servers. The best possible appropriation of load on the server is carried out by the load balancer. The load balancer is answerable for the equally assigning the requests to the server pool in order to disallow the over-loading of the single server in the web- server system. The load balancing techniques could be exceptionally adequate for the server hubs to process the client's demands. The load balancing strategies helps in minimizing the reaction time and to legitimately use the throughput of the server network. A large number of algorithms are being utilized by the load balancers to verify which server to send the request to. Random choice, round robin, saturation load balancing, load based, least connection and failover load balancing are the algorithms which are being very frequently used by the load balancers to distribute the load. To enhance the load adjust around the servers various parameters, for example server's recent load, recent reaction time and how much traffic it has been recently assigned are taken into account.

In this paper, a hierarchical authentication protocol is propos ed to minimize authentication delay in proxy mobile IPv6 networks. The authentication function of the AAA server is dist ributed to the LMAs and the MAGs. If the LMAs or the MAGs have authentication information of the MNs, they authentic ate the MN on behalf of the AAA servers. Therefore, the authentication delay is reduced. The AAA server is vulnerable t o denial-of-service attack. If the AAA server is down, MNs cannot access the proxy mobile IPv6 network until they are auth enticated. The proposed scheme reduces the load on the AAA server by distributing the authentication function to the LMAs and the MAGs.Keywords: PMIPv6, EAP-AKA, Authentication, Key agreement접수일(2013년 12월 11일), 수정일(2013년 12월 16일), 게재확정일(2013년 12월 16일)* 이 논문은 2013년도 정부(교육과학기술부)의 재원으로 한국연구재단의 기초연구사업 지원을 받아 수행된 것임(2012R1A1B3004161)* This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Tech-nology(2012R1A1B3004161)†주저자, theboy@emerald.yonsei.ac.kr‡교신저자, jssong@emerald.yonsei.ac.kr (Corresponding author)

To play the networked video contents in a client's mobile device in real time, the contents should be delivered to it by the contents server with streaming technology. Generally, in a server-client based commerce model, the server is in charge of both the authentication of the paid customer and distribution of the contents. The drawback of it is that if the customers' requests go on growing rapidly, the service quality would be degraded results from the problems of overloaded server or restricted network bandwidth. On the contrary, in P2P based networks, more and more the demand for service increasing, the service quality is upgraded since a customer can act as a server. But, in the P2P based network, there are too many servers to manage, it's possible to distribute illegal contents because the P2P protocol cannot control distributed servers. Thus, it's not suitable for commercial purposes. In this paper, the dymanic group authentication scheme is proposed which is suited to P2P based applications. The proposed scheme consists of group based key generation, key update, signature generation and verification protocols. It can control the seeder's state whether the seeder is joining or leaving the network, and it can be applied to hybrid P2P based commerce model where sales transactions are covered by the index server and the contents are distributed by the P2P protocol.

This paper is the implementation of private cloud software as service server; centralized remote accessibility and data storage system without internet connection in Microsoft windows server 2K8 with domain controlling .Migrating from a traditional model to the Cloud model reduce cost for enterprise customer. The main objectives of Saas provider are to minimize cost and to improve Customer Satisfaction Level (CSL)(13)

Proxy server is the intermediary between client and the Internet. The usage of proxy server is one of many means to avoid excessive access to the Internet. Proxy server’s cache will save every web page which has been accessed, so clients can save their bandwidth when they access same web pages repeatedly. Distributed proxy is a collection of connected proxy servers which has shared cache. This research will prove that distributed proxy server can shorten data access time and minimize bandwidth. On this research, we use Squid Proxy Server on Windows 7 as the main tool. Index Terms - distributed proxy, shared cache, Squid

Effective media server placement strategies are critical for the quality and cost of multimedia services. Existing studies have primarily focused on optimization-based algorithms to select server locations from a small pool of candidates based on the entire topological information and thus these algorithms are not scalable due to unavailability of the small pool of candidates and low-efficiency of gathering the topological information in large-scale networks. To overcome this limitation, a novel scalable framework called NetClust is proposed in this paper. NetClust takes advantage of the latest network coordinate technique to reduce the workloads when obtaining the global network information for server placement, adopts a new K-means-clustering-based algorithm to select server locations and identify the optimal matching between clients and servers. The key contribution of this paper is that the proposed framework optimizes the trade-off between the service delay performance and the deployment cost under the constraints of client location distribution and the computing/storage/bandwidth capacity of each server simultaneously. To evaluate the performance of the proposed framework, a prototype system is developed and deployed in a real-world large-scale Internet. Experimental results demonstrate that 1) NetClust achieves the lower deployment cost and lower delay compared to the traditional server selection method; and 2) NetClust offers a practical and feasible solution for multimedia service providers.

With increasing problems of network security, a server with high concurrency is designed here to deal with identity authentication. In the general design of the server, RSA and DES algorithm are used. RSA algorithm is used to encrypt or decrypt users identity information. DES algorithm is used to ensure the information will not be stolen. In order to ensure the server has high concurrency, the technology of epoll and thread pool is applied to design the server in the Linux system. In the end , integration testing and stress testing are performed to test its reliability and stability. The testing result shows that the server can run properly under heavy concurrent load.

We propose new authentication protocols to support fast handover in IEEE 802.11-based wireless mesh networks. The authentication server does not need to be involved in the handover authentication process. Instead, mesh access points directly authenticate mobile clients using tickets, avoiding multi-hop wireless communications in order to minimize the authentication delay. Numerical analysis and simulation results show that the proposed handover authentication protocol significantly outperforms IEEE 802.11 authentication in terms of authentication delay.

Access control has vital significance in cloud computing, where data files are stored in the cloud server. In current schemes, the cloud server typically needs to consult the backend authorization server, when processing access control request from data users. This will put a heavy burden on the authorization server, and therefore introduce Denial-of-Service attack on it. To address this issue, this paper models the access control requirement in cloud computing, and designs a distributed access control scheme. Its security features and efficiency are analyzed. The results show that our scheme is quite improved, because it separates the authorization process from the access control process, and releases the authorization server from the access control process. By doing so, the burden on the authorization server is reduced, and the Denial-of-Service attacks on it during access control process are avoided.

Authentication is a process by which both the sender and receiver check and identify the validcommunicative partners prior to initialization of message exchange. Authentication is a security module which is defined at the time of starting of communication between the two communicating entities such as client and server due to the unlimited amount of insecure and malicious intruders it becomes significant to protect the network communication. The protocols are used here for initializing the valid keys and passwords for communicating with the devices. Here we are proposing a new and more secured authentication scheme based on unique identification of every pair of client and server which have entered communication on a global network. This method enhances the present security scenario by diminishing the replay, modification attacks as well as server eavesdropping. This method also enhances the efficiency, integrity, reliability and security in authentication process.

 Abstract—This paper presents an analytical model and the way of simulation for distributing workload on a distributed web server system. The increase in the Internet traffic has also necessitated the conventional Domain Naming Service (DNS) to operate at a much lower efficiency. Among a number of problems associated with the DNS, a key problem has to do with the authoritative DNS not being able to process complete knowledge of the proximity. This makes the authoritative DNS less effective in monitoring server availability and routing incoming requests around failed servers. The workload distribution strategy on the other hand, keeps track of the state and health of the web server. This avoids connection delay due to, for example, a failed server, which can be temporarily by passed by workload distribution. From a modeling standpoint, the conventional DNS assumes equal queue size for each web server in a round-robin setting. Under load balancing, the queue size for each web server differs based on the probability of accessing that server. This probability is based on such factors as the geography, server health, server response, server threshold, session capacities, and the round trip time. In this paper, both conventional and global workload distribution strategies are developed and compared based on a finite set of practical traffic scenarios.