Service Provider Server Research Articles

정보통신서비스 제공자가 보관하는 전자정보에 대한 수사기관의 압수·수색의 적법 요건 검토

Until now, theories and precedents have reviewed the legal requirements under the premise that the investigative agency's acquisition of electronic information generated and stored by a suspect from an information and communication provider's server such as Kakao Talk constitutes seizure and search. However, the act of an investigative agency acquiring electronic information related to a suspect from an information and communication service provider's server, such as Kakao Talk, limits the confidentiality and freedom of the suspect's communication. In this respect, it can be said that the actions of investigative agencies are similar to the concept of wiretapping under the Communications Secret Protection Act in terms of limiting basic rights. Since the act of acquiring electronic information by an investigative agency is a state action and should not infringe on the basic rights of the people, it should be reviewed whether it violates the principle of proportionality. If the investigative agency acquires electronic information from the server of the information and communication service provider even though it can achieve the purpose of the investigation by acquiring electronic information from the suspect's terminal, it is contrary to the minimum of damage and the balance of legal interests. Therefore, in order for an investigative agency to obtain electronic information from an information and communication service provider's server, 'the circumstances in which the purpose of the investigation cannot be achieved in any other way' must be clarified. It is reasonable to operate the warrant practice in this way, and it will be necessary to stipulate it in the Criminal Procedure Act in the future.

Implementasi Metode Load Balancing Sebagai Upaya Meningkatkan Kinerja Server

The use of the internet turns out to cause problems that must be found a solution. One of them is the service provider's server load which continues to increase. This condition is triggered by the increasing number of clients from time to time. Some sites even reported receiving hundreds of thousands of connection requests simultaneously from a number of clients. From these problems, research is needed that focuses on how to design and build a server system that is able to handle the increase in incoming requests so that the server load can be unraveled. The purpose of this research is that the service provider's server can improve its service to the client. There are several approaches to overcome these problems, one of which is by applying the load balancing method. So that by implementing load balancing, the incoming large load will be distributed to each of the service provider's servers. In the tests that have been carried out, the scalability of the system has increased. This is proven when a system with load balancing is given 10000 connections, the test results have an average response time of 44.42 ms. As for the system without load balancing, the test results have an average response time value of 185.88 ms. From the test results, it can be seen that the average response time of the server system with load balancing is smaller than without load balancing, so the service performance of the system can be continuously improved by implementing load balancing.

Multilevel Privacy Controlling Scheme to Protect Behavior Pattern in Smart IoT Environment

Traditional approaches generally focus on the privacy of user’s identity in a smart IoT environment. Privacy of user’s behavior pattern is an important research issue to address smart technology towards improving user’s life. User’s behavior pattern consists of daily living activities in smart IoT environment. Sensor nodes directly interact with activities of user and forward sensing data to service provider server (SPS). While availing the services provided by a server, users may lose privacy since the untrusted devices have information about user’s behavior pattern and it may share data with adversary. In order to resolve this problem, we propose a multilevel privacy controlling scheme (MPCS) which is different from traditional approaches. MPCS is divided into two parts: (i) behavior pattern privacy degree (BehaviorPrivacyDeg), which works as follows: firstly, frequent pattern mining‐based time‐duration algorithm (FPMTA) finds the normal pattern of activity by adopting unsupervised learning. Secondly, patterns compact algorithm (PCA) is proposed to store and compact the mined pattern in each sensor device. Then, abnormal activity detection time‐duration algorithm (AADTA) is used by current triggered sensors, in order to compare the current activity with normal activity by computing similarity among them; (ii) multilevel privacy design model: we have divided privacy of users into four levels in smart IoT environment, and by using these levels, the server can configure privacy level for users according to their concern. Multilevel privacy design model consists of privacy‐level configuration protocol (PLCP) and activity design model. PLCP provides fine privacy controls to users while enabling users to set privacy level. In PLCP, we introduce level concern privacy algorithm (LCPA) and location privacy algorithm (LPA), so that adversary could not damage the data of user’s behavior pattern. Experiments are performed to evaluate the accuracy and feasibility of MPCS in both simulation and real‐case studies. Results show that our proposed scheme can significantly protect the user’s behavior pattern by detecting abnormality in real time.

