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

作者： Bo, Yang Zhang, Mingwu Du, Jun-Qiang School of Computer Science Shaanxi Normal University Xi'an710119 China Science and Technology on Communication Security Laboratory Chengdu610041 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Computer Sciences Hubei University of Technology Wuhan430068 China

An error-tolerant keyword search scheme permits to make searches on encrypted data with only an approximation of some keyword. The scheme is suitable to the case where users' searching input might not exactly match those pre-set keywords. An error-tolerant keyword search scheme can be generated based on a public-key encryption scheme, in which anyone with access to a user's public key can generate the trapdoors and indexes to keywords, and only the user holding the decryption key can obtain the records it retrieves. In this paper, we first present a general framework for searching on error-tolerant keywords based on a public-key encryption scheme. Then, we propose a concrete scheme based on the Cramer-Shoup cryptosystem. The scheme is adaptive chosen-ciphertext attack secure and suitable for all similarity metrics including Hamming distance metric, edit distance metric, and set difference metric. It does not require the user to construct and store anything in advance, other than the cryptosystem used to calculate the trapdoor of keywords and to encrypt data documents. Thus, our scheme tremendously eases the users' burden. What is more, our scheme is able to transform the servers' searching for error-tolerant keywords on ciphertexts to searching for exact keywords on plaintexts. The server can use any existing approaches of exact keywords search to search plaintexts on an index table. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

On the Derivative Imbalance and Ambiguity of Functions

arXiv

引用

arXiv 2017年

作者： Fu, Shihui Feng, Xiutao Wang, Qiang Carlet, Claude KLMM Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Science and Technology on Communication Security Laboratory Chengdu610041 China School of Mathematics and Statistics Carleton University OttawaONK1S 5B6 Canada LAGA University of Paris 8 FRANCE University of Bergen Saint-Denis Cedex 02 Norway

In 2007, Carlet and Ding introduced two parameters, denoted by NbF and NBF, quantifying respectively the balancedness of general functions F between finite Abelian groups and the (global) balancedness of their derivatives DaF(x) = F(x + a) − F(x), a ∈ G \ {0} (providing an indicator of the nonlinearity of the functions). These authors studied the properties and cryptographic significance of these two measures. They provided for S-boxes inequalities relating the nonlinearity NL(F) to NBF, and obtained in particular an upper bound on the nonlinearity which unifies Sidelnikov-Chabaud-Vaudenay’s bound and the covering radius bound. At the Workshop WCC 2009 and in its postproceedings in 2011, a further study of these parameters was made;in particular, the first parameter was applied to the functions F + L where L is affine, providing more nonlinearity parameters. In 2010, motivated by the study of Costas arrays, two parameters called ambiguity and deficiency were introduced by Panario et al. for permutations over finite Abelian groups to measure the injectivity and surjectivity of the derivatives respectively. These authors also studied some fundamental properties and cryptographic significance of these two measures. Further studies followed without that the second pair of parameters be compared to the first one. In the present paper, we observe that ambiguity is the same parameter as NBF, up to additive and multiplicative constants (i.e. up to rescaling). We make the necessary work of comparison and unification of the results on NBF, respectively on ambiguity, which have been obtained in the five papers devoted to these parameters. We generalize some known results to any Abelian groups and we more importantly derive many new results on these *** Codes 94A60, 20K01, 11T06 Copyright © 2017, The Authors. All rights reserved.

关键词： Group theory

来源：评论

学校读者我要写书评

暂无评论

Non-Gaussian postselection and virtual photon subtraction in continuous-variable quantum key distribution

引用

Physical Review A 2016年第1期93卷 012310-012310页

作者： Zhengyu Li Yichen Zhang Xiangyu Wang Bingjie Xu Xiang Peng Hong Guo State Key Laboratory of Advanced Optical Communication Systems and Networks Center for Computational Science and Engineering and Center for Quantum Information Technology School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Science and Technology on Security Communication Laboratory Institute of Southwestern Communication Chengdu 610041 China State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications Beijing 100876 China

Photon subtraction can enhance the performance of continuous-variable quantum key distribution (CV QKD). However, the enhancement effect will be reduced by the imperfections of practical devices, especially the limited efficiency of a single-photon detector. In this paper, we propose a non-Gaussian postselection method to emulate the photon substraction used in coherent-state CV QKD protocols. The virtual photon subtraction not only can avoid the complexity and imperfections of a practical photon-subtraction operation, which extends the secure transmission distance as the ideal case does, but also can be adjusted flexibly according to the channel parameters to optimize the performance. Furthermore, our preliminary tests on the information reconciliation suggest that in the low signal-to-noise ratio regime, the performance of reconciliating the postselected non-Gaussian data is better than that of the Gaussian data, which implies the feasibility of implementing this method practically.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Comment on “Quantum oblivious set-member decision protocol”

