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

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

来源：评论

学校读者我要写书评

暂无评论

A Time Synchronization Method of Wireless Sensor networks Based on the Simulated Annealing Algorithm

A Time Synchronization Method of Wireless Sensor Networks Ba...

引用

第26届中国控制与决策会议

作者： Fuqiang Wang Xiaoming Wu Yong Pang Changbin Yu Yifan Hu Xiangzhi Liu Shandong Computer Science Center Shandong Academy of Sciences Shandong Provincial Key Laboratory Of Computer Network College of Information Science and Engineering Shandong University of Science and Technology Shandong University The Australian National University and NICTA Ltd

ISBN: (纸本)9781479937097

Time synchronization is very important for a Time Division Multiple Access(TDMA) Wireless Sensor networks(WSNs). In this paper, we introduce a new method of time synchronization for WSNs based on the simulated annealing algorithm which is endowed with the search process of a time-varying and can effectively avoid falling into the local minimum and finally tends to the global optimum. Errors between the global time and prediction time are used as the evaluation function from which we can obtain more stable time synchronization. Our method is implemented on SCSC-RFA1 platform and the results show the validity of the method.

关键词： Wireless Sensor networks,Time Synchronization,Simulated Annealing,Intelligent Analysis

来源：评论

学校读者我要写书评

暂无评论

Robust Watermarking Algorithm for Digital Image Based on SIFT Feature Points

Robust Watermarking Algorithm for Digital Image Based on SIF...

引用

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Xinguo Zou Na Li Nawei Ji Key Laboratory of forensic evidence in Shandong Province University (Shandong University of Political Science and Law) Department of Information Science and Technology Shandong University of Political Science and Law Shandong Provincial Key Laboratory of computer Network Shandong Computer Science Center China United Network Communications Group Co. Ltd.(Briefly named "China Unicom")JiN an Branch

In this paper,we present a robust watermarking algorithm for digital image using SIFT(Scale-invariant feature transform) feature points and realizes the blind *** algorithm uses SIFT feature points on the host image to decide the embedding location and capacity,and adjusts the size of the binary watermark with Neighbor interpolation,and embeds the watermark into DCT low-frequency coefficients of some qualified sub-blocks for the host *** algorithm has the following characteristics:(1) the watermark is embedded in the DCT coefficient based on scale-invariant feature points,which can effectively resist common attacks,such as Gaussian noise-adding,salt and pepper noise-adding,cropping,Wiener filtering;(2) the watermarking detection does not require original digital *** experiments show that the algorithm has good invisibility and strong robustness.

关键词： watermarking scale-invariant feature points PSNR

来源：评论

学校读者我要写书评

暂无评论

CREST: Cluster-based representation enrichment for short text classification

引用

17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013

作者： Dai, Zichao Sun, Aixin Liu, Xu-Ying MOE Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering Southeast University Nanjing China School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9783642374555

Text classification has gained research interests for decades. Many techniques have been developed and have demonstrated very good classification accuracies in various applications. Recently, the popularity of social platforms has changed the way we access (and contribute) information. Particularly, short messages, comments, and status updates, are now becoming a large portion of the online text data. The shortness, and more importantly, the sparsity, of the short text data call for a revisit of text classification techniques developed for well-written documents such as news articles. In this paper, we propose a cluster-based representation enrichment method, namely Crest, to deal with the shortness and sparsity of short text. More specifically, we propose to enrich a short text representation by incorporating a vector of topical relevances in addition to the commonly adopted tf -idf representation. The topics are derived from the knowledge embedded in the short text collection of interest by using hierarchical clustering algorithm with purity control. Our experiments show that the enriched representation significantly improves the accuracy of short text classification. The experiments were conducted on a benchmark dataset consisting of Web snippets using Support Vector Machines (SVM) as the classifier. © Springer-Verlag 2013.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Research on the Extraction Technology of the Mass Data in Citizens' information Infringement Cases

Research on the Extraction Technology of the Mass Data in Ci...

引用

2014 International Conference on Modern Economic Technology and Management(ICMETM 2014)

