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

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

来源：评论

学校读者我要写书评

暂无评论

AxPUE: Application level metrics for power usage effectiveness in data centers

AxPUE: Application level metrics for power usage effectivene...

引用

2013 IEEE International Conference on Big Data, Big Data 2013

作者： Zhou, Runlin Shi, Yingjie Zhu, Chunge National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China State Key Laboratory Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479912926

The rapid growth of data volume brings big challenges to the data center computing, and energy efficiency is one of the most concerned problems. Researchers from various fields are now proposing solutions to green the data center operations. Power usage effectiveness metric plays an important role in the energy saving research. However, the exising usage effectiveness metrics focus on measuring the relationship between the total facility energy consumed and the IT equipment energy consumed, without reflecting the energy efficiency of applications. In this paper, we analyze the requirements of application-level metrics for power usage efficiency of the data centers, and propose two novel energy efficiency metrics to provide strong guidance and useful insight to data center design and optimization. © 2013 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Accountable authority identity-based encryption with public traceability 1

引用

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

作者： Lai, Junzuo Deng, Robert H. Zhao, Yunlei Weng, Jian School of Information Systems Singapore Management University Singapore Singapore Software School Fudan University China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

At Crypto'07, Goyal introduced the notion of accountable authority identity-based encryption (A-IBE) in order to mitigate the inherent key escrow problem in identity-based encryption, and proposed two concrete constructions. In an A-IBE system, if the private key generator (PKG) distributes a decryption key or produces an unauthorized decryption box for a user maliciously, it runs the risk of being caught and sued in the court of law with the help of a tracing algorithm. Subsequent efforts focused on constructions of A-IBE schemes with enhanced security. In these A-IBE constructions, the tracing algorithm needs to take a user's decryption key as input. If the user lost his key or is deliberately uncooperative in court, then we cannot implicate the PKG or the user. An interesting open problem left by Goyal et al. at CCS'08 is to consider the possibility of tracing a decryption box using only a public tracing key, or with the assistance of a tracing authority. In this paper, we address this problem positively. We first extend the original model of A-IBE to accommodate public traceability, and then propose an A-IBE scheme in the new model. To the best of our knowledge, the proposed scheme is the first A-IBE with public traceability. © 2013 Springer-Verlag.

关键词： Accountable Authority Identity Based Encryption Public Traceability

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of 2-layer nonlinear piece in hand method

Cryptanalysis of 2-layer nonlinear piece in hand method

引用

CD-ARES 2013 Workshops: 2nd International Workshop on Modern Cryptography and security Engineering, MoCrySEn 2013 and 3rd International Workshop on security and Cognitive Informatics for Homeland Defense, SeCIHD 2013

作者： Nie, Xuyun Petzoldt, Albrecht Buchmann, Johannes School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Technische Universität Darmstadt Department of Computer Science Hochschulstraße 10 64289 Darmstadt Germany State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Network and Data Security Key Laboratory of Sichuan Province China

ISBN: (纸本)9783642405877

Piece in Hand method is a security enhancement method for Multivariate Public key Cryptosystems (MPKCs). Since 2004, many types of this method have been proposed. In this paper, we consider the 2-layer nonlinear Piece in Hand method as proposed by Tsuji et al. in 2009. The key point of this method is to introduce an invertible quadratic polynomial map on the plaintext variables to construct perturbation of the original MPKC. Through our analysis, we find that the security of the enhanced scheme is mainly relying on the quadratic polynomials of this auxiliary map. The two examples proposed by Tsuji et al. for this map can not resist the Linearization Equation attack. Given a valid ciphertext, we can easily get a public key which is equivalent to the original MPKC. If there is an algorithm that can recover the plaintext corresponding to a valid ciphertext of the original MPKC, we can construct an algorithm that can recover the plaintext corresponding to a valid ciphertext of the enhanced MPKC. © IFIP International Federation for Information Processing 2013.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

A color digital watermarking in nonsampled contourlet domain using generic algorithm

A color digital watermarking in nonsampled contourlet domain...

引用

5th IEEE International Conference on Intelligent networking and Collaborative Systems, INCoS 2013

作者： Luo, Peng Wei, Ping Liu, Yi-Qun Key Laboratory of Network and Information Security of APF Department of Electronic Technology Engineering University of APF Xi'an 710086 China Laboratory-Center of Computer Department of Information Engineering Engineering University of APF China Xi'an 710086 China Department of Electronic Technology Engineering University of Armed Police Force Xi'an 710086 China

ISBN: (纸本)9780769549880

A novel watermarking approach for copyright protection of color images based on the nonsubsampled contour let transform (NSCT). We employ the genetic algorithm optimization principles and HVS masking technique to obtain high robustness and transparency with respect to the existing algorithms. In our scheme, the embedding factor is controlled locally according to the result of Generic Algorithm (GA) cycle. The simulation results show that the proposed algorithm yields a watermark which is invisible to human eyes and robust to a wide variety of common attacks. © 2013 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a bimodal face recognition system

Design and implementation of a bimodal face recognition syst...

引用

4th International Conference on Intelligence Science and Big Data Engineering, IScIDE 2013

作者： Xu, Yong Yang, Jian Xu, Jiajie Zhu, Qi Fan, Zizhu Bio-Computing Center Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Key Laboratory of Network Oriented Intelligent Computation Shenzhen China School of Computer Science and Technology Nanjing University of Science and Technology Nanjing China School of Basic Science East China Jiaotong University Nanchang China