引用

Physical Review A 2016年第3期93卷 036301-036301页

作者： Bin Liu Di Xiao Wei Huang Ting-Ting Song Key Laboratory of Dependable Service Computing in Cyber Physical Society (Chongqing University) of Ministry of Education College of Computer Science Chongqing University Chongqing 400044 China Science and Technology on Communication Security Laboratory Chengdu 610041 China Department of Computer Science College of Information Science and Technology Jinan University Guangzhou 510632 China

In a recent paper [Phys. Rev. A 92, 022309 (2015)], the authors proposed a quantum oblivious set-member decision protocol, which is designed to allow a server to check whether a private secret of a user is a member of his private set in an oblivious manner. Such protocols should protect the privacies of both the server and the user. However, we find that the user in their protocol can steal l−1 bits of information about the server's private set by sending the false decoy states.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

The security Analysis of Two-Step Quantum Direct communication Protocol in Collective-Rotation Noise Channel

引用

Chinese Physics Letters 2015年第8期32卷 1-5页

作者：李剑孙风琪潘泽世聂金瑞陈彦桦袁开国 School of Computer Beijing University of Posts and Telecommunications Beijing 100876 Hefei National Laboratory for Physical Sciences at the Microscale University of Science and Technology of China Hefei 230026 Scienee and Technology on Communication Security Laboratory Chengdu 610041

To analyze the security of two-step quantum direct communication protocol （QDCP） by using Einstein-Podolsky Rosen pair proposed by Deng et al. [Phys. Rev. A 68 （2003）042317] in collective-rotation noise channel, an excellent model of noise analysis is proposed. In the security analysis, the method of the entropy theory is introduced, and is compared with QDCP, an error rate point Qo（M ：（Q0, 1.0）） is given. In different noise levels, if Eve wants to obtain the same amount of information, the error rate Q is distinguishable. The larger the noise level ~ is, the larger the error rate Q is. When the noise level ~ is lower than 11%, the high error rate is 0.153 without eavesdropping. Lastly, the security of the proposed protocol is discussed. It turns out that the quantum channel will be safe when Q 〈 0.153. Similarly, if error rate Q〉 0.153 = Q0, eavesdropping information I 〉 1, which means that there exist eavesdroppers in the quantum channel, and the quantum channel will not be safe anymore.

关键词： The security Analysis of Two-Step Quantum Direct communication Protocol in Collective-Rotation Noise Channel EPR

来源：评论

学校读者我要写书评

暂无评论

Fluctuating Power Logic (FPL): A constructive SCA resistant scheme at transistor level

Fluctuating Power Logic (FPL): A constructive SCA resistant ...

引用

2016年密码芯片学术会议

作者： Fan Zhang Liang Geng Congyuan Xu Jizhong Shen Xinjie Zhao Shize Guo College of Information Science & Electronic Engineering Zhejiang UniversityHangzhou 310027 China College of Information Science & Electronic Engineering Zhejiang UniversityHangzhou 310027 China Science and Technology on Communication Security Laboratory Chengdu 610041China The Institute of North Electronic Equipment Beijing 100000 China

Hiding and masking are two mainstream countermeasures against side channel analysis (SCA) at cell *** power analysis, both rely on the fact that variant data transitions consume more distinguishable power than invariant *** this letter, we propose a novel scheme based on fluctuating power logic (FPL), which mitigates the side-channel effect by employing cascade voltage logic to fluctuate physical power *** proposed scheme is illustrated by a standard flip-flop which typically behaves as a major power consumer of the *** based simulation shows that the modified flip-flop is resistant against power analysis at the cost of doubled power *** proposal can be further applied to enhance various SCA-resistant logics, such as sense-amplifier based logic (SABL) and wave dynamic differential logic (WDDL).

关键词： low power flip-flop clock-gating scheme dual-edge

来源：评论

学校读者我要写书评

暂无评论

Threshold public key encryption scheme resilient against continual leakage without random oracles

引用

Frontiers of Computer science 2013年第6期7卷 955-968页

作者： Xiujie ZHANG Chunxiang XU Wenzheng ZHANG Wanpeng LI School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Science and Technology on Communication Security Laboratory The 30th Research Institute of China Electronics Technology Group Corporation Chengdu 610041 China

