Abstract: Provided is a share hardening method for multi-factor threshold secret sharing which includes an arbitrary share predetermined by a user and is capable of guaranteeing a security. The share hardening method for multi-factor threshold secret sharing may include an operation of accepting at least one predetermined first share value, an operation of randomly generating at least one second share value corresponding to the at least one predetermined first share value, an operation of determining an aggregate share using the at least one predetermined first share value and the at least one second share value, an operation of generating a polynomial for threshold secret sharing based on the determined aggregate share, and an operation of generating the remaining full shares based on the generated polynomial.

Abstract: Provided is a method for threshold secret sharing and reconstruction for multi-compartment, and more particularly, to a method for creating a share and reconstructing a secret in a system constituted by a plurality of compartments. The method for threshold secret sharing for multi-compartments may include: an operation of creating, when at least one second compartment is related toward a first compartment in one direction, an encrypted secret value by using an external share which does not belong to the first compartment, but belongs to the at least one second compartment; an operation of creating a first polynomial for defining the first compartment by using the encrypted secret value; and an operation of creating an internal share of the first compartment by using the first polynomial.

Abstract: A method and system of estimating multi-tasking performance performed in multi-processor are described. The method includes dividing a plurality of tasks into a plurality of sub tasks in accordance with predefined operation types, arranging the plurality of sub tasks in accordance with a predecessor-successor structure based on the operation types of the plurality of sub tasks, and estimating multi-tasking performance of the plurality of tasks using the arranged plurality of sub tasks.

Abstract: A method for modeling a Discrete Event System includes the steps of: a) receiving the user-defined requirement and specification of a Discrete Event System; b) extracting events and action from the user-defined requirement and specification and storing the events and action; c) generating a tree-type data structure including start node; d) searching the stored events to determine existence of allowable events from the event represented by a leaf node. which quits the generation of the tree-type data structure when there is no allowable event; e) when there is the allowable event in the stored events, generating a child node of the leaf node, the child node representing to allowable event and F) iterating the step of searching and the step of generating a child node for all the leaf nodes of the tree-type data structure.

Abstract: Method for modeling a Discrete Event System using event flow chart, which can completely describe the Discrete Event System at ease only by describing event flow without using the concept of state of the Discrete Event System.