• 제목/요약/키워드: verifier

Search Result 126, Processing Time 0.031 seconds

Three-Party Authenticated Key Exchange Protocol using Smartcards (스마트카드를 이용한 3자 참여 인증된 키교환 프로토콜)

  • Jeon, Il-Soo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.6
    • /
    • pp.73-80
    • /
    • 2006
  • Recently, Sun et el. proposed a three-party authenticated key exchange protocol using the public key of the server and the derived verifier from the Password of a user. This paper proposes a password-based three-party authenticated key exchange protocol using smartcards. Since the proposed protocol has very low computation cost by using XOR and hash function operation instead of the public key operation, and reduces the count of message transmission to 20% compared with the protocol of Sun et el., it can execute an effective authenticated key exchange. Furthermore, the proposed protocol is safe from password guessing attack by not saving passwords in the server, and it is also safe from server compromise attack because the server cannot know the shared session key between the two users.

Applet Control using Java Bytecode Modification on the Internet Communication (인터넷 통신상에서 자바 바이트 코드 수정을 이용한 애플릿 제어)

  • 김광준;나상동;배용근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.1
    • /
    • pp.90-99
    • /
    • 2003
  • Java applets are downloaded from web server through internet and executed in Java Virtual Machine of clients' browser. Before execution of java applets, JVM checks bytecode program with bytecode verifier and performs runtime tests with interpreter. However, these tests will not protect against undesirable runtime behavior of java applets, such as denial of service attack, email forging attack, URL spoofing attack, and annoying sound attack. In order to protect malicious applets, a technique used in this paper is java bytecode modification. This technique is used to restrict applet behavior or insert code appropriate to profiling or other monitoring efforts. Java byte modification is divided into two general forms, class-level modification involving subclassing non-final classes and method-level modification used when control over objects from final classes or interface. This paper showed that malicious applets are controlled by java bytecode modification using proxy server. This implementation does not require any changes in the web sever, JVM or web browser.

Algorithm of Converged Corner Detection-based Segmentation in the Data Matrix Barcode (코너 검출 기반의 융합형 Data Matrix 바코드 분할 알고리즘)

  • Han, Hee-June;Lee, Jong-Yun
    • Journal of the Korea Convergence Society
    • /
    • v.6 no.1
    • /
    • pp.7-16
    • /
    • 2015
  • A segmentation process extracts an interesting area of barcode in an image and gives a crucial impart on the performance of barcode verifier. Previous segmentation methods occurs some issues as follows. First, it is very hard to determine a threshold of length in Hough Line transform because it is sensitive. Second, Morphology transform delays the process when you conduct dilation and erosion operations during the image extraction. Therefore, we proposes a novel Converged Harris Corner detection-based segmentation method to detect an interesting area of barcode in Data Matrix. In order to evaluate the performance of proposed method, we conduct experiments by a dataset of barcode in accordance with size and location in an image. In result, our method solves the problems of delay and surrounding environments, threshold setting, and extracts the barcode area 100% from test images.

Shot Boundary Verification using Visual Rhythm (시각 율동을 이용한 샷 경계 검증)

  • Kim, Heyeok-Man;Lee, Jin-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.3
    • /
    • pp.201-209
    • /
    • 2000
  • Recent works regarding video shot change detection algorithms show that abrupt shot changes are detected fairly well. However, gradual shot changes including wipes and dissolves are often missed or falsely detected. A robust shot change detection system, therefore, must include a shot verification step to further enhance the overall system performance. In this paper, we introduce the concept of the visual rhythm which is a single image, a subsampled version of a full video. On the visual rhythm, the different video edit effects such as cuts, wipes and dissolves manifest themselves as different patterns. Using this characteristic, it becomes possible, without sequentially playing the entire video, to find false positive shots as well as undetected shots. Thus, inclusion of the visual rhythm in the shot boundary verification process will aid the operator to exclude falsely detected shots as well as to find undetected shots fast and efficiently. For this purpose we have developed a new tool, a shot verifier incorporating the visual rhythm. The usefulness of the visual rhythm during the shot verification process will be presented.

  • PDF

A Countermeasure Scheme Based on Whitelist using Bloom Filter against SIP DDoS Attacks (블룸필터를 사용한 화이트리스트 기반의 SIP 서버스 거부 공격 대응 기법)

  • Kim, Ju-Wan;Ryu, Jea-Tek;Ryu, Ki-Yeol;Roh, Byeong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1297-1304
    • /
    • 2011
  • SIP(Session Initiation Protocol) has some security vulnerability because it works on the Internet. Therefore, the proxy server can be affected by the flooding attack such as DoS and service interruption. However, traditional schemes to corresponding Denial of Service attacks have some limitation. These schemes have high complexity and cannot protect to the variety of Denial of Service attack. In this paper, we newly define the normal user who makes a normal session observed by verifier module. Our method provides continuous service to the normal users in the various situations of Denial of Service attack as constructing a whitelist using normal user information. Various types of attack/normal traffic are modeled by using OPNET simulator to verify our scheme. The simulation results show that our proposed scheme can prevent DoS attack and achieve a low false rate and fast searching time.

