• Title/Summary/Keyword: Information Flow

Search Result 220, Processing Time 0.26 seconds

Secure Information Flow Analysis in Mini x86 Assembly Language (Mini x86 어셈블리어에서 보안 정보 흐름 분석)

  • Kim, Je Min;Kim, Ki Tae;Yoo, Weon Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.3
    • /
    • pp.87-98
    • /
    • 2009
  • This paper discuss secure information flow analysis and its visualization. Information leak is defined as existence of information flow from variables which have user's private informations to variables that anyone can access. Secure information flow analysis has been made to decide of whether the information leak is or not. There are many researches for secure information flow analysis concerning high level programming languages. But actually, programs that user executes don't have program source code represented in high level programming language. Thus there is need for analysis of program represented in low level language. More to analysis, visualization of analysis is very important. So, this paper discuss visualization of secure information flow analysis. In this paper, Mini x86 Assembly Language which is subset of x86 assembly language is defined and secure information flow analysis of program is proposed. In addition, this paper defines transfer function that is used for analysis and shows how to visualize control flow graph.

Security Analysis of Information Flow using SAT (SAT를 이용한 정보흐름의 안전성 분석)

  • Kim, Je-Min;Kouh, Hoon-Joon
    • Journal of Digital Convergence
    • /
    • v.14 no.6
    • /
    • pp.253-261
    • /
    • 2016
  • As many people use internet through the various programs of PC and mobile devices, the possibility of private data leak is increasing. A program should be used after checking security of information flow. Security analysis of information flow is a method that analyzes security of information flow in program. If the information flow is secure, there is no leakage of personal information. If the information flow not secure, there may be a leakage of personal information. This paper proposes a method of analyzing information flow that facilitates SAT solver. The method translates a program that includes variables where security level is set into propositional formula representing control and information flow. The satisfiability of the formula translated is determined by using SAT solver. The security of program is represented through the result. Counter-example is generated if the program is not secure.

Augmenting Quasi-Tree Search Algorithm for Maximum Homogenous Information Flow with Single Source/Multiple Sinks

  • Fujita, Koichi;Watanabe, Hitoshi
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.462-465
    • /
    • 2002
  • This paper presents a basic theory of information flow from single sending point to multiple receiving points, where new theories of algebraic system called "Hybrid Vector Space" and flow vector space play important roles. Based on the theory, a new algorithm for finding maximum homogenous information flow is proposed, where homogenous information flow means the flow of the same contents of information delivered to multiple clients at a time. Effective multi-routing algorithms fur tree-shape delivery rout search are presented.

  • PDF

An Information Flow Security Based on Protected Area in eCommerce (전자 거래에서 보호 영역을 기반으로 하는 정보 흐름 보안 방법)

  • Seo, Yang-Jin;Han, Sang-Yong
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.1
    • /
    • pp.1-16
    • /
    • 2010
  • Confidentiality is one of the most important requirements of information protection systems. The access control technique has been used to provide confidentiality, but it has fundamental problems in that it cannot prevent violations of confidentiality committed by authorized users. Information flow control is a technique introduced to resolve such problems, and many approaches based on programming languages have been proposed. However, it is not easy for a programmer to implement the technique at the source code level. Furthermore, the practicality of information flow control is difficult to demonstrate because it does not provide control over programs that have already been developed. This paper proposes a method that enables a practical information flow control through using a protected area, a separate part of computer system storage. Case studies are given to show its usefulness.

Partitioning and Conveyance Technique of Information Flow for Systems Design

  • Leem, Young-Moon
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.23 no.56
    • /
    • pp.35-43
    • /
    • 2000
  • In order to obtain rigorous systems analysis and design, it is essential to understand accurate information flow in the system. For the effective capturing of accurate information flow in a system, it Is vital to control information flow in the system. Also, information and information flow have to be simplified as a deliverable form. This paper presents partitioning and conveyance technique based on the application of situation theory. First, historical background of situation theory will be given. Then necessary conditions and definitions will be provided. Lastly, this paper provides specific technique with example. This introduced technique will be a powerful tool for sharing timely and relevant information in a complex manufacturing system that can be used continuously and efficiently throughout systems operation.

  • PDF

