• Title/Summary/Keyword: MESSAGE model

Search Result 652, Processing Time 0.026 seconds

Certificate-Based Signcryption Scheme without Pairing: Directly Verifying Signcrypted Messages Using a Public Key

  • Le, Minh-Ha;Hwang, Seong Oun
    • ETRI Journal
    • /
    • v.38 no.4
    • /
    • pp.724-734
    • /
    • 2016
  • To achieve confidentiality, integrity, authentication, and non-repudiation simultaneously, the concept of signcryption was introduced by combining encryption and a signature in a single scheme. Certificate-based encryption schemes are designed to resolve the key escrow problem of identity-based encryption, as well as to simplify the certificate management problem in traditional public key cryptosystems. In this paper, we propose a new certificate-based signcryption scheme that has been proved to be secure against adaptive chosen ciphertext attacks and existentially unforgeable against chosen-message attacks in the random oracle model. Our scheme is not based on pairing and thus is efficient and practical. Furthermore, it allows a signcrypted message to be immediately verified by the public key of the sender. This means that verification and decryption of the signcrypted message are decoupled. To the best of our knowledge, this is the first signcryption scheme without pairing to have this feature.

Performance Analysis of the DQDB Protocol (DQDB (Distributed Queue Dual Bus) 프로토콜의 성능분석)

  • 이창훈;박광만;홍정완
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.1-14
    • /
    • 1994
  • In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

  • PDF

Specification and Analysis of Key Recovery System using ECTPN (ECTPN을 이용한 키복구 시스템의 명세 및 분석)

  • Go, Jeong-Ho;Gang, Sang-Seung;Jeon, Eun-A;Lee, Gang-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1874-1885
    • /
    • 2000
  • When a receiver of ciphertext message can not decrypt a message because he has lost his private-key, the private-key of receiver and session-key of the message should be recovered. In this paper, we developed an Encapsulation based Key Recovery System (EKRS). EKRS is a new key encapsulation based key recovery system which is characterized by secretly choice of KRA, randomized target keys. n-way recovery type, and useful for commercial key recovery. EKRS is formally specified by a pictorial model, an Extended Cryptographic Timed Petri Net (ECTPN). Secure information flow and reachability of a session-key are verified by using reachability graph of ECTPN. EKRS, executing over a Public Key Infrastructure, can be used as a security solution in Web based applications such as CALS, EC an EDI.

  • PDF

An Longitudinal Analysis of Changing Beliefs on the Use in IT Educatee by Elaboration Likelihood Model (정교화 가능성 모형에 의한 IT 피교육자 신용 믿음 변화의 종단분석)

  • Lee, Woong-Kyu
    • Asia pacific journal of information systems
    • /
    • v.18 no.3
    • /
    • pp.147-165
    • /
    • 2008
  • IT education can be summarized as persuading the educatee to accept IT. The persuasion is made by delivering the messages for how-to-use and where-to-use to the educatee, which leads formulation of a belief structure for using IT. Therefore, message based persuasion theory, as well as IT acceptance theories such as technology acceptance model(TAM), would play a very important role for explaining IT education. According to elaboration likelihood model(ELM) that has been considered as one of the most influential persuasion theories, people change attitude or perception by two routes, central route and peripheral route. In central route, people would think critically about issue-related arguments in an informational message. In peripheral route, subjects rely on cues regarding the target behavior with less cognitive efforts. Moreover, such persuasion process is not a one-shot program but continuous repetition with feedbacks, which leads to changing a belief structure for using IT. An educatee would get more knowledge and experiences of using IT as following an education program, and be more dependent on a central route than a peripheral route. Such change would reformulate a belief structure which is different from the intial one. The objectives of this study are the following two: First, an identification of the relationship between ELM and belief structures for using IT. Especially, we analyze the effects of message interpretation through both of central and peripheral routes on perceived usefulness which is an important explaining variable in TAM and perceived use control which have perceived ease of use and perceived controllability as sub-dimensions. Second, a longitudinal analysis of the above effects. In other words, change of the relationship between interpretation of message delivered by IT education and beliefs of IT using is analyzed longitudinally. For achievement of our objectives, we suggest a research model, which is constructed as three-layered. While first layer has a dependent variable, use intention, second one has perceived usefulness and perceived use control that has two sub-concepts, perceived ease of use and perceived controllability. Finally, third one is related with two routes in ELM, source credibility and argument quality which are operationalization of peripheral route and central route respectively. By these variables, we suggest five hypotheses. In addition to relationship among variables, we suggest two additional hypotheses, moderation effects of time in the relationships between perceived usefulness and two routes. That is, source credibility's influence on perceived usefulness is decreased as time flows, and argument quality's influence is increased. For validation of it, our research model is tested empirically. With measurements which have been validated in the other studies, we survey students in an Excel class two times for longitudinal analysis. Data Analysis is done by partial least square(PLS), which is known as an appropriate approach for multi-group comparison analysis with a small sized sample as like this study. In result. all hypotheses are statistically supported. One of theoretical contributions in this study is an analysis of IT education based on ELM and TAM which are considered as important theories in psychology and IS theories respectively. A longitudinal analysis by comparison between two surveys based on PLS is also considered as a methodological contribution. In practice, finding the importance of peripheral route in early stage of IT education should be notable.

