• Title/Summary/Keyword: Time Stamp Protocol

Search Result 29, Processing Time 0.212 seconds

The Design & Analysis of Time-Stamp Protocol with H-Binary Tree (H-이진트리체제의 타임스탬프 프로토콜 분석)

  • 정경원;도경화;전문석
    • The Journal of Society for e-Business Studies
    • /
    • v.7 no.2
    • /
    • pp.157-171
    • /
    • 2002
  • We want to find a timestamping method which improves efficient performance and have high-level security to send secured messages in the digital signature and the law of e-commerces. Our paper shows a H-binary tree of time stamp to use a time stamp protocol with high security and performance in the packets of sending messages. We implement and analyze the protocols, show to compare with previous RSA methods. Our proposed protocol has O(log n) time complexity and high-performance.

  • PDF

TSP SDK Implementation (TSP(Time Stamp Protocol ) SDK 구현)

  • 원형석;노종혁;최대선;진승헌
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.589-591
    • /
    • 2002
  • 시점확인 서비스(Time-Stamping Service)를 위한 프로토콜인 Time-Stamp protocol(TSP)를 구현하는데 필요한 기능들을 SDK로 구현하였다. 어떤 데이터가 특정 시점 이전에 존재했음을 증명하기 위해 Time-Stamp token을 발행하는 시점확인 서비스는 전자공중, 전자상거래, DVCS 등 여러 보안과 관련된 응용서비스에서 필요한 모듈이다. 본 논문에서는 시점확인 서비스를 위한 time-stamp protocol을 설명하고, TSP SDK 구현 내용, SDK를 시험하기 위한 테스트베드 및 SDK 구현시 참고사항을 서술한다.

  • PDF

The Design & Analysis of Time-Stamp Protocol with H-Binary Tree (H-이진트리 구조를 갖는 타임스탬프 설계 및 분석)

  • Jung, Kyung-Won;Do, Kyoung-Hwa;Jun, Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.817-822
    • /
    • 2002
  • We want to find a timestamping method which improves efficient performance and have high-level security to send secured messages in the digital signature and the law of e-commerces. Our paper shows a H-binary tree of time stamp to use a time stamp protocol with high suity and performance in the packets of sending messages. We implement and analyze the protocols, show to compare with previous RSA methods. Our proposed protocol has O(log n) time complexity and high-performance.

Events Ordering in Optimistic Distributed Simulation of DEVS Models (DEVS 모델의 낙관적 분산 시뮬레이션을 위한 사건 정렬 방법)

  • 김기형
    • Journal of the Korea Society for Simulation
    • /
    • v.5 no.1
    • /
    • pp.81-90
    • /
    • 1996
  • In this paper, we propose a new events ordering mechanism for the optimistic distributed simulation of DEVS models. To simulate DEVS models in a distributed environment, a synchronization protocol is required for correct simulation. Time Warp is the most well-known optimistic synchronization protocol for distributed simulation. However, employing the Time Warp protocol in distributed simulation of DEVS models incurs events ordering problem due to the semantic difference between Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.

  • PDF

An Energy Efficient Time Synchronization Technique Based on WUSB over WBAN Protocol for Wearable Computer Systems (웨어러블 컴퓨터 시스템을 위한 WUSB over WBAN 프로토콜의 에너지 효율적인 시간 동기 기술)

  • Hur, Kyeong;Sohn, Won-Sung
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.7
    • /
    • pp.879-884
    • /
    • 2012
  • In this Paper, we propose an Energy Efficient Time Synchronization technique based on WUSB (Wireless USB) over WBAN (Wireless Body Area Networks) protocol required for Wearable Computer systems. For this purpose, the proposed Time Synchronization algorithm minimizes power consumption and estimates time information with accuracy. It is executed on the basis of WUSB over WBAN protocol at each sensor node comprising peripherals of a wearable computer system. It minimizes power consumption by exchanging time stamp packets and forming a hierarchical structure.

Optimistic Concurrency Control Using Time-stamp Ordering in Mobile Databases (이동 데이터베이스 시스템에서 타임스탬프를 이용한 낙관적 동시성 제어 기법)

  • Kim Dae-Ho;Jeong Byeong-Soo;Lee Young-Koo
    • Journal of Internet Computing and Services
    • /
    • v.7 no.4
    • /
    • pp.79-90
    • /
    • 2006
  • Data broadcasting is an efficient method for disseminating data, and is widely accepted in the database applications of mobile computing environments because of its asymmetric communication bandwidth between a server and mobile clients. This requires new types of concurrency control mechanism to support mobile transactions executed in the mobile clients, which have low-bandwidths toward the server. In this paper, we propose an OCC/DTA (Optimistic Concurrency Control with Dynamic Time-stamp Adjustment) protocol that can be efficiently adapted to mobile computing environments. The protocol reduces communication overhead by using client-side validation procedure and enhances transaction throughput by adjusting serialization order without violating transaction semantics. We show that the proposed protocol satisfies data consistency requirements, and simulate that this protocol can improve the performance of mobile transactions in data broadcasting environments.

  • PDF

