• Title/Summary/Keyword: agreement protocols

Search Result 115, Processing Time 0.027 seconds

Group Key Agreement for Mobile Devices in Different Cells (서로 다른 셀의 모바일 장치간의 그룹키 동의 프로토콜)

  • Kim Jeeyeon;Choi Yeonyi;Kim Seungjoo;Won Dongho
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.651-658
    • /
    • 2005
  • Mobile communication has become more pervasive and it is considered as one of main concerns oi conferencing, multi-user games and etc. in mobile environment. These applications need to secure communication in group. Most of the published protocols are based on model which consists of a stationary base station and a cluster of mobile devices. In this paper, we have focused on the extended model of which participants are several base stations and mobile devices in different cells. We present a new group key protocol among mobile devices in different cells and analyze its security And we also look at how password authentication can be used to our group key agreement protocol. The mobile device's computing load may be reduced by using password authentication.

Guidelines for Transcatheter Aortic Valve Replacement in Korea: Past Obstacles and Future Perspectives

  • Choo, Suk Jung;Shinn, Sung Ho;Kim, Kyung Hwan;Kim, Wook Sung;Oh, Sam-Sae;Lee, Sak
    • Journal of Chest Surgery
    • /
    • v.51 no.4
    • /
    • pp.231-240
    • /
    • 2018
  • Background: Analyses of the efficacy and safety of transcatheter aortic valve replacement (TAVR) in most countries have been based on outcomes obtained in accordance with national practice guidelines and monitoring protocols. The purpose of this study is to share our experience regarding the process for establishing guidelines and monitoring protocols for the use of TAVR in Korea, in the hopes that it may be helpful to others undergoing a similar process in their own country. Methods: The Korean guidelines for TAVR were established on June 1, 2015 in through a tri-party agreement involving the Department of Health and Welfare, the Korean Society of Thoracic and Cardiovascular Surgery and the Korean Society of Cardiology. We agreed to monitor the guidelines transparently and to exchange opinions regarding amendments or continuation of its contents after 3 years of monitoring. Results: The monitoring meetings were not held as regularly as agreed, and monitoring was also made difficult by insufficient and incomplete data. Nevertheless, during the meetings, measures to improve the monitoring process were discussed, and accordingly, an agreement was made to continue the monitoring process, with the aim of completing data collection by 2018. Conclusion: Compliance with guidelines is critical for assessing the efficacy and safety of TAVR. Moreover, the TAVR monitoring process must be properly conducted for an accurate evaluation to be made. Any country planning to introduce TAVR may encounter difficulties with regards to the optimal initiation strategy and subsequent monitoring. Nevertheless, continued efforts should be made to persuade the government and the corresponding medical societies to facilitate the optimal application of TAVR.

Tree-based Group Key Agreement Protocol using Pairing (Pairing을 이용한 트리 기반 그룹키 합의 프로토콜)

  • 이상원;천정희;김용대
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.3
    • /
    • pp.101-110
    • /
    • 2003
  • Secure and reliable group communication is an increasingly active research area prompted by the growing popularity of many types of group-oriented and collaborative applications. The central challenge is secure and efficient group key management. While centralized methods are often appropriate for key distribution in large multicast-style groups, many collaborative group settings require distributed key agreement techniques. Most of prior group key agreement protocols have been focused on reducing the computational costs. One exception is STR protocol that optimizes communicational cost. On the other hand, it requires O(n) number of modular exponentiations. In this paper, we propose a new group key agreement protocol that modifies STR protocol by utilizing pairing based cryptography. The resulting protocol reduces computational cost of STR protocol while preserving the communication cost.

Secure Routing Protocol in Cluster-Based Ad Hoc Networks (클러스터 기반 애드혹 네트워크 환경에서의 보안 라우팅 프로토콜)

  • Min, Sung-Geun;Park, Yo-Han;Park, Young-Ho;Moon, Sang-Jae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.12
    • /
    • pp.1256-1262
    • /
    • 2012
  • Mobile ad hoc networks (MANETs) are infrastructure-less, autonomous, and stand-alone wireless networks with dynamic topologies. Recently, cluster-based ad hoc networks which enhance the security and efficiency of ad hoc networks are being actively researched. And routing protocols for cluster-based ad hoc networks are also studied. However, there are few studies about secure routing protocols in cluster-based ad hoc networks. In this paper, we propose secure routing protocol for cluster-based ad hoc networks. We use Diffie-Hellman key agreement, HMAC, and digital signature to support integrity of routing messages, and finally can perform secure routing.

