This research investigates the role of project commitment in the context of information systems security. In doing so, the research adopts a psychological point of view by exploring and discussing the concept of project commitment in setting information security goals. Information security can be viewed as the efficient control of uncertainty arising from malicious acts intended to exploit valu...

In this work, we settle the relations among a variety of security notions related to non-malleability and CCA-security that have been proposed for commitment schemes in the literature. Interestingly, all our separations follow from two generic transformations. Given two appropriate security notions X and Y from the class of security notions we compare, these transformations take a commitment sc...

An algorithm to solve security constrained unit commitment problem (UCP) with both operational and power flow constraints (PFC) have been proposed to plan a secure and economical hourly generation schedule. This proposed algorithm introduces an efficient unit commitment (UC) approach with PFC that obtains the minimum system operating cost satisfying both unit and network constraints when contin...

This paper presents a novel hybrid method for solving the security constrained unit commitment (SCUC) problem. The proposed formulation requires much less computation time in comparison with other methods while assuring the accuracy of the results. Furthermore, the framework provided here allows including an accurate description of warmth-dependent startup costs, valve point effects, multiple f...

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the rst time thirteen years ago. Bit commitment is suucient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic aw in the protocol was discov...

The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence of the reduction, statist...

We explicitly show the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general computational assumption. The best known scheme in the literature is the one-way permutation based scheme due to Naor, Ostrovsky, Venkatesan and Yung and its round complexity is O(n). We consider a naive parallel version of their scheme of the multiplicity logn and obt...