• Title/Summary/Keyword: End-to-end security

Search Result 708, Processing Time 0.049 seconds

Web Service Management and Security for On Demand Computing (End-to-end Web Service 관리 및 보안)

  • 이중원
    • Proceedings of the CALSEC Conference
    • /
    • 2004.02a
    • /
    • pp.51-55
    • /
    • 2004
  • ·Web Service 적용 -비용절감/새로운 Revenue 창출 기회 ·Business 환경 -SOA(서비스기반구조), 온디맨드, 그리드 컴퓨팅의 기반→Web Service로의 이행 가속화 ·IT Challenge -복잡성과 위험 ·관리 솔루션 -전반적인 관리 요구 -인프라 & Web Service 레벨 ·Web Service 관리 기대 효과 -효율성, 일관성 및 안전성 제공 -근본 원인 분석 기반 제공

  • PDF

Which country's end devices are most sharing vulnerabilities in East Asia? (거시적인 관점에서 바라본 취약점 공유 정도를 측정하는 방법에 대한 연구)

  • Kim, Kwangwon;Won, Yoon Ji
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.5
    • /
    • pp.1281-1291
    • /
    • 2015
  • Compared to the past, people can control end devices via open channel. Although this open channel provides convenience to users, it frequently turns into a security hole. In this paper, we propose a new human-centered security risk analysis method that puts weight on the relationship between end devices. The measure derives from the concept of entropy rate, which is known as the uncertainty per a node in a network. As there are some limitations to use entropy rate as a measure in comparing different size of networks, we divide the entropy rate of a network by the maximum entropy rate of the network. Also, we show how to avoid the violation of irreducible, which is a precondition of the entropy rate of a random walk on a graph.

A Study on Key Delivery Protocols for End-to-End Secure Communication (종단 간 암호화 통신을 위한 키 전달 프로토콜에 관한 연구)

  • Kim, Jung-Yoon;Hwang, In-Yong;Lee, Jong-Eon;Kim, Seok-Joong;Lee, You-Shin;Choi, Hyoung-Kee
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2009.01a
    • /
    • pp.391-394
    • /
    • 2009
  • All-IP는 통신에 관련된 모든 개체가 IP를 사용하는 네트워크를 의미한다. All-IP 네트워크에서는 보안을 위해 통신 내용에 대한 암호화가 반드시 이루어져야 하며, 신뢰할 수 있는 3자 (trusted third party)는 서비스 중재 및 부가 서비스 제공을 위해 통신에 사용된 암호화 키를 획득할 수 있어야 한다. 이는 통신 개체가 다른 개체에게 암호화 키를 전달하는 메커니즘이 필요하다는 것을 의미한다. 우리는 본 논문을 통해, 통신 개체가 다른 개체에게 키를 전달하는 기법을 37에로 분류하고 각 기법에 대해 상세히 설명한다. 또한, 우리는 새로운 키 전달 프로토콜을 제안하고 3가지 운용 모드를 제시한다. 우리가 제안하는 프로토콜용 사용자의 필요에 따라 보안 기능을 선택적으로 운용할 수 있다. 성능평가 및 분석 결과에 따르면, 보안 가능과 성능은 뚜렷한 트레이드오프(trade-off) 관계가 있음을 알 수 있고, 기본적인 기능만을 운용할 경우 추가적인 오버헤드가 거의 없음을 알 수 있다.

  • PDF

Design of Security Protocol for RFID System using Mobile Reader (이동형 리더를 사용하는 RFID시스템의 보안 프로토콜 설계)

  • Jang, Bong-Im;Kim, Chang-Su;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.954-955
    • /
    • 2012
  • Recently as increasing the use of mobile communication devices the use of mobile readers for recognition tag attached to objects is also increasing. Accordingly, meantime, that gives rise to the vulnerability of RFID systems between reader and tag security issues, as well as security issues between the reader and the back-end server will occur. In this paper between the reader and the back-end server to security vulnerabilities efficient authentication protocol using the hash function is proposed.

  • PDF

Comparison of Algorithm Performance in the Smart Card used as the TETRA terminal encryption module (TETRA 단말기용 스마트카드에서의 알고리즘 성능 비교)

  • Ahn Jae-Hwan;Park Yong-Seok;Jung Chang-Ho;Ahn Joung-Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.183-186
    • /
    • 2006
  • It is studied the implementation possibility of some encryption algorithms which meet the performance requirements in the smart card used in the TETRA system End-to-End Encryption. It is measured the operation time of the algorithm in the smart card which has 32 bit smart card controller made by Samsung Electronics. The algorithms used in the performance comparison are AES, ARIA, 3DES, SEED, IDEA which are the domestic or international standards. The input and output time of the smart card are measured using the smart card protocol analyzer. The pure algorithm operation time is calculated by the repeated algorithm operations. This measurement results can be used as the criteria for the selection of algorithm which will be used in the TETRA End-to-End encryption system. The algorithm which has better performance can be used for the implementation of additional functions in the smart lard, because of the enough time margin.

  • PDF

