• Title/Summary/Keyword: one-way key distribution

Search Result 49, Processing Time 0.025 seconds

Automation-considered SVO Logic for Verifying Authentication and Key Distribution Protocols (인증 및 키 분배 프로토콜의 논리성 검증을 위한 ASVO 로직)

  • 권태경;임선간;박해룡
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.5
    • /
    • pp.17-37
    • /
    • 2003
  • This paper presents the ASVO (Automation-considered SVO) Logic that can be used for verifying authentication and key distribution protocols. The ASVO logic was designed for automatic verification, in a way to modify the SVO logic, one of the most famous authentication logics. The ASVO logic is syntactically and semantically sound, and requires relatively simple verification steps. Also we implemented the Isabelle/ASVO system which supports semi-automated verification, by using the Isabelle/Isar system.

Homomorphic Subspace MAC Scheme for Secure Network Coding

  • Liu, Guangjun;Wang, Xiao
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.173-176
    • /
    • 2013
  • Existing symmetric cryptography-based solutions against pollution attacks for network coding systems suffer various drawbacks, such as highly complicated key distribution and vulnerable security against collusion. This letter presents a novel homomorphic subspace message authentication code (MAC) scheme that can thwart pollution attacks in an efficient way. The basic idea is to exploit the combination of the symmetric cryptography and linear subspace properties of network coding. The proposed scheme can tolerate the compromise of up to r-1 intermediate nodes when r source keys are used. Compared to previous MAC solutions, less secret keys are needed for the source and only one secret key is distributed to each intermediate node.

Applying PKI for Internet Voting System

  • Kim, Jinho;Kim, Kwangjo;Lee, Byoungcheon
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2001.11a
    • /
    • pp.318-321
    • /
    • 2001
  • We have designed an Internet voting system applicable for worldwide voting which is based on Ohkubo et. al,'s scheme[9] combined with Public Key Infrastructure (PKI). To the best of our knowledge, this is the first trial to serve secure Internet voting system to the world. In our system, voter's privacy is guaranteed by using blind signature and mix-net, and robustness is provided through the threshold encryption scheme. By employing Java technology, we propose a way of typical implementation for internet voting system. Furthermore, PKI permits worldwide key distribution and achieve “one certificate/one vote” policy. Therefore, anyone can participate in the voting if he gets a certificate from Certificate Authority (CA). By the joint work between Korean and Japanese teams, the implementation aims to select MVPs in 2002 FIFA World Cup Korea-Japan$\^$TM/ in easy and friendly manner for any Internet user to participate and enjoy Internet voting.

  • PDF

A Study on Efficient Data De-Identification Method for Blockchain DID

  • Min, Youn-A
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.60-66
    • /
    • 2021
  • Blockchain is a technology that enables trust-based consensus and verification based on a decentralized network. Distributed ID (DID) is based on a decentralized structure, and users have the right to manage their own ID. Recently, interest in self-sovereign identity authentication is increasing. In this paper, as a method for transparent and safe sovereignty management of data, among data pseudonymization techniques for blockchain use, various methods for data encryption processing are examined. The public key technique (homomorphic encryption) has high flexibility and security because different algorithms are applied to the entire sentence for encryption and decryption. As a result, the computational efficiency decreases. The hash function method (MD5) can maintain flexibility and is higher than the security-related two-way encryption method, but there is a threat of collision. Zero-knowledge proof is based on public key encryption based on a mutual proof method, and complex formulas are applied to processes such as personal identification, key distribution, and digital signature. It requires consensus and verification process, so the operation efficiency is lowered to the level of O (logeN) ~ O(N2). In this paper, data encryption processing for blockchain DID, based on zero-knowledge proof, was proposed and a one-way encryption method considering data use range and frequency of use was proposed. Based on the content presented in the thesis, it is possible to process corrected zero-knowledge proof and to process data efficiently.

Statistical Analysis of End-to-End Delay for VoIP Service in Mobile WiMAX Networks

  • Islam, Mohd. Noor;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.196-201
    • /
    • 2010
  • Measurement of Quality of Service (QoS) parameters and its statistical analysis becomes a key issue for Mobile WiMAX service providers to manage the converged network efficiently and to support end-to-end QoS. In this paper, we investigate the population distribution of end-to-end one-way delay which is the most important QoS parameter in Mobile WiMAX networks. The samples are analyzed with Chi-Square Goodness-of-Fit test, Kolmogorov-Smirnov (K-S), and Anderson-Darling (A-D) test to verify the distribution of parent population. The relation with confidence level and the minimum number of sample size is also performed for logistic distribution. The statistical analysis is a promising approach for measuring the performance Mobile WiMAX networks.

