• Title/Summary/Keyword: Communication message

Search Result 1,629, Processing Time 0.038 seconds

Client-Side Deduplication to Enhance Security and Reduce Communication Costs

  • Kim, Keonwoo;Youn, Taek-Young;Jho, Nam-Su;Chang, Ku-Young
    • ETRI Journal
    • /
    • v.39 no.1
    • /
    • pp.116-123
    • /
    • 2017
  • Message-locked encryption (MLE) is a widespread cryptographic primitive that enables the deduplication of encrypted data stored within the cloud. Practical client-side contributions of MLE, however, are vulnerable to a poison attack, and server-side MLE schemes require large bandwidth consumption. In this paper, we propose a new client-side secure deduplication method that prevents a poison attack, reduces the amount of traffic to be transmitted over a network, and requires fewer cryptographic operations to execute the protocol. The proposed primitive was analyzed in terms of security, communication costs, and computational requirements. We also compared our proposal with existing MLE schemes.

An Emotional Communication System Using Emotion Recognition of Users (사용자의 감성인식을 통한 감성통신 시스템)

  • Cho, Myeon-gyun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.6 no.4
    • /
    • pp.201-207
    • /
    • 2011
  • This paper introduces a novel concept of 'Emotional Communication' for future smart phone. While traditional information based communication technologies focus on how to precisely transmit the content of message, emotional communication is intended to support and augment social relationship among people and to comfort the user to be happy. In this paper, we propose future communication services and core technologies which can estimate emotional desire of users and respond to the desire to be happy with connectedness and consolation from peoples. Firstly, we introduce emotion recognition techniques to estimate emotional desire of users. At second, the emotional responding services are categorized to four parts and the details are shown. Lastly we propose the process to implement emotional communication system and the main techniques to fulfill the system requirements for future smart-phone services.

A study on the receiving rate of the data of the hybrid communication system using data transfer methods for controller system of navigational aids (데이터 전송방식에 따른 항로표지 관리용 하이브리드 통신 시스템의 수신율 분석에 관한 연구)

  • Jeon, Joong Sung
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.38 no.1
    • /
    • pp.78-85
    • /
    • 2014
  • The Mu-communication board supported by hybrid communication is designed with Cortex M3, which is a low power energy consumption 32-bit microcontroller. The Cortex M3 microcontroller has UART(Universal asynchronous receiver/transmitter) ports which can set appropriately using the command line interpreter (CLI) program with each port. URAT ports are used for hybrid communication modems, GPS modules, etc. When the socket type was compared with the short message service type, the socket type was proven to be better. By improving the receiving performance in the control and management system of the AtoN, data loss was minimized. During the testing of the socket and SMS, data was collected from each buoy for 12 hours every 1 minute and the receiving rate of the data was found to be more than 98.58 % and 99.42 % respectively.

Improved Mobility Management and Multicast Protocols for Mobile Hosts (이동 호스트를 위한 개선된 이동성 관리 및 멀티캐스트 프로토콜)

  • Cha, Yeong-Hwan;Seong, Hyeon-Gyeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.1
    • /
    • pp.81-94
    • /
    • 1995
  • By intergrating technologies for protable computers, radio communications, and computer networking, the Land Mobile Computer Network(LMCN) is supposed to overcome the time and space limitation of present computer communication network. However, because the MHs(mobile hosts) do move any time, the network connectivity is often changed causing temporarily duplicated lost, or out-of-sequenced message delivery as well as frequent communications for maintainning the network connectivity. Previous works solved the problems through message flooding, used also in multicasting, resulting in high communication cost(i.e., number of communication messages). In this paper, new protocols for efficient mobility management and multicasting are proposed. The protocols define location update, handover, and multicasting procedure of a MH over a hierarchical LMCN architecture. The protocol specification is presented, and it is shown that the communication cost of the new protocols is superior to the existing ones in terms of the communication cost.

  • PDF