Secure Mutual Authentication Protocol for RFID System without Online Back-End-Database (온라인 백-엔드-데이터베이스가 없는 안전한 RFID 상호 인증 프로토콜)

  • Won, Tae-Youn;Yu, Young-Jun;Chun, Ji-Young;Byun, Jin-Wook;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.1
    • /
    • pp.63-72
    • /
    • 2010
  • RFID is one of useful identification technology in ubiquitous environments which can be a replacement of bar code. RFID is basically consisted of tag, reader, which is for perception of the tag, and back-end-database for saving the information of tags. Although the usage of mobile readers in cellular phone or PDA increases, related studies are not enough to be secure for practical environments. There are many factors for using mobile leaders, instead of static leaders. In mobile reader environments, before constructing the secure protocol, we must consider these problems: 1) easy to lose the mobile reader 2) hard to keep the connection with back-end-database because of communication obstacle, the limitation of communication range, and so on. To find the solution against those problems, Han et al. suggest RFID mutual authentication protocol without back-end-database environment. However Han et al.'s protocol is able to be traced tag location by using eavesdropping, spoofing, and replay attack. Passive tag based on low cost is required lots of communication unsuitably. Hence, we analyze some vulnerabilities of Han et al.'s protocol and suggest RFID mutual authentication protocol without online back-end-database in aspect of efficiency and security.

Density-Based Opportunistic Broadcasting Protocol for Emergency Situations in V2X Networks

  • Park, Hyunhee;Singh, Kamal Deep;Piamrat, Kandaraj
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.1
    • /
    • pp.26-32
    • /
    • 2014
  • Vehicular-to-anything (V2X) technology is attractive for wireless vehicular ad-hoc networks (VANETs) because it allows for opportunistic choice of a vehicular protocol between vehicular-to-vehicular (V2V) and vehicular-to-infrastructure (V2I) communications. In particular, achieving seamless connectivity in a VANET with nearby network infrastructure is challenging. In this paper, we propose a density-based opportunistic broadcasting (DOB) protocol, in which opportunistic connectivity is carried out by using the nearby infrastructure and opposite vehicles for solving the problems of disconnection and long end-to-end delay times. The performance evaluation results indicate that the proposed DOB protocol outperforms the considered comparative conventional schemes, i.e., the shortest path protocol and standard mobile WiMAX, in terms of the average end-to-end delay, packet delivery ratio, handover latency, and number of lost packets.

Secure Connectivity Probability of Multi-hop Clustered Randomize-and-Forward Networks

  • Wang, Xiaowei;Su, Zhou;Wang, Guangyi
    • ETRI Journal
    • /
    • v.39 no.5
    • /
    • pp.729-736
    • /
    • 2017
  • This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

Bonding between high strength rebar and reactive powder concrete

  • Deng, Zong-Cai;Jumbe, R. Daud;Yuan, Chang-Xing
    • Computers and Concrete
    • /
    • v.13 no.3
    • /
    • pp.411-421
    • /
    • 2014
  • A central pullout test was conducted to investigate the bonding properties between high strength rebar and reactive powder concrete (RPC), which covered ultimate pullout load, ultimate bonding stress, free end initial slip, free end slip at peak load, and load-slip curve characteristics. The effects of varying rebar buried length, thickness of protective layer and diameter of rebars on the bonding properties were studied, and how to determine the minimum thickness of protective layer and critical anchorage length was suggested according the test results. The results prove that: 1) Ultimate pull out load and free end initial slip load increases with increase in buried length, while ultimate bonding stress and slip corresponding to the peak load reduces. When buried length is increased from 3d to 4d(d is the diameter of rebar), after peak load, the load-slip curve descending segment declines faster, but later the load rises again exceeding the first peak load. When buried length reaches 5d, rebar pull fracture occurs. 2) As thickness of protective layer increases, the ultimate pull out load, ultimate bond stress, free end initial slip load and the slip corresponding to the peak load increase, and the descending section of the curve becomes gentle. The recommended minimum thickness of protective layer for plate type members should be the greater value between d and 10 mm, and for beams or columns the greater value between d and 15 mm. 3) Increasing the diameter of HRB500 rebars leads to a gentle slope in the descending segment of the pullout curve. 4) The bonding properties between high strength steel HRB500 and RPC is very good. The suggested buried length for test determining bonding strength between high strength rebars and RPC is 4d and a formula to calculate the critical anchorage length is established. The relationships between ultimate bonding stress and thickness of protective layer or the buried length was obtained.

An Investigation into the Role of Technostress in Information Security Context (기술스트레스가 정보보안에 미치는 영향에 관한 연구)

  • Park, Chul-Ju;Yim, Myung-Seong
    • Journal of Digital Convergence
    • /
    • v.10 no.5
    • /
    • pp.37-51
    • /
    • 2012
  • The purpose of this study is to approach information security from a more comprehensive perspective. Particularly, information countermeasures includes a technological tool for end users, thereby increasing the end users' technological stresses. Based on the technostress framework, we investigate a effect of security awareness training on technostress, and also examine a effect of technostress on the persistent security compliance. Results showed that security awareness training influenced on techno-overload and techno-uncertainty. We also found that techno-overload and techno-uncertainty have a significant effect on the persistent security compliance. Conclusion and implications are discussed.