Improved AKA Protocol for Efficient Management of Authentication Data in 3GPP Network (3GPP 네트워크에서 효율적인 인증 데이터 관리를 위한 개선된 AKA 프로토콜)

  • Kim, Doo-Hwan;Jung, Sou-Hwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.2
    • /
    • pp.93-103
    • /
    • 2009
  • In this paper, we propose a USIM-based Authentication Scheme for 3GPP Network Access. The proposed scheme improves the problems of existing authentication protocol in 3GPP Network such as sequence number synchronization problem, the storage overhead of authentication data, and bandwidth consumption between Serving Network and Home Network. Our proposal is based on the USIM-based Authentication and Key Agreement Protocol that is defined in 3GPP Specification. In our scheme, mobile nodes share a SK with Serving Network and use a time stamp when mobile nodes are performing an authentication procedure with Serving Network. By using time stamp, there is no reason for using sequence number to match the authentication vector between mobile nodes and networks. So, synchronization problem can be solved in our scheme. As well as our scheme uses an authentication vector, the storage overhead of authentication data in Serving Network and bandwidth consumption between networks can be improved.

A DDMPF(Distributed Data Management Protocol using FAT) Design of Self-organized Storage for Negotiation among a Client and Servers based on Clouding (클라우딩 기반에서 클라이언트와 서버간 협상을 위한 자가 조직 저장매체의 DDMPF(Distributed Data Management Protocol using FAT) 설계)

  • Lee, Byung-Kwan;Jeong, Eun-Hee;Yang, Seung-Hae
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.8
    • /
    • pp.1048-1058
    • /
    • 2012
  • This paper proposes the DDMPF(Distributed Data Management Protocol using FAT) which prevents data loss and keeps the security of self-organized storages by comprising a client, a storage server, and a verification server in clouding environment. The DDMPF builds a self-organized storage server, solves data loss by decentralizing the partitioned data in it in contrast to the centralized problem and the data loss caused by the storage server problems of existing clouding storages, and improves the efficiency of distributed data management with FAT(File Allocation Table). And, the DDMPF improves the reliability of data by a verification server's verifying the data integrity of a storage server, and strengthens the security in double encryption with a client's private key and the system's master key using EC-DH algorithm. Additionally, the DDMPF limits the number of verification servers and detects the flooding attack by setting the TS(Time Stamp) for a verification request message and the replay attack by using the nonce value generated newly, whenever the verification is requested.

A Study on the Design of Synchronization Protocol for Multimedia Communication (멀티미디어 통신을 위한 동기 프로토콜의 설계에 관한 연구)

  • 우희곤;김대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.8
    • /
    • pp.1612-1627
    • /
    • 1994
  • There is a synchronization function which deals with only single media of text in the OSI Session Layer. So new synchronization schem and synchronization protocol are required for multimedia communications which include audio, video and graphic as well as text information. In this paper, conceptional Multmedia Synchronization Layer(MS layer) environment is composed and its service primitives and protocols based on 'multi-channel, base media scheme' are designed and proposed for multimedia synchronization services. This MS layer Manager (MSM) establishes the MS layer connection to the peer MS layer and manages each media channel which is created in MS layer media by media. The MSM also finds the synch-position through the media frame number by utilizing it like the time stamp to provide inter-media synchronization services as well as intra-media synchronization services.

  • PDF

A Remote Authentication Protocol Using Smartcard to Guarantee User Anonymity (사용자 익명성을 제공하는 스마트카드 기반 원격 인증 프로토콜)

  • Baek, Yi-Roo;Gil, Kwang-Eun;Ha, Jae-Cheol
    • Journal of Internet Computing and Services
    • /
    • v.10 no.6
    • /
    • pp.229-239
    • /
    • 2009
  • To solve user authentication problem, many remote user authentication schemes using password and smart card at the same time have been proposed. Due to the increasing of interest in personal privacy, there were some recent researches to provide user anonymity. In 2004, Das et al. firstly proposed an authentication scheme that guarantees user anonymity using a dynamic ID. In 2005, Chien et al. pointed out that Das et al.'s scheme has a vulnerability for guaranteing user anonymity and proposed an improved scheme. However their authentication scheme was found some weaknesses about insider attack, DoS attack, and restricted replay attack. In this paper, we propose an enhanced scheme which can remove vulnerabilities of Chien et al.'s scheme. The proposed authentication protocol prevented insider attack by using user's Nonce value and removed the restricted replay attack by replacing time stamp with random number. Furthermore, we improved computational efficiency by eliminating the exponentiation operation.

  • PDF