• Title/Summary/Keyword: Key Renewal

Search Result 71, Processing Time 0.024 seconds

An Efficient Renewal Mechanism of Group Key Employing the Fiat-Shamir Method on Mobile Communications

  • Tak, Dong-Gil;Lee, Yeo-Jin;Lee, Jae-Hoon;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1649-1656
    • /
    • 2006
  • Renewal of the group key on the mobile communication needs it can be not re-shared by all members of the group with the exception of excluded members but also prevented from making a fraudulent use of group key due to leakage of security information for terminal. In this paper, we propose an efficient renewal mechanism of group key in order for all members of the group to be able to get digital information and to perform the renewal of group key employing the Fiat-Shamir method. It can guarantee the security of a group key since a terminal renews a group key by using security information of an excluded terminal and the previous group key.

  • PDF

A Efficient Key Generation and Renewal for Broadcast Encryption (브로드캐스트 암호화에서의 효율적인 키 생성과 갱신 방법)

  • Lee, Deok-Gyu;Lee, Im-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.149-156
    • /
    • 2004
  • Broadcast encryption schemes are applied to transmit digital informations of multimedia, software, Pay-TV etc. in public network. Important thing is that only user who is permitted before only must be able to get digital information in broadcast encryption schemes. If broadcast message transfers, users who authority is get digital information to use private key given in the advance by oneself. Thus, user acquires message or session key to use key that broadcaster transmits, broadcaster need process that generation and distribution key in these process. Also, user secession new when join efficient key renewal need. In this paper, introduce about efficient key generation and distribution, key renewal method. Take advantage of two technique of proposal system. One is method that server creates key forecasting user without user's agreement, and another is method that server and user agree each other and create key Advantage of two proposal system because uses a secret key broadcast message decryption do can and renewal is available effectively using one information whatever key renewal later.

A Renewal Mechanism of Group Key on Digital Mobile Communication Employing the Fiat-shamir Method (Fiat-Shamir 방식을 적용한 디지털 모바일 통신 그룹키 갱신 메카니즘)

  • Tak, Dong-Kil;Chung, Il-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.3
    • /
    • pp.571-578
    • /
    • 2006
  • To renew the group key securing on the mobile communication needs that it can be not oかy re-shared by all members of the group with the exception of members excluded but also prevented from making a fraudulent use of a terminal's registered key because of a leakage of information from the loss of terminal. In this paper, we propose an efficient renewal mechanism of group key in order for all members of the group to be able to get digital information and to perform the renewal of group key in a small-scale conference employing the Fiat-Shamir method. It can guarantee the security of terminals, since a terminal generates security information needed for key renewal, and then renews the group key for mutual communication.

The Design of Security Protocol for An Efficient Distribution and Renewal Method of Group Key (효율적인 그룹키 분배 및 갱신을 위한 보안 프로토콜의 설계)

  • O, Myeong-Uk;Kim, Seong-Yeol;Bae, Yong-Geun;Jeong, Il-Yong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.3
    • /
    • pp.331-336
    • /
    • 2002
  • In this paper, we propose a new distribution and renewal scheme for a group key suitable for secure mobile communications based on identification protocol, in which all members of the group can reshare the new group common key except revoked members by using a key distribution center (a trusted center). The security of this scheme is based on the difficulty of the discrete logarithm problem. The proposed scheme can be appropriately managed in case that terminal's capability of storage and computing power is relatively small and more than one caller are revoked. It also renews a group key easily when the center changes this key intervally for security.

An Efficient Key Distribution for Broadcast Encryption at Embedded Computing Environment (임베디드 컴퓨팅 환경에서 브로드캐스트 암호화를 위한 효율적인 키 분배)

  • Lee, Deok-Gyu;Kim, Tai-Hoon;Yeo, Sang-Soo;Kim, Seok-Soo;Park, Gil-Cheol;Cho, Seong-Eon
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.1
    • /
    • pp.34-45
    • /
    • 2008
  • Broadcast encryption schemes are applied to transmit digital informations of multimedia, software, Pay-TV etc. in public network. User acquires message or session key to use key that broadcaster transmits, broadcaster need process that generation and distribution key in these process. Also, user secession new when join efficient key renewal need. In this paper, introduce about efficient key generation and distribution, key renewal method. The temporary conference environment base structure against an each mobile device wild gap. Without the transmission possible, it follows infrequent location change and with the quality where the key information change flow. Thus, in this paper, in order to apply to the embedded computing environment and the key generation and the efficient key renewal are done when the mobile device is used of the specify space it proposes.

  • PDF