作者： Wu Chunsheng Zhu Xiuyun Key Laboratory of Evidence Science(China University of Political Science and Law) Ministry of Education Computer Network Information Center Chinese Academy of Sciences The Criminal Investigation Department of Beijing Public Security Bureau

Objective The aim of this study is to explore the analysis methods of data from citizens' personal information infringement casesMethods We distinguish various types of case data according to inspection methods,and proposes three kinds of inspection methods including the methods of data conversion extraction,inspection of file size property and forensics toolsResult Extraction technologies can realize mass data inspection in different degreesConclusion The inspection methods is effective and need to develop software further

关键词： extraction technology citizens' information mass data

来源：评论

学校读者我要写书评

暂无评论

FPGA based unified architecture for public key and private key cryptosystems

引用

Frontiers of computer Science 2013年第3期7卷 307-316页

作者： Yi WANG Renfa LI Embedded Systems and Networking Laboratory Hunan Province Key Laboratory of Network and Information Security Hunan University Changsha 410082 China Department of Electrical and Computer Engineering National University of Singapore Singapore 117576 Singapore

Recently, security in embedded system arises attentions because of modern electronic devices need cau- tiously either exchange or communicate with the sensitive data. Although security is classical research topic in world- wide communication, the researchers still face the problems of how to deal with these resource constraint devices and en- hance the features of assurance and certification. Therefore, some computations of cryptographic algorithms are built on hardware platforms, such as field program gate arrays （FPGAs）. The commonly used cryptographic algorithms for digital signature algorithm （DSA） are rivest-shamir-adleman （RSA） and elliptic curve cryptosystems （ECC） which based on the presumed difficulty of factoring large integers and the algebraic structure of elliptic curves over finite fields. Usu- ally, RSA is computed over GF（p）, and ECC is computed over GF（p） or GF（2P）. Moreover, embedded applications need advance encryption standard （AES） algorithms to pro- cess encryption and decryption procedures. In order to reuse the hardware resources and meet the trade-off between area and performance, we proposed a new triple functional arith- metic unit for computing high radix RSA and ECC operations over GF（p） and GF（2P）, which also can be extended to support AES operations. A new high radix signed digital （SD） adder has been proposed to eliminate the carry propagations over GF（p）. The proposed unified design took up 28.7% less hardware resources than implementing RSA, ECC, and AES individually, and the experimental results show that our proposed architecture can achieve 141.8 MHz using approxi- mately 5.5k CLBs on Virtex-5 FPGA.

关键词： AES RSA ECC signed-digit number FPGA cryptographic algorithms high radix arithmetic unit

来源：评论

学校读者我要写书评

暂无评论

PUF-Based RFID Ownership Transfer Protocol in an Open Environment

PUF-Based RFID Ownership Transfer Protocol in an Open Enviro...

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Qing-Shan Li Xiao-Lin Xu Zhong Chen Ministry of Education Key Laboratory of Network and Software Security Assurance of Peking University Beijing China Computer Emergency Response Team Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China

In the supply chain, RFID tags are deployed more widely. In the life of the supply chain, the owner of the tag will change frequently. Ownership transfer protocol can achieve the purpose that the access rights of the tag are transferred from the original owner to the new owner, and protect the privacy of the original owner and the new owner. To resist cloning attack and side channel analysis attack, physical unclonable function (PUF) has been proposed to enhance the security of the tags. Since the PUF of each tag is unique and different, it is difficult to be forged. However, most of PUF-based authentication protocols need the response value previously stored in the readers. On the other hand, most of the ownership transfer protocols assume the original owner and the new owner has a secure channel. However, in an open environment, due to time and space constraints, such a channel is often unable to quickly established. In this paper, we studied the ownership transfer protocols in an open environment and proposed a PUF-based RFID ownership transfer protocols, PROTP. The new protocol is the first ownership transfer protocol based on the PUF in an open environment. The new protocol does not need to store the respond values of the PUF. To utilize the randomness of the PUF, it replaces the pseudo-random generator. Meanwhile, PROTP can protect the privacy of the original owner and the new owner. In terms of efficiency, since the protocol is designed to satisfy the requirement in an open environment, the total cost of the computation is more than others protocols. However, due to the new protocol utilizes the PUF to replace the pseudo-random generator, the each step of the authentication messages achieves a better optimization in computational cost.

