Although information security is critical for organizations to survive, a number of studies continue to report incidents of critical information loss. To this end, there is a continuous interest to study information security from a non-technical perspective. In doing so, this research focuses on organizational culture and commitment to e-banking security development and management. Even though ...

We present information-theoretically secure bit commitment, zero-knowledge and multi-party computation based on the assistance of an initialization server. In the initialization phase, the players interact with the server to gather resources that are later used to perform useful protocols. This initialization phase does not depend on the input of the protocol it will later enable. Once the init...

The security-constrained unit commitment (SCUC) challenge is solved repeatedly several times every day, for operations in a limited time. Typical mixed-integer linear programming (MILP) formulations are intertemporal nature and have complex discrete solution spaces that exponentially increase with system size. Improvements the SCUC formulation and/or method yield faster hold immense economic va...

The solution of single-objective unit commitment problems for generation companies participating in deregulated markets may not directly be implementable mainly because of neglecting some conflicting secondary objectives arising from policy-making at internal/external environment. Benefiting an efficient multi-objective approach to improve the applicability of price-based unit commitment soluti...

In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...

We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an “ideal commitment service,” even when concurrently composed with an arbitrary set of protocols. This is a strong guarantee: it implies that security is maintained even when an unbounded number of copies of the scheme are runni...

Power network operators have recently faced new challenges due to an increase in the penetration of non-dispatchable renewable energy sources power grids. Incorporating emerging flexible resources like electric vehicle parking lots (EVPLs) and demand response programs (DRPs) into systems, could be a good solution deal with inherent uncertainties imposed by these grid. EVPLs can improve system o...

UC (Unit Commitment) is a non-linear, large scale, complex, mixed-integer combinatorial constrained optimization problem. This paper proposes, a new hybrid approach for generating UC schedules using SI (Swarm Intelligence) learning rule based NN (Neural Network). The training data has been generated using DP (Dynamic Programming) for machines without valve point effects and using genetic algori...

This study aims to find ways and strategies improve service quality by analyzing the influence of other variables on quality. The are organizational support, work motivation, job satisfaction, commitment. Furthermore, methods for improving education training services found were made recommendations related parties, namely Republic Indonesia Police, leaders institutions, instructors Security Uni...

We study security amplification for commitment schemes and improve the efficiency of black-box security amplification in the computational setting, where the security holds against PPT active adversaries. We show that ω(log s) black-box calls to a weak bit-commitment scheme with constant security is sufficient to construct a commitment scheme with standard negligible security, where s denotes t...