• Title/Summary/Keyword: Group Key Renewal

Search Result 14, 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 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.

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.

An Efficient Group Key Management Scheme using Counting Bloom Filter in VANET (VANET에서 카운팅 블룸 필터를 사용한 효율적인 그룹 키 관리 기법)

  • Lee, SuYoun;Ahn, HyoBeom
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.47-52
    • /
    • 2013
  • VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks which is consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many fields. It provides traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. In VANET, it has been studies that group signature method for user privacy. However, among a group of group key generation phase and group key update phase, RSU(Road-Side Unit) and the computational overhead of the vehicle occur. In this paper, we propose an efficient group key management techniques with CBF(Counting Bloom Filter). Our group key management method is reduced to the computational overhead of RSU and vehicles at the group key generation and renewal stage. In addition, our method is a technique to update group key itself.

Determining Key Ecological Indicators for Urban Land Consolidation

  • Kuo-Liang Lin
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.513-524
    • /
    • 2009
  • Urban land consolidation, which is to reform land parcels to remove fragmentation and produce ideal blocks, is an effective means for urban renewal. Successful urban land consolidation brings out great benefits to the city officials as well as general public, such as improved city image, increased land value, and more effective land use. However, urban land consolidation can be detrimental to environment, especially in the ecological aspects, while the execution of land consolidation has been focused solely on development for the sake of human benefits. To remove negative effects of urban land consolidation to the ecological system, this paper is intended to establish a set of criteria for evaluating ecological impacts of an urban land consolidation plan. Firstly, key ecological indicators are identified using a special group decision-making process called "habitual domain analysis" and then individual weighting of each indicator is recorded by analytical hierarchy process. An urban ecological evaluation model with 4 levels and 23 indicators is thus developed.

  • PDF

A Multi-Level Access Control Scheme on Dynamic Multicast Services (동적 멀티캐스트 서비스상의 다단계 접근통제 기법)

  • 신동명;박희운;최용락
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.6
    • /
    • pp.47-58
    • /
    • 2002
  • The access control techniques, which can control unauthorized members to access to multicast service, have not been studied very often while there are a lot of on-going study on secure multicast architecture, multicast key distribution and sender authentication scheme have been studied. Multi level access control scheme in multicast can be used in a remote secure conference or to provide graduated multimedia services to each customers. In fact, multicast network has its own virtual networks according to different security levels. However, Early schemes are not effective when it protects unauthorized access in multi-access network environment. Furthermore this scheme does not provide us with hierarchical access control mechanism. This paper, therefore, proposes hierarchical access control scheme to provide the effectiveness in network layer by security level comparison. And we also suggests hierarchical key distribution scheme for multi level access control in application layer and effective hierarchical key renewal scheme in dynamic multicast environment which is easy to join and leaving the multicast group.

Role of neuropeptide Y in the bone marrow hematopoietic stem cell microenvironment

  • Park, Min Hee;Min, Woo-Kie;Jin, Hee Kyung;Bae, Jae-sung
    • BMB Reports
    • /
    • v.48 no.12
    • /
    • pp.645-646
    • /
    • 2015
  • The sympathetic nervous system (SNS) or neurotransmitters in the bone marrow microenvironment has been known to regulate hematopoietic stem cell (HSC) functions such as self-renewal, proliferation and differentiation. However, the specific role of neuropeptide Y (NPY) in this process remains relatively unexplored. In this study, we demonstrated that NPY deficient mice have significantly reduced HSC numbers and impaired bone marrow regeneration due to apoptotic destruction of SNS fibers and/or endothelial cells. Moreover, NPY treatment prevented bone marrow impairments in a mouse model of chemotherapy-induced SNS injury, while conditional knockout mice lacking the Y1 receptor in macrophages did not restore bone marrow dysfunction in spite of NPY injection. Transforming growth factor-beta (TGF-β) secreted by NPY-mediated Y1 receptor stimulation in macrophages plays a key role in neuroprotection and HSC survival in the bone marrow. Therefore, this study reveals a new role of NPY in bone marrow HSC microenvironment, and provides an insight into the therapeutic application of this neuropeptide.

Classification of Metro Station Areas Using Multi-Source Big Data: Case Studies in Beijing

  • Shuo Chen;Xiangyu Li
    • International Journal of High-Rise Buildings
    • /
    • v.12 no.1
    • /
    • pp.63-74
    • /
    • 2023
  • Large-capacity public transportation systems, represented by urban metro lines, are the key to alleviating the significant increase in urbanization and motorization in China. But to improve the agglomeration effect of metro stations in a more accurate and targeted way requires scientific evaluation and classification of the surrounding areas of metro stations. As spatial and functional design are the core factors for urban renewal design, this study took Beijing as an example, using multi-source data to evaluate the morphology and functional composition surrounding areas of metro stations, and the Boston Consulting Group (BCG) matrix was used to classify and characterize each type of surrounding areas from morphological-functional dimensions. It shows a negative correlation of the mix-use index with the floor area ratio, and only about 20% of the areas achieve the ideal situation of high construction intensity with high mix-use diversity. Hoping to provide a reference for city managers and designers in dealing with the surrounding metro stations with different construction intensities in a more precise way.

A Resilient Key Renewal Scheme in Wireless Sensor Networks (센서 네트워크에서 복원력을 지닌 키갱신 방안)

  • Wang, Gi-Cheol;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.2
    • /
    • pp.103-112
    • /
    • 2010
  • In sensor networks, because sensors are deployed in an unprotected environment, they are prone to be targets of compromise attack, If the number of compromised nodes increases considerably, the key management in the network is paralyzed. In particular, compromise of Cluster Heads (CHs) in clustered sensor networks is much more threatening than that of normalsensors. Recently, rekeying schemes which update the exposed keys using the keys unknown to the compromised nodes are emerging. However, they cause some security and efficiency problems such as single group key employment in a cluster, passive eviction of compromised nodes, and excessive communication and computation overhead. In this paper, we present a proactive rekeying scheme using renewals of duster organization for clustered sensor networks. In the proposed scheme, each sensor establishes individual keys with neighbors at network boot-up time, and these keys are employed for later transmissions between sensors and their CH. By the periodic cluster reorganization, the compromised nodes are expelled from network and the individual keys employed in a cluster are changed continuously. Besides, newly elected CHs securely agree a key with sink by informing their members to sink, without exchangingany keying materials. The simulation results shows that the proposed scheme remarkably improves the confidentiality and integrity of data in spite of the increase of compromised nodes. Also, they show that the proposed scheme exploits the precious energy resource more efficiently than SHELL.