Simulation of lesion-to-liver contrast difference curves in Dynamic Hepatic CT with Pharmacokinetic Compartment Modeling (Pharmacokinetic Compartment Modeling을 이용한 나선식 CT 에서의 간암-간 대조 곡선의 Simulation)

  • Kim, S.J.;Lee, K.H.;Kim, J.H.;Min, B.G.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1998 no.11
    • /
    • pp.271-272
    • /
    • 1998
  • Contrast-enhanced CT has an important role in the assessment of liver lesions. However, the optimal protocol to get most effective result is not clear. The main principle for deciding injection protocol is to optimize lesion detectability by rapid scanning when lesion-to-liver contrast is maximum. For this purpose, we developed a physiological model of contrast medium enhancement based on the compartment modeling and pharmacokinetics. Blood supply to liver was modeled in two paths. This dual supply character distinguishes the CT enhancement of liver from that of the other organs. The first path is by hepatic artery and the second is by portal vein. It is assumed that only hepatic artery can supply blood to hepatocellular carcinoma (HCC) compartment. It is known that this causes the difference of contrast enhancement between normal liver tissue and hepatic tumor. By solving differential equations for each compartment simultaneously using computer program Matlab, CT contrast-enhancement curves were simulated. Simulated enhancement curves for aortic, hepatic, portal vein, and HCC compartments were compared with mean enhancement curves from 24 patients exposed to the same protocols as simulation. These enhancement curves were in a good agreement. Furthermore, we simulated lesion-to-liver curves for various injection protocols, and analyzed the effects. These may help to optimize the scanning protocols for good diagnosis.

  • PDF

The Crucial Role of the Establishment of Computed Tomography Density Conversion Tables for Treating Brain or Head/Neck Tumors

  • Yang, Shu-Chin;Lo, Su-Hua;Shie, Li-Tsuen;Lee, Sung-Wei;Ho, Sheng-Yow
    • Progress in Medical Physics
    • /
    • v.32 no.3
    • /
    • pp.59-69
    • /
    • 2021
  • Purpose: The relationship between computed tomography (CT) number and electron density (ED) has been investigated in previous studies. However, the role of these measures for guiding cancer treatment remains unclear. Methods: The CT number was plotted against ED for different imaging protocols. The CT number was imported into ED tables for the Pinnacle treatment planning system (TPS) and was used to determine the effect on dose calculations. Conversion tables for radiation dose calculations were generated and subsequently monitored using a dosimeter to determine the effect of different CT scanning protocols and treatment sites. These tables were used to retrospectively recalculate the radiation therapy plans for 41 patients after an incorrect scanning protocol was inadvertently used. The gamma index was further used to assess the dose distribution, percentage dose difference (DD), and distance-to-agreement (DTA). Results: For densities <1.1 g/cm3, the standard deviation of the CT number was ±0.6% and the greatest variation was noted for brain protocol conditions. For densities >1.1 g/cm3, the standard deviation of the CT number was ±21.2% and the greatest variation occurred for the tube voltage and head and neck (H&N) protocol conditions. These findings suggest that the factors most affecting the CT number are the tube voltage and treatment site (brain and H&N). Gamma index analyses for the 41 retrospective clinical cases, as well as brain metastases and H&N tumors, showed gamma passing rates >90% and <90% for the passing criterion of 2%/2 and 1%/1 mm, respectively. Conclusions: The CT protocol should be carefully decided for TPS. The correct protocol should be used for the corresponding TPS based on the treatment site because this especially affects the dose distribution for brain metastases and H&N tumor recognition. Such steps could help reduce systematic errors.

Policy-Based QoS Management for SLA-Driven Adaptive Routing

  • Katsikogiannis, George;Mitropoulos, Sarandis;Douligeris, Christos
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.301-311
    • /
    • 2013
  • This paper proposes a policy-based quality of service (QoS) management framework for adaptive routing decisions. We present an approach considering interior gateway protocol (IGP) for path discovery mechanisms and QoS-aware policies for configuring the network elements. The integration of the aforementioned modules into this policy-based network management (PBNM) system is demonstrated by conducting experiments in a real environment, the hellenic public administration network SYZEFXIS. These experiments combine different traffic conditioning mechanisms through event detectors, consider IP service level agreement mechanisms that interoperate with the PBNM system and analyze the enforcement of IGP and QoS policies. Finally, validation and measurement tools are used to prove the efficiency of this framework. It is shown that this architecture offers significantly increased performance and learning capabilities, while the PBNM system achieves adaptive QoS routing through automated configuration considering the avoidance of suboptimal routing issues or under-performance conditions of the network entities.

Task Reallocation in Multi-agent Systems Based on Vickrey Auctioning (Vickrey 경매에 기초한 다중 에이전트 시스템에서의 작업 재할당)

  • Kim, In-Cheol
    • The KIPS Transactions:PartB
    • /
    • v.8B no.6
    • /
    • pp.601-608
    • /
    • 2001
  • The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

  • PDF

A Study on the TCP Supporting Optional Encryption (선택적인 암호화를 지원하는 TCP에 관한 연구)

  • Seong, Jeong-gi;Seo, Hye-in;Kim, Eun-gi
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.565-568
    • /
    • 2017
  • The security protocols such as SSH and SSL/TLS operate over TCP and encrypt all data from the application layer. However, this method has unnecessary performance degradation because it encrypts even data which does not require confidentiality. In this paper, we propose TCP OENC(TCP Optional Encryption) which optionally encrypts only confidential data by the application user. The proposed TCP OENC is in accordance with TCP standard operation, and it operates if application user demand on encrypting data. Before the TCP OENC sends first encrypted data, performs the key agreement, and then encrypts and sends data which application user is desired by using shared key obtained from the key agreement.

  • PDF

GROUP SECRET KEY GENERATION FOR 5G Networks

  • Allam, Ali M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.4041-4059
    • /
    • 2019
  • Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research. While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature. This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them. I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature. Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology. Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively. I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.