A Java Group Communication System supporting Extended Virtual Synchrony (Extended Virtual Synchrony를 지원하는 자바 그룹통신 시스템)

  • 문남두;이명준
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.37-48
    • /
    • 2004
  • Important Java network application services have been rapidly increased along with the growth of the Internet. So, it is desirable for such applications to serve transparently, continuously and safely even if the network is temporally partitioned or certain hosts running those services are crashed down. To satisfy such requirements, many group communication systems have been developed. However, existing Java-based group communication systems do not support both the extended virtual synchrony and various types of message delivery such as FIFO, causal, total and safe delivery service. In this paper, we present the design and implementation of a Java group communication system, named JACE, supporting various types of message delivery between group members and the extended virtual synchrony model. The JACE system consists of a number of protocol modules which can be stacked on top of each other in a variety of ways. In addition, using the JACE system, we have developed an experimental UDDI registry for discovering and publishing information about Web services.

DEVS 형식론을 이용한 다중프로세서 운영체제의 모델링 및 성능평가

  • 홍준성
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1994.10a
    • /
    • pp.32-32
    • /
    • 1994
  • In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

  • PDF

Factory environmental management system based on MQTT using LoRa (LoRa망을 이용한 MQTT기반의 공장 환경 관리 시스템)

  • Ko, Jae-wook;Kim, Hye-Jeong;Lee, Bo-Kyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.83-90
    • /
    • 2018
  • LoRa (Long Range) is a long-distance, low-power communication technology. Broader range of communication than NFC technology allows communication without having to install multiple APs and reduces the cost of initial infrastructure deployment. MQTT (Message, Queuing, Telemetry, Transport) protocol is also low power and lightweight protocols. It can increase module persistence and reduce maintenance costs when used with LoRa. In this paper, we developed a system for compiling various environmental information in a factory using LoRa and MQTT. Environmental sensor data from long distances can be monitored by the management system and the facilities in each workshop can be controlled. Performance tests have also shown that the use of LoRa and MQTT is effective in terms of long-distance and power consumption.

A Message Authentication and Key Distribution Mechanism Secure Against CAN bus Attack (CAN 버스 공격에 안전한 메시지 인증 및 키 분배 메커니즘)

  • Cho, A-Ram;Jo, Hyo Jin;Woo, Samuel;Son, Young Dong;Lee, Dong Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.5
    • /
    • pp.1057-1068
    • /
    • 2012
  • According to advance on vehicle technology, many kinds of ECU(Electronic Control Unit) are equipped inside the vehicle. In-vehicle communication among ECUs is performed through CAN(Controller Area Networks). CAN have high reliability. However, it has many vulnerabilities because there is not any security mechanism for CAN. Recently, many papers proposed attacks of in-vehicle communication by using these vulnerabilities. In this paper, we propose an wireless attack model using a mobile radio communication network. We propose a secure authentication mechanism for in-vehicle network communication that assure confidentiality and integrity of data packets and also protect in-vehicle communication from the replay attack.

A Two-Way Communication Method for Smart Phone Integrated with Pager (무선호출기를 갖는 다기능 전화기의 양방향 통신방법)

  • 유장희;박태준
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.487-490
    • /
    • 1998
  • In this paper, we describe a method for two-way communication service for smart phone integrated with pager which receive various kinds of Internet service information and pushes this information into smart phone to make it available for Internet assess. In this method, the server can push the status data of message boxes into the smart phone and it makes connection to the server automatically. The proposed method will make it possible to manage and excange the information and resources in an efficient manner during idle time, and will provide the potential capabilities of developing a variety of new Internet services for the system.

  • PDF

APPLICATION OF $(\upsilon,\kappa,\lambda)$-CONFIGURATION TO GENERATION OF A CONFERENCE KEY

  • Chung, Il-Yong
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.2
    • /
    • pp.531-537
    • /
    • 2001
  • In order for all participants at video conference to communicate mutually, the conference key should be necessary. In this paper, we present the communication protocol that generates a conference key efficiently based on $(\upsilon,\kappa,\lambda)$-configuration, one class of block designs, which minimizes message transmission overhead needed for this key. Especially, in the case of ${\lambda}=1$, the protocol requires only $O(\sqrt[v]{v})$ messages, where v is the number of participants.