Series arc fault is an important incentive for electrical fires. Wavelet transform is a widely used series arc fault identification method. However, it is difficult to distinguish the normal condition and arc fault when only using wavelet transform, and a large amount of redundant data will be generated. To solve this problem, this paper presents a new series arc fault identification method which based on wavelet transform and singular value decomposition. The experiment platform was built according to UL1699, and the method was verified by experiments. The method presented in this paper can well distinguish the series arc fault and normal state. The accuracy of the series arc fault identification is high, and the redundant data is greatly reduced.

Trusted Platform Module (TPM) is a coprocessor for detecting platform integrity and attesting the integrity to the remote entity. There are two obstacles in the application of TPM: minimizing trusted computing base (TCB) for reducing risk of flaws in TCB, for which a number of convincing solutions have been developed; formal guarantees on each level of TCB, where the formal methods on analyzing the application level have not been well addressed. To the best of our knowledge, there is no general formal framework for developing the TPM-based protocol applications, which not only guarantees the security but also makes it easier for design. In this paper, we make fine-grained refinement on TPM-based security protocols to illustrate our formal solution on the application level by using the Event-B language. First, we modify the classical Dolev-Yao attacker model, which assumes normal entity's compliance with the protocol even without TPM's protection. Thus, the classical security protocols are vulnerable in this modified attacker model. Second, we make stepwise refinement of the security protocol by refining the protocol events and adding security constraints. From the fifth refinement, we make a case study to illustrate the entire refinement and further formally prove the key agreement protocol from DAAODV, the TPM-based routing protocol, under the extended Dolev-Yao attacker model. The refinement provides another way of formal modeling the TPM-based security protocols and a more fine-grained model to satisfy with the rigorous security requirement of applying TPM. Finally, we prove all the proof obligations generated by Rodin, an Eclipse-based IDE for Event-B, to ensure the soundness of our proposal.

Data mining is an important technology for the information society. Due to the limited computation resources of data owners and the prevalence of cloud computing, outsourced data mining is becoming more and more attractive. The privacy and security issues are becoming outstanding recently. Though the existing model of cloud computing consists of multiple data owners, there is little consideration for the collaboration between them. But such collaboration is necessary with the trend of data partition among different entities nowadays. Besides, most of the existing work are based on the semi-honest cloud assumption and can not deal with the malicious cloud situation well. In this paper, we explore the secure and practical outsourced collaborative data mining scheme in cloud computing scenarios. We design a simple framework for it and propose several enhanced frameworks and detailed schemes in an incremental way with stronger security considerations. The final framework utilizes trusted computing technology to design the scheme under the malicious cloud assumption. Finally, we give a summary of security and efficiency analysis about them. As a case of study, we prove the correctness of the frameworks with three classical methods KNN, K-means and SVM respectively in such outsourced collaborative computing scenario.

With the rapid development of MANET, the secure and practical authentication problem in it increasingly becomes outstanding. The existing work study the problem from two aspects, i.e. secure key division/distributed storage and secure distributed authentication. But existing cheating problems and fault attack possibility will break the security. Besides, efficiency performance of such schemes is not good enough due to the exponential arithmetic with Shamir's scheme. Due to these problems above, we explore the property of verifiable secret sharing(VSS) schemes with Chinese Remainder Theorem(CRT). Then a secret key distributed storage scheme based on CRT-VSS and trusted computing is proposed for MANET. We utilize trusted computing technology to solve two existing cheating problems in secret sharing area before. After that we do some analysis of the homomorphism property with CRT-VSS scheme. Compared with the secure shares-product sharing scheme based on Shamir's scheme, we design the corresponding scheme base on CRT-VSS scheme with better concision and equal security later. On such basis, a distributed Elliptic Curve-Digital Signature Standard signature (ECC-DSS) authentication scheme based on CRT-VSS scheme and trusted computing is proposed. The choice of the trusted authentication node can eliminates the possibility of traditional DoS and fault attack. At last, we do some security analysis towards our schemes proposed above.