关键词： Protocols Privacy Authentication RFID tags Resists

来源：评论

学校读者我要写书评

暂无评论

Robust watermarking algorithm for digital image based on SIFT feature points

Robust watermarking algorithm for digital image based on SIF...

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Xinguo Zou Na Li Nawei Ji Department of Information Science and Technology Shandong University of Political Science and Law Jinan PR China Shandong Provincial Key Laboratory of computer Network Shandong Computer Science Center Jinan PR China China United Network Communications Group Co. Ltd (Briefly named “China Unicom”)JiNan Branch

ISBN: (纸本)9781479932801

In this paper, we present a robust watermarking algorithm for digital image using SIFT (Scale-invariant feature transform) feature points and realizes the blind detection. The algorithm uses SIFT feature points on the host image to decide the embedding location and capacity, and adjusts the size of the binary watermark with Neighbor interpolation, and embeds the watermark into DCT low-frequency coefficients of some qualified sub-blocks for the host image. The algorithm has the following characteristics: (1) the watermark is embedded in the DCT coefficient based on scale-invariant feature points, which can effectively resist common attacks, such as Gaussian noise-adding, salt and pepper noise-adding, cropping, Wiener filtering; (2) the watermarking detection does not require original digital image. The experiments show that the algorithm has good invisibility and strong robustness.

关键词： Watermarking Feature extraction Robustness Discrete cosine transforms Digital images PSNR Interpolation

来源：评论

学校读者我要写书评

暂无评论

Corrections to “OFDM-Modulated Dynamic Coded Cooperation in Underwater Acoustic Channels” [Y. Chen, Z.-H. Wang, L. Wan, H. Zhou, S. Zhou, and X. Xu, IEEE J. Ocean. Eng., vol. 40, no. 1, pp. 159–168, Jan. 2015. DOI: 10.1109/JOE.2014.2304254

引用

IEEE Journal of Oceanic Engineering 2015年第3期40卷 752-752页

作者： Yougan Chen Zhaohui Wang Lei Wan Hao Zhou Shengli Zhou Xiaomei Xu Department of Applied Ocean Physics and Engineering Key Laboratory of Underwater Acoustic Communication and Marine Information Technology Xiamen University Ministry of Education Xiamen China Department of Electrical and Computer Engineering Michigan Technological University Houghton MI USA Department of Electrical and Computer Engineering University of Connecticut Storrs CT USA Aquatic Sensor Network Technology Storrs CT USA

Presents corrections to acknowledgements from the paper, “OFDM-Modulated Dynamic Coded Cooperation in Underwater Acoustic Channels” [Y. Chen, et al, IEEE J. Ocean. Eng., vol. 40, no. 1, pp. 159–168, Jan. 2015).

关键词： Underwater acoustics Parity check codes OFDM Underwater communication

来源：评论

学校读者我要写书评

暂无评论

Adaptively secure key-policy ABE scheme with fast decryption

引用

Tongxin Xuebao/Journal on Communications 2014年 35卷 26-32页

作者： Li, Qi Ma, Jian-Feng Xiong, Jin-Bo Liu, Xi-Meng School of Computer Science and Technology Xidian University Xi'an710071 China Shaanxi Key Laboratory of Network and System Security Xidian University Xi'an710071 China Science and Technology on Communication Information Security Control Laboratory Jiaxing314033 China Faculty of Software Fujian Normal University Fuzhou350108 China School of Telecommunication Engineering Xidian University Xi'an710071 China

In the existing adaptively secure ABE (attribute-based encryption) schemes, the decryption cost goes linearly with the number of attributes that are used in decryption. An adaptively secure key-policy ABE (FKP-ABE) scheme with fast decryption is proposed, where constant size of computation overhead is implemented in decryption. This scheme is constructed on composite order bilinear groups and supports any monotonic access structure that can be expressed by LSSS (linear secret sharing schemes). The proposed scheme is proved to be adaptively secure in the standard model. ©, 2014, Editorial Board of Journal on Communications. All right reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：