• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.799-801
• /
• 2005

There have been many streaming servers that provide a large number of contents for a user's preference. General purpose streaming sewer makes use of a RTSP protocol for streaming controls such as message passing with client players. To date, there has been minimal research regarding streaming server's performance test tools. For measuring streaming server's performance, performance evaluation technique is needed and also achieved by RTSP based controls, a server's performance result and its miscellaneous test tools such the PseudoPlayer for pumping data to a specified port and the PseudoMonitor for gathering information. In this paper, We implement a test toolkit for evaluating a streaming server's performance and show the case of its application

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.5
• /
• pp.19-32
• /
• 2009

In this paper, we design thin-client framework capable of application sharing & data access on the Internet, and apply related skills, such as X windows system, pseudo server, CODA file system, MPI(Message Passing Interface). We suggest a framework for the thin client to access data produced by working on a server optimally as well as to run server side application, even in the case of network down. Additionally, it needed to reflect all local computing changes to remote server when network is restored. To design thin client framework with these characteristics, in this paper, we apply distributed pseudo server and CODA file system to our framework, also utilize MPI for the purpose of more efficient computing & management. It allows for implementation of network independent computing environment of thin client, also provide scalable application service to numerous user through the elimination of bottleneck on caused by server overload. In this paper, we discuss the implementing method of thin client framework in detail.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.6
• /
• pp.73-79
• /
• 2020

Nowadays, with the rapid spread of streaming services in the internet world, security vulnerabilities are also increasing rapidly. For streaming security, this paper proposes a PN(pseudo-random noise) distributed structure-based security processor for web streaming contents(SP-WSC). The proposed SP-WSC is basically a PN distributed code algorithm designed for web streaming characteristics, so it can secure various multimedia contents. The proposed SP-WSC is independent of the security vulnerability of the web server. Therefore, SP-WSC can work regardless of the vulnerability of the web server. That is, the SP-WSC protects the multimedia contents by increasing the defense against external unauthorized signals. Incidentally it also suggests way to reduce buffering due to traffic overload.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.909-916
• /
• 2013

Since realization of E-voting system expands participation of voters and efficient count of voting, political and social and technical revolution is possible. However, without secure e-voting system, practical usages are infeasible. In the paper, we propose an e-voting system which is able to open votes in server without decryption during midst process using EC-ELGAMAL homomorphic cryptography. Users ensure anonymity with pseudo id from server and check their voting with Bloom Filter technology. Furthermore, we combine attributes and voters' information, so we can collect information of voter under the condition of anonymity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.719-721
• /
• 2010

VoIP over MANET is an important IP phone technique used in mobile ad-hoc networks. VoIP system over wired networks is based on SIP, SIP UA and SIP server which process the users invite, register and so on. Since no base stations in MANETs to perform as SIP servers, VoIP service on MANETs is being done with tiny SIP server which is done on each node. In this paper, VoIP system is implemented with pseudo SIP server which can process 1 call based on modification of standard SIP server which is used on communication environment such as wired networks. The propesed system is performed well and compatible with SIP and SIP UA.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.649-651
• /
• 1999

본 논문에서는 각종 암호계에 중요하게 이용되는 난수를 클라이언트-서버 환경에서 생성하는 방법에 대해 연구하였다. 완벽하게 랜덤으로 생성되는 난수를 만든다는 것은 불가능하므로, 난수를 발생시키는 알고리즘의 목표는, 입수할 수 있는 정보만으로는 예측 불가능한 랜덤성을 가지는 것이다. 여기서는 클라이언트-서버 환경의 특징을 이용해 돌연변이를 만들어 좀 더 강한 랜덤성을 지니는 난수의 생성을 조합 시프트 레지스터를 이용해 연구하였다.

• Journal of Digital Contents Society
• /
• v.10 no.4
• /
• pp.509-520
• /
• 2009

The advancement of network & application technology causes a major change for the use of IT(Information Technology) equipment, including computer and mobile system. In the process from beginning with main frame in the 1960s and 70's, through the server-client paradigm in the 1980s and toward the development of network computer since 90's, computer systems are now evolutioning from isolated physical system to complementary network based virtual system[1][2]. In network based computer system, application and data required for operation are stored at not client as local system, but at server[1]. User can use application & data on a server as if those are on a local client, and a client is now toward a developing thin and network friendly system. In this paper, we discuss possible ways for the efficient implementation of thin-client. For the use of remote application & data as if in local environment, we make use of X protocol. Unlike formal simple Client - Server paradigm, we design a Proxy for middle-tier server for the improvement of QoS and session persistence. X server, Xvfb(X virtual frame buffer) are implemented on thin client and Server, respectively and we applied XSMP(X Session Management Protocol) to our framework for session management. In the end, beyond simple transfer of server display, we suggest thin client framework for the transfter of remote server application over internet.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1653-1660
• /
• 2010

The user information stored in database have been leaked frequently. To protect information against malevolent manager on the inside or outside aggressor, it is one of the most efficient way to encrypt information and store to database. It is better to destruct information than not to use encrypted information stored in database. The encrypted database search system is developed variously, and used widely in many fields. In this paper, we implemented the scheme that can search encrypted document without exposing user's information to the untrusted server in mobile device. We compared and analyzed the result embodied with DES, AES, and ARIA based on symmetric key by searching time.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.71-76
• /
• 2004

In this paper, a web-based automatic transcription component is designed and implemented for mechanical conversion of revised Korean-to-Romanization notation rule. Specially. we proposes system architecture and algorithms that transcript Korean to Roman automatically after transliterate Korean to phonetic symbol applying phonological principles. The components operate under the web server's script mechanism. and the dictionary for exceptional usage is designed as an accessorial function supported either operating at web server internally or externally. The overall system architecture is presented by UML. specification and pseudo code. The proposed architecture can be implemented in encapsulated service by object oriented component and that can be easily adapted and modified on the internet environment and this system may have many advantages to improve efficiency, library reuse. extensibility at software development.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.10-14
• /
• 2012

When tag privacy is required in radio frequency identification (ID) system, a reader needs to identify, and optionally authenticate, a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction, whose cost gets larger when the number of tags increases. In this paper, we suggest a simple and efficient identification technique that reduces readers computation to $O$(${\sqrt{N}}$ log$N$) without increasing communication cost. Our technique is based on the well-known "meet-in-the-middle" strategy used in the past to attack symmetric ciphers.