Multimedia TIAV System

  • Beknazarova, Saida Safibullayevna
    • Journal of Multimedia Information System
    • /
    • v.2 no.4
    • /
    • pp.295-302
    • /
    • 2015
  • This article discusses the features and trends of development of the process of implementation of multimedia systems in various fields, research substantiate the basic concepts of multimedia systems, information flow, describes the classification and characterization of information flows and systems. Described container TIAV, which is designed with all the modern features and is aimed at future trends in the field of play.

Method of Payment Service based on Open API (개방형 인터페이스를 이용한 지불 서비스 제공 방법)

  • Hong, Sun-Hwan;Lee, Jae-Yong;Kim, Byung-Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • /
    • pp.572-575
    • /
    • 2008
  • In this paper we designed a Payment Service. This service is based on Parlay X Web Services. In the design process we described a functional entity and the information flow between entities. Also, we described a physical entity and the information flow between entities.

  • PDF

The Relationships among E-commerce, BSC, Inter-organizational Information Flow and Supply-Chain Performance (전자상거래, 균형성과표, 조직간 정보교류와 공급망 성과 간의 관계 연구)

  • Choe, Jong-Min
    • Korean Management Science Review
    • /
    • v.30 no.1
    • /
    • pp.149-165
    • /
    • 2013
  • This study empirically investigated the changes of performance evaluation systems under the environment of supply-chain e-commerce. The objectives of e-commerce include obtaining financial profit, internal innovation through processes integration, learning with information flow, and customer satisfaction through quick response. These objectives are generally consistent with the four evaluation measures of balanced scorecard(BSC). This study, first, demonstrated that perceived environmental uncertainty(PEU) has a significant effect on the adoptions of e-commerce and BSC, and severe competition positively influences the use of e-commerce. With cluster analysis and subgroup analysis, we also showed that under the high adoption levels of e-commerce, the high utilization of BSC can improve the supply-chain performance of a firm. In addition, it was found that the use of e-commerce indirectly and significantly affects supply-chain performance through inter-organizational information flow, and the supply-chain performance of a firm leads to the improvement of organizational performance.

A Program Complexity Measure using the Slice-based Information Flow Graph(SIFG) (SIFG를 이용한 프로그램 복잡도 척도)

  • Choi, Wan-Kyoo;Chung, Il-Yong;Lee, Sung-Joo
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.12
    • /
    • pp.910-920
    • /
    • 2001
  • We developed a SIFC(Slice-based Information Flow Graph) For modeling the information flow on program on the basis of the information flow of a data tokens on program slices. Then we defined a SCM(Slice-based Complexity Measure) for measuring the program complexity by measuring the complexity of information flow on SIFG, We showed that, according to Zuse's approach, it assumed ordinal scale based on atomic modifications on SIFG and that it was additive to binary operation MBSEQ and that it was not additive to binary operation MBALT but satisfied Weyuker's 9th axiom. Also based on comparison with the existing measures, we showed that SCM could measure not only the control and data flow in program but also the physical size of program.

  • PDF

A Study on the Efficiency and Information for Future Market of Japan's Frozen Shrimp (일본 냉동새우 선물시장의 효율성과 정보흐름에 관한 연구)

  • Rhee, Byung-Kun;Jeon, Hye-Min;Kim, Ki-Soo
    • The Journal of Fisheries Business Administration
    • /
    • v.40 no.1
    • /
    • pp.51-74
    • /
    • 2009
  • The purpose of this study is to ascertain that how the futures market of the Japanese frozen shrimp that is the only fisheries asset all over the world can be efficient. Accordingly, this paper examines efficiency and information flow of the Japanese frozen shrimp market using data from Kansai Commodities Exchange frozen shrimp futures closing prices and spot prices. And then this paper estimates a forward price model using that data. From the model, risk premium is estimated and we could also analyse the future information flow into the futures market which reveals future spot prices. This thesis reached to conclusions as follows: First, the null of zero risk premium is rejected and the value of that is negative. Second, the time pattern of information flow into the futures market is that most of the information on future price arrives within a week and for the last week, most of relevant information is already incorporated. The result of this study contrasts with that of Stockman(1978) about currency futures market of U.S.

  • PDF