A Multilevel Key Distribution using Pseudo - random Permutations (의사 랜덤치환을 이용한 다중레벨 키분배)

  • Kim, Ju-Seog;Shin, Weon;Lee, Kyung-Hyune
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2493-2500
    • /
    • 1997
  • We propose a new key management scheme for multiuser group which is classified as hierarchical structure (sometimes it is called a multilevel security hierarchy) in the symmetric key cryptosystem. The proposed scheme is based on the trapdoor one-way permutations which are generated by the pseudo-random permutation algorithm, and it is avaliable for multilevel hierarchical structure composed of a totally ordered set and a partially ordered set, since it has advantage for time and storage from an implemental point of view. Moreover, we obtain a performance analysis by comparing with the other scheme, and show that the proposed scheme is very efficient for computing time of key generation and memory size of key storage.

  • PDF

A Key Recovery System with One-way Key Distribution Property (일방향 키 분배가 가능한 키 복구 시스템)

  • Yu, Joon-Suk;Choi, Seung-Bok;Sohn, Ki-Wook;Won, Dong-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10a
    • /
    • pp.801-804
    • /
    • 2000
  • 최근들어 암호기술은 급속도로 확산되고 있으며, 암호 사용으로 인한 부작용을 방지하기 위한 대안으로 키 복구에 대한 연구가 활발히 진행되고 있다. 그러나 지금까지 제시된 기존의 키 연구 기술들은 그 대부분이 정부의 법 집행권 보장에만 설계 초점을 맞추고 있기 때문에 다양한 사용자들의 요구를 충족시키기 어렵다. 본 논문에서는 키 복구 시스템에 대한 사용주체들의 입장을 고려하여 다양한 환경에 적용한 수 있는 키 복구 시스템을 제안한다. 제안하는 방식은 암호통신 과정 중에 키가 분배되는 일방향키 분배가 가능하고 기존 키 복구 시스템만큼 효율적이면서도 충분한 유연성을 제공한다.

  • PDF

A Study on Securities of Cryptosystems for Hierarchic Groups (위계집단에서 효율적인 암호계의 안전성에 관한 소고)

  • Kim, Yong-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.4
    • /
    • pp.605-610
    • /
    • 2013
  • A cryptography for enforcing hierarchic groups in a system where hierarchy is represented by a partially ordered set was introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. To overcome this shortage, in 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment. In 2005, Kim et al. proposed the key management systems for using one-way hash function, RSA algorithm, poset dimension and Clifford semigroup in the context of modern cryptography, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders. We, in this paper, show that Kim et al. cryptosystem is insecure in some reasons and propose a revised cryptosystem.

Evaluation of Key Success Factors for Web Design in Taiwan's Bike Case Study

  • LAI, I-Sung;HUANG, Yung-Fu;SIANG, Jie-Hua;WENG, Ming-Wei
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.7 no.11
    • /
    • pp.927-937
    • /
    • 2020
  • Global warming awareness through energy conservation is growing due to the regulatory policies issued by governments and voluntary organization that established carbon emission limits. Transportation is one of the major contributors to carbon emissions. Bike will be simultaneously saving money, getting fit and helping to reduce global warming. Web design has been identified as a key factor for the acceptance and success of the websites and electronic commerce. The purpose of this research is to investigate the effective implementation of the proposed Analytic Hierarchy Process (AHP) technique on a bike case study whose company (Bike Company) is involved in web design for a critical component in the demonstration. Survey research used a variety of data collection methods, with the most common being questionnaires and interviews of some exporters. The research results reveal that the top five key success factors are Good reputation, Transaction security, Ease of use, Promotion, and Diversified choices, which provide the guidelines and directions for decision-makers to design effective websites in the current competitive business scenario. The major findings of this study are suggesting that Internet marketing channels are securing the company's relevance, together with paving the way for methods to increase web traffic.

Development of Two-Lane Car-Following Model to Generate More Realistic Headway Behavior (보다 현실적인 차두시간 행태 구현을 위한 2차로 차량추종모형 개발)

  • Yoon, Byoung Jo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.5
    • /
    • pp.1999-2007
    • /
    • 2013
  • The key characteristics of two-lane-and-two-way traffic flow are platoon and overtaking caused by low-speed vehicle such as truck. In order to develop two-way traffic flow model comprised of CF(car-following) and overtaking model, it is essential to develop a car-following model which is suitable to two-way traffic flow. Short distance between vehicles is caused when a high-speed vehicle tailgates and overtakes foregoing low-speed vehicle on two-way road system. And a vehicle following low-speed vehicle decides to overtake the front low-speed vehicle using suitable space within the headway distribution of opposite traffic flow. For this reason, a two-way CF model should describes not only running within short gap but also headway distribution. Additionally considering domestic two-way-road size, there is a on-going need for large-network simulation, but there are few studies for two-way CF model. In this paper, a two-way CA model is developed, which explains two-way CF behavior more realistic and can be applied for large road network. The experimental results show that the developed model mimics stop-and-go phenomenon, one of features of congested traffic flow, and efficiently generates the distribution of headway. When the CF model is integrated with overtaking model, it is, therefore, expected that two-way traffic flow can be explained more realistically than before.