• Journal of National Security and Military Science
• /
• s.9
• /
• pp.207-240
• /
• 2011

There are many information assurance schemes(i.e., evaluation criteria and methodology) for security assurance of information systems, since the security is one of the most important characteristics in the modem information systems. However, there are confusions among schemes and redundancies of assurance. In this paper, we survey and classify conventional information assurance schemes by view points of assurance targets, life-cycles and nations. We propose three new information assurance schemes as the result of survey. Those are as follows: the schemes of the assurance on the requirement itself which is evaluated and certificated after standardizing the security requirements about the organizations and the applications, on the developing information system, and on the accreditation and certification about new information system. This will be helpful to set up a security assurance of National Defense.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.25-34
• /
• 2004

Common Criteria(CC, ISO/IEC 15408) is an international standard for evaluation of Information Suity Systems(ISS). There need a suitable evidence of estimation of evaluation cost in an evaluation facility under the CC-based evaluation and assurance scheme. In this paper, we propose an evaluation effort model, which is based not only on assurance-level but also on product-type of ISS, by means of real experience of real evaluators, use-ratio concept and the Function Point of security function. The model is based not on a real evaluation environment of evaluation facility, but on CC, public PPs and product specific STs. Our result might be used as a basic model for estimation of evaluation cost and time of ISS in an CC-based evaluation and assurance scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3320-3331
• /
• 1999

In this paper, we explore two ways to improve the bandwidth assurance performance of Assured Service(AS). It is well known that AS fails to meet the bandwidth assurance target for large-profile TCP flows competing with many small-profile flows. This flows after the back-offs induced by packet drops. Thus currently proposed solution to this problem naturally focus on modifying TCP's behavior to counter the unfairness in the TCP dynamics. Unfortunately, these proposals lack practicability in terms of the required changes in the incumbent Internet infrastructure. Admitting this difficulty, we instead look to not yet deployed Diff-Serv mechanisms for practical solutions. In particular, we investigate the role of RIO, RED with IN(in-profile) and OUT(out-profile), queue management scheme in the assurance failure for As. Specifically, we identify the inadequacy of RIO that aggravates the bandwidth assurance failure. Then we alleviates the bandwidth assurance failure problem by separately controlling the out-of-profile packet queue length. Through extensive simulations we demonstrate that RI+O extends the regime where AS consistently provides the bandwidth assurance.

• Journal of Advanced Navigation Technology
• /
• v.14 no.2
• /
• pp.247-252
• /
• 2010

According to IT technology has evolved, a lot of information are moving through network. The correct internet users can obtain useful information. But incorrect users expose information and cause various damage for malicious purpose. To solve this problem, various information security products are being developed. For development of secure information security product, the development process should be secure. Also evaluation system is being used about product evaluation and security module for the assurance of secure product. In this paper, we proposed assurance system for secure development of information security product. Therefore this paper proposed more secure product development and assurance scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.6
• /
• pp.133-140
• /
• 2011

Password-based authentication is the protocol that two entities share a password in advance and use the password as the basic of authentication. Password authentication schemes are divided into weak-password and strong-password authentication scheme. SPAS protocol, one of the strong-password authentication scheme, was proposed for secure against DoS attack. However it has vulnerability of the replay attack. In this paper, we analyze the vulnerability to the replay attack in SPAS protocol. Then we also propose an Improved-Strong Password Authentication Scheme (I-SPAS) with secure against the replay attack.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.982-991
• /
• 2014

The integrity assurance of recorded video by car black boxes are necessary as the car black box is becoming more popular. In this paper, we propose a video data integrity assurance scheme reflecting the features of car black box. The proposed method can detect any kind of deletion, insertion, modification of frames by cyclic chaining using inter block relation. And, it provides the integrity assurance function consistently even in cases of file overwriting because of no more free space in storage, partial file data lost. And non-repudiation is supported. Experimental results with a car black box embedded system with A8 application processor show that our method has a feasible computational overhead to process full HD resolution video at 30 frames per second in a real time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4508-4528
• /
• 2016

Widespread use of wireless networks has drawn attention to ascertain confidential communication and proper authentication of an entity before granting access to services over insecure channels. Recently, Truong et al. proposed a modified dynamic ID-based authentication scheme which they claimed to resist smart-card-theft attack. Nevertheless, we find that their scheme is prone to smart-card-theft attack contrary to the author's claim. Besides, anyone can impersonate the user as well as service provider server and can breach the confidentiality of communication by merely eavesdropping the login request and server's reply message from the network. We also notice that the scheme does not impart user anonymity and forward secrecy. Therefore, we present another authentication scheme keeping apart the threats encountered in the design of Truong et al.'s scheme. We also prove the security of the proposed scheme with the help of widespread BAN (Burrows, Abadi and Needham) Logic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1512-1532
• /
• 2013

A convertible undeniable signature requires a verifier to interact with the signer to verify a signature and furthermore allows the signer to convert a valid one to publicly verifiable signature. In 2007, Yuen et al. proposed a convertible undeniable signature without random oracles in pairings. However, it is recently shown that Yuen et al.'s scheme is not invisible for the standard definition of invisibility. In this paper, we propose a new improvement by using extended Euclidean algorithm that can overcome the visibility attack. The proposed scheme has been evaluated based on computation and communication complexities and the performance comparisons of Yuen et al.'s scheme and various convertible undeniable signature schemes are provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication times significantly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.552-558
• /
• 2002

Differentiated services (DiffServ) architecture defines a new framework for the support of quality of service (QoS) in IP-based networks. RIO has received the most attention among all the active queue management mechanisms proposed for assured service in DiffServ environment. The paper proposed the enhanced RIO which could alleviate the impact of flow's packet sire on the realized throughput. The simulation results indicate that this mechanism, when combined with TSW as traffic conditioner, provide better throughput assurance and fair distribution of excess bandwidth independent of packet size of flows in case of well-provisioned network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3338-3351
• /
• 2012

There is an intuitive connection between signcryption and key agreement. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption. This approach introduces desired properties to group key agreement. What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender. Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8]. We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.