The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

/pdf/a-break-in-the-clouds-towards-a-cloud-definition-svovsw1r5a.pdf

A Break in the Clouds: Towards a Cloud Definition

Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian.In this paper a computational complexity theory of the “knowledge” contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity. These are the first examples of zero-knowledge proofs for languages not known to be efficiently recognizable.

/pdf/the-knowledge-complexity-of-interactive-proof-systems-31apre0ecf.pdf

The knowledge complexity of interactive proof-systems

Thanks to advances in wide-area network technologies and the low cost of computing resources, Grid computing came into being and is currently an active research area. One motivation of Grid computing is to aggregate the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal, an efficient Grid scheduling system is an essential part of the Grid. Rather than covering the whole Grid scheduling area, this survey provides a review of the subject mainly from the perspective of scheduling algorithms. In this review, the challenges for Grid scheduling are identified. First, the architecture of components involved in scheduling is briefly introduced to provide an intuitive image of the Grid scheduling process. Then various Grid scheduling algorithms are discussed from different points of view, such as static vs. dynamic policies, objective functions, applications models, adaptation, QoS constraints, strategies dealing with dynamic behavior of resources, and so on. Based on a comprehensive understanding of the challenges and the state of the art of current research, some general issues worthy of further exploration are proposed.

/pdf/scheduling-algorithms-for-grid-computing-state-of-the-art-2ds7x5glks.pdf

Scheduling Algorithms for Grid Computing: State of the Art and Open Problems

Dynamic Taint Analysis for Automatic Detection, Analysis, and Signature Generation of Exploits on Commodity Software, Network and Distributed System Security Symposium Conference Proceedings : 2005

The Software-Defined Network (SDN) is a new and promising network architecture. At the same time, SDN will surely become a new target of cyber attackers. In this paper, we point out one critical vulnerability in SDNs, the size of flow table, which is most likely to be attacked. Due to the expensive and power-hungry features of Ternary Content Addressable Memory (TCAM), a flow table usually has a limited size, which can be easily disabled by a flow table overloading attack (a transformed DDoS attack). To provide a security service in SDN, we proposed a QoS-aware mitigation strategy, namely, peer support strategy, which integrates the available idle flow table resource of the whole SDN system to mitigate such an attack on a single switch of the system. We established a practical mathematical model to represent the studied system, and conducted a thorough analysis for the system in various circumstances. Based on our analysis, we found that the proposed strategy can effectively defeat the flow table overloading attacks. Extensive simulations and testbed-based experiments solidly support our claims. Moreover, our work also shed light on the implementation of SDN networks against possible brute-force attacks.

Defending Against Flow Table Overloading Attack in Software-Defined Networks

With the rapid development of Industrial Internet of Things, the category and quantity of industrial equipment will increase gradually. For centralized monitoring and management of numerous and multivariate equipment in the intelligent manufacturing process, the equipment categories shall be identified first. However, manual labeling of electrical equipment needs high costs. For the purpose of recognizing industrial equipment accurately in manufacturing systems, this study adopts the long short-term memory to analyze big data features and build a nonintrusive load monitoring system. Edge computing is used to implement parallel computing to improve the efficiency of equipment identification. Considering the practical popularity, the fairly priced low-frequency Smart Meter is used to collect the appliance data. According to the proposed optimal adjustment strategy of parameter model, the average random recognition rate can achieve 88% and the average recognition rate of the continuous data of a single electrical equipment can achieve 83.6%.

LSTM and Edge Computing for Big Data Feature Recognition of Industrial Electrical Equipment

When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other sibling instances, and hence to ensure high service availability in a cloud computing environment. This paper presents SHelp, a lightweight runtime system that can survive software failures in the framework of virtual machines. It applies weighted rescue points and error virtualization techniques to effectively make applications by-pass the faulty path. A two-level storage hierarchy is adopted in the rescue point database for applications running on different virtual machines to share error handling information to reduce the redundancy and to more effectively and quickly recover from future faults caused by the same bugs. A Linux prototype is implemented and evaluated using four web server applications that contain various types of bugs. Our experimental results show that SHelp can make server applications to recover from these bugs in just a few seconds with modest performance overhead.

SHelp: Automatic Self-Healing for Multiple Application Instances in a Virtual Machine Environment

In data-intensive applications, such as high-energy physics, bio-informatics, we encounter applications involving numerous jobs that access and generate large datasets. Effective scheduling of such applications is a challenge, due to the need to consider for both computational resources and data storage resources. In this paper, we describe an adaptive scheduling model that considers availability of computational, storage and network resources. Based on this model we implement a scheduler used in our campus grid. The results achieved by our scheduler have been analysed by comparing with greedy algorithm that is widely used in computational grids and some data grids.

An adaptive meta-scheduler for data-intensive applications

Industrial cyber-physical-social systems (CPSSs), a prominent data-driven paradigm, tightly couple and coordinat social space into cyber-physical systems (CPSs) within industrial environments. With the proliferation of cloud-fog computing, cloud-fog computing becomes the most prominent computing paradigm used to implement industrial data analysis. However, the open environment of cloud-fog computing and the limited control of industrial CPSSs users make industrial data analysis without compromising users' privacy one great research challenge in practical cloud-fog-based industrial applications. High-order Bi-Lanczos (HOBI-Lanczos) approach has shown remarkable success in heterogeneous data analysis in industrial applications. In this paper, a novel privacy preserving HOBILanczos approach using tensor train in cloud-fog computing is proposed for industrial data applications. Specifically, a privacy preserving industrial data analysis model using cloud-fog computing and tensor train is firstly proposed. The proposed model enables fogs and clouds to securely carry out industrial data analysis for large-scale tensors given in a tensor train format. In addition, by using this model, a privacy preserving HOBILanczos approach is provided. Last but not least, by using a brain-controlled robot system case study, the proposed approach is theoretically and empirically analyzed. Our proposed approach is proven to be secure. A series of experiments corroborate the superiority of the proposed approach in cloud-fog computing for industrial applications.

Weizhong Qiang

Papers

Defending Against Flow Table Overloading Attack in Software-Defined Networks

LSTM and Edge Computing for Big Data Feature Recognition of Industrial Electrical Equipment

SHelp: Automatic Self-Healing for Multiple Application Instances in a Virtual Machine Environment

An adaptive meta-scheduler for data-intensive applications

Privacy Preserving High-Order Bi-Lanczos in Cloud-Fog Computing for Industrial Applications