Design and Implementation of Protocol to Transfer Secure Messages for PDA (PDA에서 운용 가능한 보안 메시지 전송 프로토콜 설계 및 구현)

  • Lee, Ki-Young;Lee, Jeong-Kyoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.181-187
    • /
    • 2005
  • This paper proposes and implements a service model to transfer messages safely for PDA on CDMA wireless network and a secure massage transfer protocol which considers characteristics of PDA. Proposed service uses SMS(Short Message Service) connect to a off-line client device with the wired network for data communication. After receiving SMS message, client device processes the SMS message and creates a data channel through RAS(Remote Access Service), then the data of the server can be pushed to clients. The implemented security protocol can provide safe data transmission on each communication line through two way channels(SMS and data). Also, by using security nonce table, this protocol can reduce a number of transmissions for exchanging a safe session key, so intensity of encryption can be increased.

The Implementation of Vital Sign Information Parsing Module using TMO(Time Triggered and Message Triggered Method) (TMO를 이용한 생체정보 수신모듈 구현)

  • Cho, Eui-Joo;Kim, Chun-Suk;Kim, Gwang-Gun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.3 no.4
    • /
    • pp.247-253
    • /
    • 2008
  • The TMO may contain two types of methods, time-triggered methods(also called the spontaneous methods of SpMs) which are clearly separated from the conventional service methods (SvMs). The SpM executions are triggered upon design time whereas the SvM executions are triggered by service request message from clients. In this paper, we describes the application environment as the patient monitor telemedicine system with TMO structure. Vital sign information web viewer systems is also the standard protocol for medical image and transfer. In order to embrace new technologies as telemedicine service, it is important to develope the standard protocol between different systems in the hospital, as well as the communication with external hospital systems.

  • PDF

Interest Based Clustering Mechanism for Hybrid P2P (하이브리드 P2P를 위한 관심분야 기반 클러스터링)

  • Lee, Lee-Sub
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.1
    • /
    • pp.69-75
    • /
    • 2006
  • P2P services occupy more then 50% of the internet traffics. A huge number of query packets are generated since pure P2P based models rely on message flooding for their query mechanisms. In this study, the numbers of query messages generated in the pure P2P and hybrid P2P model are analyzed. The results show that hybrid P2P models also could suffer from message flooding. To reduce the message flooding, this study proposes an interest based clustering mechanism for hybrid P2P services. By applying this clustering algorithm, it could reduce 99.998% of the message flooding. The proposed algorithm also reduces the cost of the joining operations by storing previous supernodes.

  • PDF

Developing a Reactive System Model from a Scenario-Based Specification Model (시나리오 기반 명세 모델로부터 반응형 시스템 모델 개발)

  • Kwon, Ryoung-Kwo;Kwon, Gi-Hwon
    • Journal of Internet Computing and Services
    • /
    • v.13 no.1
    • /
    • pp.99-106
    • /
    • 2012
  • It is an important and a difficult task to analyze external inputs and interactions between objects for designing and modeling a reactive system consisting of multiple object. Also the reactive system is required huge efforts on confirm it can satisfy requirements under all possible circumstances. In this paper, we build from requirements to a scenario-based specification model using LSC(Live Sequence Chart) extending MSC(Message Sequence Chart) with richer syntax and semantic. Then the reactive system model satisfying all requirements for each object in this system can be automatically created through LTL Synthesis. Finally, we propose a method of reactive system development by iterative process transforming a reactive system model to codes.

TAILWIND: Mobility information based Routing for Delay Tolerant Network (이동 방향 정보를 이용한 DTN 라우팅: TAILWIND)

  • Cho, Seoik;Kim, Sunhyun;Moon, Soohoon;Han, Seungjae
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.408-412
    • /
    • 2015
  • In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

A Study on an AOI Management in Virtual Environments Based on the Priority (대규모 가상공간에서 우선순위에 기반한 AOI 관리모델에 관한 연구)

  • Yu Seok-Jong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.2
    • /
    • pp.189-196
    • /
    • 2006
  • This paper proposes a priority based AOI management model as a method to effectively process message traffic for collaboration in virtual environments. Where message traffic reaches the maximum capacity of the message replay server in DVE, some of the events might be delayed to be updated at the remote clients. Because existing AOI models depend only on the occurrence time of events, they have a problem that more important events in the context might be processed later than less serious ones. Close Interactions with other participants are relatively more important than simple events which happen at a distance from the participant. This study classifies the priorities of events according to the degree of interest, and proposes a method to reduce processing delay time of events highly interested by a user. The proposed model offers a way to effectively utilize limited capacity of a server using a priority queue mechanism, which is able to handle different kinds of events. To prevent from starvation of simple events and to give fairness to the proposed algorithm, event occurrence time is also considered as well as degree of interest when processing events.

  • PDF