ISBN: (纸本)9783642420566

Visible light face images usually have a high resolution;however, the performance of face recognition using visible light face images is usually affected by the varying illumination. It seems that near infrared face recognition might be little influenced by the varying illumination, whereas near infrared face images usually have a low resolution and some facial marks such as scars and moles cannot be reflected by the image. In this paper, we develop a low-cost bimodal face recognition system. The system first captures the visible light and near infrared images of the face and then integrates them for face recognition. The paper also proposes a score level fusion method to combine visible light and near infrared face images for face identification. The experimental results show that the proposed method performs very well in bimodal face recognition. Moreover, the paper provides a true bimodal face image database, in which the visible light and near infrared face images are captured simultaneously. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Chinese emotion lexicon developing via multi-lingual lexical resources integration

Chinese emotion lexicon developing via multi-lingual lexical...

引用

14th Annual Conference on Intelligent Text Processing and Computational Linguistics, CICLing 2013

作者： Xu, Jun Xu, Ruifeng Zheng, Yanzhen Lu, Qin Wong, Kai-Fai Wang, Xiaolong Key Laboratory of Network Oriented Intelligent Computation Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong Department of SEEM Chinese University of Hong Kong Hong Kong Hong Kong Key Laboratory of High Confidence Software Technologies Ministry of Education China

ISBN: (纸本)9783642372551

This paper proposes an automatic approach to build Chinese emotion lexicon based on WordNet-Affect which is a widely-used English emotion lexicon resource developed on WordNet. The approach consists of three steps, namely translation, filtering and extension. Initially, all English words in WordNet-Affect synsets are translated into Chinese words. Thereafter, with the help of Chinese synonyms dictionary (Tongyici Cilin), we build a bilingual undirected graph for each emotion category and propose a graph based algorithm to filter all non-emotion words introduced by translation procedure. Finally, the Chinese emotion lexicons are obtained by expanding their synonym words representing the similar emotion. The results show that the generated-lexicons is a reliable source for analyzing the emotions in Chinese text. © 2013 Springer-Verlag.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Collaborative filtering algorithm integrating trust and preference of user's emotion

引用

Ruan Jian Xue Bao/Journal of Software 2013年第SUPPL.2期24卷 61-72页

作者： Qin, Ji-Wei Zheng, Qing-Hua Tian, Feng Wang, Kang Key Laboratory for Intelligent Networks and Network Security of Ministry of Education Xi'an 710049 China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an 710049 China Center for Educational Technology Xinjiang University Urumqi 830046 China

Taking user's emotion regulation as application background, this paper presents a collaborative filtering algorithm integrating trust and preference of user's emotion to meet user's emotional needs. Firstly, a user preference model based on ratings and trust is presented to address the scalability issue of user preference model in collaborative filtering. The proposed model uses the number of ratings to set two thresholds to extend the calculation strategy of user similarity weight to selectively assign the trust value and correlation to the rating value in the user preference model. Secondly, in the process of producing the candidate set of items, the emotional connotation of items is customized. The user preference for emotional connotation of item is introduced to make up for the neglect of user's emotions in collaborative recommendation. Experimental results show that the presented algorithm has good scalability and therefore improves user satisfaction. © Institute of Software Chinese Academy of Sciences.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

LSB replacement steganography software detection based on model checking

LSB replacement steganography software detection based on mo...

引用

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

作者： Zhao, Zheng Liu, Fenlin Luo, Xiangyang Xie, Xin Yu, Lu Department of Network Engeering Zhengzhou Information Science and Technology Institute Zhengzhou 450002 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Science Beijing 100093 China Department One Academy of National Defense Information 430000 Wuhan China

ISBN: (纸本)9783642400988

Steganography software detection is one of effective approaches for steganography forensics using software analysis. In this paper a method of LSB replacement steganography software detection is proposed. Firstly three typical implementations of LSB replacement algorithms are analyzed and Finite Automatons description of them are presented. Secondly the control flow automatons are constructed for softwares to be detected. Finally, the model checking method for identifying LSB replacement steganography software is adopted. Experimental results show that the proposed method can reliably detect LSB replacement steganography softwares of different versions and those that are reimplemented relatively. © 2013 Springer-Verlag.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Improvement on Ahn et al.'s RSA P-homomorphic signature scheme

Improvement on Ahn et al.'s RSA P-homomorphic signature sche...

引用

8th International ICST Conference on security and Privacy in Communication networks, SecureComm 2012

作者： Wang, Zhiwei College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100190 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu 210003 China

ISBN: (纸本)9783642368820

P-homomorphic signature is a general framework for computing on authenticated data, which is recently proposed by Ahn et al. With P-homomorphic signature, any third party can derive a signature on the object message m′ from a signature of m, if m′ and m satisfy P(m,m′) = 1 for some predicate P which denotes the authenticatable relationship between m′ and m. Ahn et al. proposed a RSA P-homomorphic signature scheme by using a RSA accumulator, which is very efficient in space. However, the computational cost of verification and derivation is very heavy. We present an improved P-homomorphic signature scheme based on factoring problem. In our construction, the time efficiency of both verification and derivation are much better than Ahn's scheme. © 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：