检索结果-内蒙古大学图书馆

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xu Yang Joseph K. Liu Wei Wu Man Ho Au Willy Susilo Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University China and State Key Laboratory of Cryptology Beijing China Faculty of Information Technology Monash University Australia Department of Computing Hong Kong Polytechnic University Hong Kong School of Computer Science and Software Engineering University of Wollongong Australia

Electric Vehicle (EV) infrastructure is relatively new in many countries. Due to the recency of an EV infrastructure, it is important to carry out a series of testing programs. Furthermore, authenticity for collection of data is necessary for testing programs in order to provide accurate results. At the same time, user privacy should not cease since tracing one's daily logistic movements or behaviour from the EV testing programs means breaching one's privacy. In this paper, we propose a novel solution PEVTS for enabling both data authenticity and user privacy concurrently. Our proposed system provides great flexibility to the authority to choose any arbitrary set of authenticated users for testing in every time period. At the same time, it provides anonymity for all participating users. Yet it can trace any vehicle within a time period for statistical purpose. We give a detailed description of our system. We also implement the prototype of our system to show its practicality.

关键词： Testing Privacy Cryptography Electric vehicles Data privacy Authentication

来源：评论

学校读者我要写书评

暂无评论

ESSVCS: An enriched secret sharing visual cryptography

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8363卷 1-24页

作者： Liu, Feng Yan, Wei Q. Li, Peng Wu, Chuankun State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China School of Computing and Mathematical Sciences Auckland University of Technology 1142 New Zealand Department of Mathematics and Physics North China Electric Power University Baoding Hebei 071003 China

Visual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we propose a general method to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k,t,n)-VC scheme. Compared to those existing schemes, our approach could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Independent component analysis based on information bottleneck

Abstract and Applied Analysis

引用

Abstract and Applied Analysis 2015年第1期2015卷

作者： Ke, Qiao Zhang, Jiangshe Srivastava, H.M. Wei, Wei Chen, Guang-Sheng School of Mathematics and Statistics Xi'An Jiaotong University Xi'an 710049 China Department of Mathematics and Statistics University of Victoria Victoria V8W3R4 BC Canada School of Computer Science and Engineering Xi'An University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an 710048 China Department of Construction and Information Engineering Guangxi Modern Vocational Technology College Hechi Guangxi 547000 China

The paper is mainly used to provide the equivalence of two algorithms of independent component analysis (ICA) based on the information bottleneck (IB). In the viewpoint of information theory, we attempt to explain the two classical algorithms of ICA by information bottleneck. Furthermore, via the numerical experiments with the synthetic data, sonic data, and image, ICA is proved to be an edificatory way to solve BSS successfully relying on the information theory. Finally, two realistic numerical experiments are conducted via FastICA in order to illustrate the efficiency and practicality of the algorithm as well as the drawbacks in the process of the recovery images the mixing images. © 2015 Qiao Ke et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Zhu-Feng-Yau’s Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & Technology 2013年第4期28卷 743-748页

作者：葛爱军黄欣沂陈成马传贵张锐 State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer ScienceFujian Normal University Institute of Software Chinese Academy of Sciences

Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.＇s proof.

关键词： attribute-based signature existential unforgeability policy-and-endorsement

来源：评论

学校读者我要写书评

暂无评论

An energy aware data-centric routing algorithm for WSNs with high energy efficiency

An energy aware data-centric routing algorithm for WSNs with...

引用

4th International Conference on information Technology for Manufacturing Systems, ITMS 2013

作者： Du, Tao Qu, Shou Ning Xu, Jing Wen Shandong Provincial Key Laboratory of Network based Intelligent Computing University of Jinan China School of Information Science and Engineering University of Jinan China Jinan Thermal Power Co. Lid China

ISBN: (纸本)9783037858783