Development of User-Participatory Crowdsensing System for Improved Privacy Preservation

Recently, crowdsensing, which can provide various sensing services using consumer mobile devices, is attracting considerable attention. The success of these services depends on active user participation and, thus, a proper incentive mechanism is essential. However, if the sensing information provided by a user includes personal information, and an attacker compromises the service provider, participation will be less active. Accordingly, personal information protection is an important element in crowdsensing services. In this study, we resolve this problem by separating the steps of sensing data processing and the reward payment process. An arbitrary node in a sensing data processing pool consisting of user nodes is selected for sensing data processing, and only the processing results are sent to the service provider server to reward the data providing node. The proposed user-participatory crowdsensing system is implemented on the Kaa Internet of things (IoT) platform to evaluate its performance and demonstrate its feasibility.

Low-margin optical networking at cloud scale [Invited

Every day, customers across the globe connect to cloud service provider servers with requests for diverse types of data, requiring instantaneous response times and seamless availability. The physical infrastructure which underpins those services is based on optics and optical networks, with the focus of this paper being on Microsoft’s approach to the optical network. Maintaining a global optical networking infrastructure which meets these customer needs means Microsoft must utilize solutions which are highly tailored and optimized for the application space which they address, with appropriately streamlined solutions for metropolitan data center interconnect and long-haul portions of the network. This paper presents Microsoft’s approach for tackling these challenges at cloud scale, highlighting the low-margin solutions which are employed. We provide a survey of Microsoft’s regional network design and corresponding optical network architectures, and present volumes of real-time polled metrics from the thousands of lines systems and tens of thousands of transceivers deployed today. We close by describing our approach to a unified software-defined networking toolset which ultimately enables the velocity and scale with which we can grow and operate this critical network infrastructure.

Interoperable identity management protocol for multi-cloud platform

Multi-cloud adaptive application provisioning promises to solve data storage problem and leads to interoperability of data within multi-cloud environment. This also raises concern about interoperability of user among these computing domains. Although various standards and techniques have been developed to secure the identity of cloud consumer, but neither of them provides facility to interoperate and to secure the identity of cloud consumer. Thus, there is a need to develop an efficient authentication protocol that maintains single unique identity of cloud consumer and make it interoperable among various cloud service providers. Elliptic curve cryptography (ECC) based algorithms are the best choice among Public Key Cryptography (PKC) algorithms due to their small key sizes and efficient computation. In this paper, a secure ECC based mutual authentication protocol for cloud service provider servers using smart device and one time token has been proposed. The proposed scheme achieves mutual authentication and provides interoperability among multiple cloud service providers. The security analysis of the proposed protocol proves that the protocol is robust against all the security attacks. The formal verification of the proposed protocol is performed using AVISPA tool, which proves its security in the presence of intruder.

Security bound enhancement of remote user authentication using smart card

Distribution of resources and services via open network has becoming latest trend in information technology. This is provided by many service provider servers. In open network, hackers can easily obtain the communication data. Therefore, open networks and servers demand the security to protect data and information. Hence, network security is most important requirement in distributed system. In this security system, authentication is considered as the fundamental and essential method. Recently many remote user authentication schemes are proposed. In 2012, WANG Ding et al. proposed a remote user authentication scheme, in which the author stated that the scheme provides protection against offline password guessing, impersonation and other known key attacks. By cryptanalysis we have identified that, WANG Ding et al.'s scheme does not provide user anonymity, once the smart card is stolen. This scheme is also susceptible to offline password guessing attack, server masquerading attack, stolen smart card attack and insider attack. Further, this scheme still has problem with proper perfect forward secrecy and user revocation. In order to fix these security weaknesses, an enhanced authentication scheme is proposed and analysed using the formal verification tool for measuring the robustness. From the observation of computational efficiency of the proposed scheme, we conclude that the scheme is more robust and easy to implement practically.

Caching resource sharing in radio access networks: a game theoretic approach

Deployment of caching in wireless networks has been considered an effective method to cope with the challenge brought on by the explosive wireless traffic. Although some research has been conducted on caching in cellular networks, most of the previous works have focused on performance optimization for content caching. To the best of our knowledge, the problem of caching resource sharing for multiple service provider servers (SPSs) has been largely ignored. In this paper, by assuming that the caching capability is deployed in the base station of a radio access network, we consider the problem of caching resource sharing for multiple SPSs competing for the caching space. We formulate this problem as an oligopoly market model and use a dynamic non-cooperative game to obtain the optimal amount of caching space needed by the SPSs. In the dynamic game, the SPSs gradually and iteratively adjust their strategies based on their previous strategies and the information given by the base station. Then through rigorous mathematical analysis, the Nash equilibrium and stability condition of the dynamic game are proven. Finally, simulation results are presented to show the performance of the proposed dynamic caching resource allocation scheme.

A User Anonymous Mutual Authentication Protocol

Widespread use of wireless networks has drawn attention to ascertain confidential communication and proper authentication of an entity before granting access to services over insecure channels. Recently, Truong et al. proposed a modified dynamic ID-based authentication scheme which they claimed to resist smart-card-theft attack. Nevertheless, we find that their scheme is prone to smart-card-theft attack contrary to the author’s claim. Besides, anyone can impersonate the user as well as service provider server and can breach the confidentiality of communication by merely eavesdropping the login request and server’s reply message from the network. We also notice that the scheme does not impart user anonymity and forward secrecy. Therefore, we present another authentication scheme keeping apart the threats encountered in the design of Truong et al.’s scheme. We also prove the security of the proposed scheme with the help of widespread BAN (Burrows, Abadi and Needham) Logic.

SIMSec: A Key Exchange Protocol Between SIM Card and Service Provider

Mobile technology is so popular and overdosed adoption is inevitable in today's world. As the mobile technologies have advanced, Service Providers (SP) have offered services via Smartphones and some of them required secure data communication between the Subscriber Identity Module (SIM) cards on Smartphones and the servers of SP. The latest SIM cards comply with recent specifications including secure domain generation, mobile signatures, pre-installed encryption keys, and other useful security services. Nevertheless, un-keyed SIM cards do not satisfy such requirements, thus end-to-end encryption between the SIM card and SP cannot be provided. In this paper, we provide a key exchange protocol, which creates a symmetric key through the collaborative work of the SIM card and the SP server. After a successful protocol performance, the SIM card and SP can perform end-to-end data encryption. After defining the protocol, we also discuss the security issues and provide a formal security analysis of the protocol using the Casper/FDR tool.

Core Stable Algorithms for Coalition Games with Complementarities and Peer Effects

In this short paper, we show two new algorithms for finding stable structures in ordinal coalition potential games. The first one is anytime and enumerative. It performs on a graph. The second one is a modified Deferred Acceptance Algorithm (DAA) using counter-proposals. It finds a many-to-one matching. We illustrate with the example of video caching from a content creator's servers to a service provider's servers.

Genomic cloud computing: legal and ethical points to consider.

The biggest challenge in twenty-first century data-intensive genomic science, is developing vast computer infrastructure and advanced software tools to perform comprehensive analyses of genomic data sets for biomedical research and clinical practice. Researchers are increasingly turning to cloud computing both as a solution to integrate data from genomics, systems biology and biomedical data mining and as an approach to analyze data to solve biomedical problems. Although cloud computing provides several benefits such as lower costs and greater efficiency, it also raises legal and ethical issues. In this article, we discuss three key ‘points to consider' (data control; data security, confidentiality and transfer; and accountability) based on a preliminary review of several publicly available cloud service providers' Terms of Service. These ‘points to consider' should be borne in mind by genomic research organizations when negotiating legal arrangements to store genomic data on a large commercial cloud service provider's servers. Diligent genomic cloud computing means leveraging security standards and evaluation processes as a means to protect data and entails many of the same good practices that researchers should always consider in securing their local infrastructure.

Cryptanalysis of Sood et al.'s Dynamic Identity Based Authentication Protocol for Multi-Server Architecture

Sood, Sarje, and Singh recently proposed a secure dynamic identity-based (ID-based) authentication protocol for multi-server architectures utilizing smart cards, wherein they reveal security weaknesses of Hsiang and Shih’s dynamic identity-based remote user authentication scheme. Sood et al. claim their proposed scheme can provide protection from various attacks such as replay, malicious user, stolen smart card, and offline dictionary attacks. However, we found their protocol does not have any defense mechanism against denial-of-service (DoS) or distributed denial-of-service (DDoS) attacks such as resource exhaustion attack which severely affects cascade style authentication schemes. We also found the protocol is susceptible to smart card vulnerabilities such as power analysis attack from privileged insiders. In addition, if an attacker has knowledge of both the verification tables and the master secret of the control server, the client verification tables and the service provider server database are susceptible to the verifier disclosure attack and offline dictionary attack. In this paper, we will demonstrate that Sood et al.’s protocol is insecure and suffers from aforementioned potential security vulnerabilities in detail.

Dynamic Identity Based Authentication Protocol for Two-Server Architecture

Most of the password based authentication protocols make use of the single authentication server for user's authentication. User's verifier information stored on the single server is a main point of susceptibility and remains an attractive target for the attacker. On the other hand, multi-server architecture based authentication protocols make it difficult for the attacker to find out any significant authentication information related to the legitimate users. In 2009, Liao and Wang proposed a dynamic identity based remote user authentication protocol for multi-server environment. However, we found that Liao and Wang's protocol is susceptible to malicious server attack and malicious user attack. This paper presents a novel dynamic identity based authentication protocol for multi-server architecture using smart cards that resolves the aforementioned flaws, while keeping the merits of Liao and Wang's protocol. It uses two-server paradigm by imposing different levels of trust upon the two servers and the user's verifier information is distributed between these two servers known as the service provider server and the control server. The proposed protocol is practical and computational efficient because only nonce, one-way hash function and XOR operations are used in its implementation. It provides a secure method to change the user's password without the server's help. In e-commerce, the number of servers providing the services to the user is usually more than one and hence secure authentication protocols for multi-server environment are required.

Improvement of smart card based password authentication scheme for multiserver environments

In multiserver (MS) environments, it is preferable for a remote user to login to different service provider servers by keying in the same password. Recently, Wang et al. proposed an improvement on the dynamic identity-based smart card authentication scheme of Liao and Wang for MS environments. Sandeep et al. improved the dynamic identity-based smart card authentication scheme of Hsiang et al. for MS architecture. However, we found that the schemes of Wang et al. and Sandeep et al. failed to provide service provider server authentication, perfect forward security, and login scalability. In addition, the scheme of Sandeep et al. was insecure against stolen verifier attacks. This paper proposes an improved smart card-based password authentication scheme for MS environments. The new scheme removes all of the abovementioned weaknesses. The proposed identity-based smart card authentication scheme satisfies the following properties: C1. User authentication; C2. Service provider server authentication; C3. Control server authentication; C4. Perfect forward security; C5. Freedom of password change; C6. Scalability of login; C7. Resistance to stolen verifier attacks; and C8. High efficiency.

Protections for E-Mail Stored Internet Service Provider's Server in Criminal Procedure

Protections for E-Mail Stored Internet Service Provider's Server in Criminal Procedure

A secure dynamic identity based authentication protocol for multi-server architecture

Most of the password based authentication protocols rely on single authentication server for the user's authentication. User's verification information stored on the single server is a main point of susceptibility and remains an attractive target for the attacker. In 2009, Hsiang and Shih improved Liao and Wang's dynamic identity based smart card authentication protocol for multi-server environment. However, we found that Hsiang and Shih's protocol is susceptible to replay attack, impersonation attack and stolen smart card attack. Moreover, the password change phase of Hsiang and Shih's protocol is incorrect. This paper presents a secure dynamic identity based authentication protocol for multi-server architecture using smart cards that resolves the aforementioned security flaws, while keeping the merits of Hsiang and Shih's protocol. It uses two-server paradigm in which different levels of trust are assigned to the servers and the user's verifier information is distributed between these two servers known as the service provider server and the control server. The service provider server is more exposed to the clients than the control server. The back-end control server is not directly accessible to the clients and thus it is less likely to be attacked. The user's smart card uses stored information in it and random nonce value to generate dynamic identity. The proposed protocol is practical and computationally efficient because only nonce, one-way hash functions and XOR operations are used in its implementation. It provides a secure method to change the user's password without the server's help. In e-commerce, the number of servers providing the services to the user is usually more than one and hence secure authentication protocols for multi-server environment are required.

Solving the startup problem in Western mobile Internet markets

This paper describes the evolution of the mobile Internet in terms of three concepts: the startup problem, standard setting, and mental models. Products in which there is little or no value to the first users due to the existence of strong direct (e.g., telephone) or indirect (complementary products) network effects face a large startup problem. This paper divides the startup problem for the mobile Internet into two stages. Japanese and later other service providers solved the first startup problem with entertainment content that was supported by a micro-payment system (service providers collect and pass on content fees to content providers) and custom phones that displayed this content in a consistent manner. Western service providers were slow to introduce micro-payment systems and entertainment content due to their initial focus on business users, which reflected their mental models. Mental models, which can also be thought of as shared beliefs or values, are typically based on historical experience as opposed to current knowledge of the environment and often prevent the development of new business models or new perceptions of foreign markets. Western service providers were slow to obtain phones that display content in a consistent manner because manufacturers were unable to agree on content and other standards in the wireless application protocol (WAP) Forum and subsequently have been slow to provide service providers with custom phones. Japanese service providers are the only ones to have solved the second startup problem with Internet mail that is modified for the small screens, slow speeds, and low processing power of phones (called “push-based Internet mail”) and non-entertainment sites that are formatted for the small screen of the phone and easily accessed via universal resource locators (URLs), which can get embedded in this mail. Push-based Internet mail is similar to short message services (SMS) except that it is perfectly compatible with the Internet. Like SMS, it is automatically “pushed” to phones after it arrives on a service provider's servers and it is restricted in size. The mail's arrival on the phone causes the phone to beep and display an icon on the screen. Users merely click on the icon to access the mail and it is not necessary for them to open their mail clients or browsers as most people do when they access mail on their personal computer (PC).Western service providers are now moving slowly to introduce “push-based Internet mail” and promote site access via URLs in order to avoid cannibalizing their SMS revenues; this also reflects their mental models.

A secure one-time password authentication scheme with low-computation for mobile communications

In recent years, m-commerce technology has been maturing. Various mobile devices are now designed to help users reach the servers of service providers and to process tasks such as stock trading, product purchasing, product information collecting, and so on. Once the services are only available to the members, authentication is applied to verify the identities of users. However, most current authentication methods used in m-commerce are designed for wired networks and require high computation costs, making them unsuitable for wireless environments.A one-time password authentication scheme that uses lighter computation and considers the limitations of mobile devices is proposed in this paper. Meanwhile, the proposed scheme is free from replay attacks, server spoofing attacks, off-line dictionary attacks, active attacks, and revelation of message contents.