Formal Verification and Testing of RACE Protocol Using SMV (SMV를 이용한 RACE 프로토콜의 정형 검증 및 테스팅)

  • Nam, Won-Hong;Choe, Jin-Yeong;Han, U-Jong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.3
    • /
    • pp.1-17
    • /
    • 2002
  • In this paper, we present our experiences in using symbolic model checker(SMV) to analyze a number of properties of RACE cache coherence protocol designed by ETRI(Electronics and Communications Research Institute) and to verify that RACE protocol satisfies important requirements. To investigate this, we specified the model of the RACE protocol as the input language of SMV and specified properties as a formula in temporal logic CTL. We successfully used the symbolic model checker to analyze a number of properties of RACE protocol. We verified that abnormal state/input combinations was not occurred and every possible request of processors was executed correctly We verified that RACE protocol satisfies liveness, safety and the property that any abnormal state/input combination was never occurred. Besides, We found some ambiguities of the specification and a case of starvation that the protocol designers could not expect before. By this verification experience, we show advantages of model checking method. And, we propose a new method to generate automatically test cases which are used in simulation and testing.

High-Speed Decoding Algorithm of Data Codeword in Two-Dimensional PDF417 Bar Code (이차원 PDF417 바코드에서 데이터 코드워드의 고속 디코딩 알고리즘)

  • Kim, Young-Jung;Cho, Young-Min;Lee, Jong-Yun
    • Journal of Digital Convergence
    • /
    • v.12 no.2
    • /
    • pp.285-293
    • /
    • 2014
  • Two-dimensional PDF417 bar code has a wide range of use and has a storage capacity to compress a large amount of data. With these characteristics, PDF417 has been used in various ways to prevent the forgery and alteration of important information in documents. On the other hand, previous decoding methods in PDF417 barcode are slow and inefficient because they simply employ the standard specifications of AIM (Association for Automatic Identification and Mobility). Therefore, this paper propose an efficient and fast algorithm of decoding PDF417 bar code. As a result, the proposed decoding algorithm will be more faster and efficient than previous methods.

Cryptanalysis and Remedy Scheme on Qiu et al.'s Enhanced Password Authentication Scheme for SIP (SIP를 위한 Qiu등의 개선된 패스워드 인증 기법에 대한 보안 분석 및 강화 기법)

  • Kim, Hyunsung
    • Journal of Digital Convergence
    • /
    • v.18 no.5
    • /
    • pp.249-256
    • /
    • 2020
  • The session initiation protocol (SIP) is a signaling protocol, which is used to controlling communication session creation, manage and finish over Internet protocol. Based on it, we can implement various services like voice based electronic commerce or instant messaging. Recently, Qiu et al. proposed an enhanced password authentication scheme for SIP. However, this paper withdraws that Qiu et al.'s scheme is weak against the off-line password guessing attack and has denial of service problem. Addition to this, we propose an improved password authentication scheme as a remedy scheme of Qiu et al.'s scheme. For this, the proposed scheme does not use server's verifier and is based on elliptic curve cryptography. Security validation is provided based on a formal validation tool ProVerif. Security analysis shows that the improved authentication scheme is strong against various attacks over SIP.

Recognition of Unconstrained Handwtitten Numerals Based on Modular Design and Pipeline Connection (모듈러 설계 및 파이프라인 연결에 기반한 무제약 필기 숫자의 인식)

  • Oh, Il-Seok;Choi, Soon-Man;Hong, Ki-Cheon;Lee, Jin-Seon
    • Korean Journal of Cognitive Science
    • /
    • v.7 no.1
    • /
    • pp.75-84
    • /
    • 1996
  • In this paper we emphasize the importance of architectural aspects of designing a handwritten numeral recognition program. and describe two architectural design.First, we describe the modular design of a numeral recognition program, and mention its advantages.In this design, a recognizer is composed of 10 binary subrecognizers each of which is responsible for only one class.Rule-based training and neural-based training are presented.Second, we connect two(or more)recognizers serially which we call pipelining connection.The second recognizer may act as verifier for the patterns recognized by the forst recognizer, or as second chance recognizer for the patterns rejected by the first recognizer.Our experimental results obtained till now show the merits of the proposed architectural designs.

  • PDF

A Combination Method of Unconstrained Handwritten Numerals Recognizers Using Strutural Feature Analyzer (구조적 특징 분석기를 이용한 무제약 필기 숫자 인식기의 결합)

  • Kim, Won-Woo;Paik, Jong-Hyun;Lee, Kwan-Yong;Byun, Hye-Ran;Lee, Yill-Byung
    • Korean Journal of Cognitive Science
    • /
    • v.7 no.1
    • /
    • pp.37-56
    • /
    • 1996
  • In this paper,we design a verifier for unconstrained handwritten numerals using structural feature analysis,and use it as a comnination algorithm for multiple recognizers.The existing combination algorithms mainly use learnings,statistical methods,or probabilistic methods without considering structural features of numerals.That is why they cannot recognize some numerals which human can identify clearly.To overcome the shortcomings,we design one-to-one verifiers which compare and analyze the relative structural features between frequently confused numeral pairs,and apply them to combine multiple recongnizers.Structural features for verification consist of contour,direction al chain code,polygonal approximation,and zero crossing number of horizontal/vertical projections. We gained a 97.95% reliability with CENPARMI numeral data,and showed that some misconceived factors generated from typical combination algorithms can be removed.

  • PDF