In WSNs, energy efficiency is one of the most important factors to influence its performance, and well designed routing algorithm can obviously improve the energy efficiency. Because data-centric routing algorithm is easy to be deployed and has more robust in application, many new algorithms are proposed based on this type. In this paper, some typical existing routing algorithms are analyzed, and the characters of these algorithms are introduced. According to these analyses an energy aware data-centric routing algorithm named EADC is proposed. In EADC, the nodes' residual energy is considered when transmitting route is selected. And to ensure nodes' energy information acute, a special package head and a link storing neighbor nodes are defined to update nodes' energy information when transmitting message. Through these designs, the route can be dynamic adjusted to make the energy consumption more reasonable. At last, EADC is compared with other typical routing algorithms in a series of experiments, and the experiments' result proves that EADC has obviously improved the WSNs' energy efficiency. © (2013) Trans Tech Publications, Switzerland.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

DMAT: A new network and computer attack classification

引用

Journal of Engineering Science and Technology Review 2013年第5期6卷 101-106页

作者： Jiang, Wei Tian, Zhi-Hong Cui, Xiang College of Computer Science Beijing University of Technology Beijing 100124 China School of Computer National University of Defense Technology Changsha 410073 China Key Laboratory of Information and Network Security Ministry of Public Security Shanghai 201204 China School of Computer Science and Technology Harbin Institute of Technology Haerbin 150001 China The Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

With the rapid development of computer network and information technology, the Internet has been suffering from a variety of security attacks over the past few years. Attacks have become both numerous and complex, and the defender can not understand. In order to understand and defend against cyber attacks, it is necessary to understand the kind of attack. In this paper, we study computer and network attacks, and introduce a classification of them and propose a cyber attack classification called DMAT (Defense-oriented Multidimensional Attack Taxonomy). We use nine categories to describe the characteristic of the attack, which are attack target, attack impact, attack purpose, attack cost, attack exploiting, attack source, attack automation, attack loss and defense. The ninth category in the DMAT, classification by defense, is used to provide the defender with instructions of how to defense an attack. Compared to the existing taxonomies, our taxonomy efficiently classifies complex attacks and guide the defender to defense the possible attack. © 2013 Kavala Institute of Technology. All rights reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

A secret enriched visual cryptography

A secret enriched visual cryptography

引用

11th International Workshop on Digital Forensics and Watermaking, IWDW 2012

ISBN: (纸本)9783642400988

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks 1

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

fast Unbalanced Three-phase Adjustment base on Single-phase Load Switching

引用

Telkomnika - Indonesian Journal of Electrical Engineering 2013年第8期11卷 4327-4334页

作者： Zheng, Yanwei Zou, Lisheng He, Jian Su, Yongyi Feng, Zhiquan Shandong Provincial Key Laboratory of Network based Intelligent Computing School of Information Science and Engineering University of Jinan 106 Jiwei road 250022 Jinan city China Department of Production and Technology Linyi Power Supply Corp. 130 Jinqueshan road 276001 Linyi city China

To balance three-phase loads in distribution network with abundant of single-phase loads, a new wiring method and three-phase loads adjustment policy was proposed in this paper. In the wiring method, a single-phase load was connected with phase A, B and C of trunk line by a controller. When the load of trunk line was unbalanced, the controller will switch the connected single-phase loads from one phase to another to balance it. The minimum count of loads adjustment algorithm and the most balance adjustment algorithm were proposed, which can adjust the three-phase load of trunk line to roughly balance automatically. This method can solve the serious three-phase unbalance problems of the trunk lines with aboundant of single-phase loads. It may instead of capacitive compensation in low voltage distribution network to improve power quality and reduce network losses. © 2013 Universitas Ahmad Dahlan.

关键词： Electric wiring

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “A variable-length model for masquerade detection” [J. Syst. Softw. 85 (2012) 2470–2478]

引用

Journal of Systems and Software 2013年第3期86卷 868-868页

作者： Xi Xiao Xinguang Tian Qibin Zhai Shutao Xia Graduate School at Shenzhen Tsinghua University 518055 Shenzhen China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences 100049 Beijing China Key Laboratory of Network Science and Technology Institute of Computing Technology Chinese Academy of Sciences 100190 Beijing China

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：