Threshold public key encryption allows a set of servers to decrypt a ciphertext if a given threshold of authorized servers cooperate. In the setting of threshold public key encryption, we consider the question of how to correctly decrypt a ciphertext where all servers continually leak information about their secret keys to an external attacker. Dodis et al. and Akavia et al. show two concrete schemes on how to store secrets on continually leaky servers. However, their construc- tions are only interactive between two servers. To achieve continual leakage security among more than two servers, we give the first threshold public key encryption scheme against adaptively chosen ciphertext attack in the continual leak- age model under three static assumptions. In our model, the servers update their keys individually and asynchronously, without any communication between two servers. Moreover, the update procedure is re-randomized and the randomness can leak as well.

关键词： leakage-resilient continual leakage Threshold Public Key Encryption adaptive chosen ciphertext security standard model

来源：评论

学校读者我要写书评

暂无评论

New forward-secure signature schemes with untrusted update

引用

Frontiers of Computer science 2013年第4期7卷 536-543页

作者： Wanpeng LI Chunxiang XU Wenzheng ZHANG Shixiong ZHU Xiujie ZHANG School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Science and Technology on Communication Security Laboratory The 30th Research Institute of China Electronics Technology Group Corporation Chengdu 610041 China

In this paper, we present two forward-secure signature schemes （FSS） with untrusted update. Our constructions use ideas from the work of Abdalla et al. [1] and Kozlov and Reyzin [2] in their forward-secure digital signature schemes. Our schemes are proven to be forward-secure based on the hardness of factoring in the random oracle model. Both schemes use the same method to encrypt the private key and are more efficient than Libert scheme [3] without adding any burden to the original forward-secure schemes.

关键词： forward-secure digital signature untrusted update

来源：评论

学校读者我要写书评

暂无评论

The autocorrelation distribution of balanced Boolean function

引用

Frontiers of Computer science 2013年第2期7卷 272-278页

作者： Yu ZHOU Weiguo ZHANG Juan LI Xinfeng DONG Guozhen XIAO Science and Technology on Communication Security Laboratory China Chengdu 610041 State Key Laboratory of Integrated Service Networks Xidian UniversityChina Xi'an 710071 Foreign Language Department Emei Campus Southwest Jiaotong University China Emei 614202 State Key Laboratory of Information Security Chinese Academy of SciencesChina Beijing 100093

The global avalanche characteristics （the sum- of-squares indicator and the absolute indicator） measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. （1999） gave the lower bound on the sum- of-squares indicator for a balanced Boolean function satisfy- ing the propagation criterion with respect to some vectors. In this paper, if balanced Boolean functions satisfy the propaga- tion criterion with respect to some vectors, we give three nec- essary and sufficient conditions on the auto-correlation distri- bution of these functions reaching the minimum the bound on the sum-of-squares indicator. And we also find all Boolean functions with 3-variable, 4-variable, and 5-variable reaching the minimum the bound on the sum-of-squares indicator.

关键词： Boolean functions auto-correlation distribu-tion global avalanche characteristics balanced propagationcriterion

来源：评论

学校读者我要写书评

暂无评论

New sequences of period p n and p n + 1 via projective linear groups

引用

8th China International Conference on Information security and Cryptology, INSCRYPT 2012

作者： Wang, Lin Hu, Zhi Science and Technology on Communication Security Laboratory Chengdu 610041 Sichuan China Beijing International Center for Mathematical Research Peking University Beijing 100871 China

ISBN: (纸本)9783642385186

Two pseudorandom number generators are devised based on the projective linear group over, outputting balanced sequences on meeting some statistical randomness properties. Sequences generated by the first generator have least period p n + 1 if p n ≥ 7, and linear complexity at least p n - p n - 1. Furthermore, autocorrelation of such sequences oscillates within a low amplitude except for the trivial peaks. If p n âˆ‰ {2,4,8,16}, sequences generated by the second generator have least period p n, linear complexity at least p n - 1 + 1, and good k-error linear complexity when p = 2. If p = 2 and 2 n is large enough, then for a binary sequence generated by either generator, a randomly chosen 2-tuple is almost uniformly distributed in {00,01,10,11}, the probability that a randomly chosen 3-tuple is a run of length one is approximately 1/4. For such a binary sequence and integers 0 12k ≤ m, s(t) + s(t + i 1) + s(t + i 2) + â"¯ + s(t + i k ) is equal to 0 or 1 at almost the same probability when m is far less than 2 n/2. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Autocorrelation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：