INTEGRATED PERFORMANCE MANAGEMENT FOR WHOLE PHASES OF URBAN RENEWAL MEGAPROJECTS

  • Heedae Park;Kang-Wook Lee;Seung Heon Han
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1463-1467
    • /
    • 2009
  • Construction projects are vulnerable to diverse internal and external factors, requiring systematic and consistent performance management along the entire life cycle of a project. In particular, urban renewal projects have a range of performance measures, including policy reconciliation and permits, project development, project financing, design, construction, and occupancy and maintenance. This requires a program-level megaproject approach, which integrates each stage of a project as well as variety of stakeholders' interests in pursuing a project from different perspectives. However, previous research on performance management has focused especially on the limited scopes of factors, including cost, quality, and schedule at the project level or on financial factors at the firm level. Given the lack of current approaches, this study suggests an integrated and systematic performance management scheme to control urban renewal megaprojects at the broadened perspectives of the program level. To this end, this study adopts the balanced scorecard approach and elicits key performance indices associated with various project configurations. Finally, an algorithm is presented for quantitatively assessing the level of performances along whole life cycle of urban renewal megaprojects.

  • PDF

A Study On the Renewal System of Domestic High Definition Maps (우리나라 정밀도로지도의 갱신체계에 관한 연구)

  • SEOL, Jae-Hyuk;LEE, Won-Jong;CHOI, Yun-Soo;JEONG, In-Hun
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.22 no.3
    • /
    • pp.133-145
    • /
    • 2019
  • Building and researching high definition maps that support autonomous vehicles, one of Korea's key challenges for the future, are being actively propelled in both private and government sectors with the goal of fast commercialization. Under this perspective, update methods that secure up-to-date information are emerging as key tasks. To provide a plan for establishing efficient renewal systems for high definition maps, we analyzed the present condition of road types, causes of road changes and its annual change rates, and examined where and how such road change information is managed. Furthermore, the method of collection and detection of road change information and the renewal system of high definition maps are defined based on the current study. At the end of the paper, a step-by-step renewal system is proposed through the examination of renewal cycles, contents, and region of high definition maps.

Secret Group Key Re-sharing Method Suitable for Digital Mobile Communication (디지털 이동통신 시스템에 적합한 그룹 공유키 경신 방식)

  • 심주걸
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.3
    • /
    • pp.69-76
    • /
    • 2000
  • In this paper we propose a new group key renewal scheme suitable for secure mobile communications in which all members of the group can re-share the new group common key excepted a revoked member using a key distribution center(a trusted center). A renewal group key in the proposed scheme can be shared many times using pre-distributed data by a smart card without a preparation stage. This scheme is also avaliable for a large group network because the transmitted data amount after identifying the revoked member does not depend on a size of group. The secuirty of this scheme is based on the difficulty of the discrete logarithm problem.

Analysing the Combined Kerberos Timed Authentication Protocol and Frequent Key Renewal Using CSP and Rank Functions

  • Kirsal-Ever, Yoney;Eneh, Agozie;Gemikonakli, Orhan;Mostarda, Leonardo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4604-4623
    • /
    • 2014
  • Authentication mechanisms coupled with strong encryption techniques are used for network security purposes; however, given sufficient time, well-equipped intruders are successful for compromising system security. The authentication protocols often fail when they are analysed critically. Formal approaches have emerged to analyse protocol failures. In this study, Communicating Sequential Processes (CSP) which is an abstract language designed especially for the description of communication patterns is employed. Rank functions are also used for verification and analysis which are helpful to establish that some critical information is not available to the intruder. In order to establish this, by assigning a value or rank to each critical information, it is shown that all the critical information that can be generated within the network have a particular characterizing property. This paper presents an application of rank functions approach to an authentication protocol that combines delaying the decryption process with timed authentication while keys are dynamically renewed under pseudo-secure situations. The analysis and verification of authentication properties and results are presented and discussed.

A Study on Exploring Urban Renewal Areas Using Spatial Density Analysis (공간 밀도분석을 이용한 재정비 대상지 탐색에 관한 연구)

  • Kijung Kim;Seungwook Go;Jinuk Sung
    • Land and Housing Review
    • /
    • v.14 no.2
    • /
    • pp.35-50
    • /
    • 2023
  • The purpose of this study is to identify areas in need of urban renewal by utilizing spatial data and analyzing their types and characteristics. For this, this research employed a kernel density function and K-means cluster analysis with spatial data, through which it sought ways to identify high-demand areas for urban renewal projects. The key findings and implications of the research are summarized as follows. Firstly, this research classified 587 target sites in Seoul based on development density (ratios) and an indicator for aged buildings. Approximately half of these areas were consistent with leading pilot project sites and Accelerated Integration Sites. Secondly, it was observed that residential environments in the designated leading pilot project sites, as decided by public sectors, were relatively poor compared to other areas. Lastly, the target areas for urban renewal were not clearly categorized through statistical analysis. Instead, it was found that categorization should be made depending on the requirements of each project.