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

Unified and Complete Point Addition Formula for Elliptic Curves

电子学报(英文版) 2012年第2期21卷 345-349页

作者： ZHANG Lijun WANG Kunpeng WANG Hong Science and Technology on Communication Security Laboratory Chengdu 610041 China State Key Laboratory of Information Security GUCAS Beijing 100049 China

As is well known, the unified point addition formula is useful for resisting side channel attacks in elliptic curve cryptography. Furthermore, if the unified formula is complete, which means it is valid for any two points, then there are no exceptional cases to be described particularly. This feature is especially preferable for elegant codes of elliptic crypto-algorithms. Therefore, the unified and also complete point addition formula can provide the advantage for good security and convenient implementation. In this paper, we exploit sufficient and necessary condition for the existence of unified and complete point addition formula on several known elliptic curve models such as Weierstrass cu- bics, Jacobi quartics, Edwards curves, etc.. Moreover, we study another form of elliptic curves called Selmer curves. For practical application, we finally give some numerical examples of cryptographic secure Selmer curves.

关键词：椭圆曲线加密加法公式维尔斯特拉斯统一公式加密算法曲线模型密码安全安全性

来源：评论

学校读者我要写书评

暂无评论

Research on privacy information retrieval model based on hybrid homomorphic encryption

引用

Cybersecurity 2024年第4期7卷 52-61页

作者： Wei-tao Song Guang Zeng Wen-zheng Zhang Dian-hua Tang Science and Technology on Communication Security Laboratory.Chengdu 610041 China Zhejiang University Hangzhou 311200China PLA SSF Information Engineering University Zhengzhou 450000China College of Computer Science and Technology National University of Defense TechnologyChangsha 410073China

The computational complexity of privacy information retrieval protocols is often linearly related to database *** the database size is large,the efficiency of privacy information retrieval protocols is relatively *** paper designs an effective privacy information retrieval model based on hybrid fully homomorphic *** assignment method is cleverly used to replace a large number of homomorphic encryption *** the same time,the multiplicative homomorphic encryption scheme is first used to deal with the large-scale serialization in the search,and then the fully homomorphic encryption scheme is used to deal with the remaining simple *** depth of operations supported by the fully homomorphic scheme no longer depends on the size of the database,but only needs to support the single homomorphic encryption scheme to decrypt the circuit *** on this hybrid homomorphic encryption retrieval model,the efficiency of homomorphic privacy information retrieval model can be greatly improved.

关键词： Cryptography Hybrid homomorphic encryption Privacy protection Private information retrieval

来源：评论

学校读者我要写书评

暂无评论

Quantum proof and high-speed privacy amplification for quantum key distribution

引用

Physical Review Applied 2025年第5期23卷 054004-054004页

作者： Bing-Qi Yan Jun-Bin Wu Fan Fan Bing-Jie Xu Xiao-Ling Zhang Min Gu Key Laboratory of Atomic and Subatomic Structure and Quantum Control (Ministry of Education) Guangdong Basic Research Center of Excellence for Structure and Fundamental Interactions of Matter School of Physics South China Normal University Guangzhou 510006 China Guangdong Provincial Key Laboratory of Quantum Engineering and Quantum Materials Guangdong-Hong Kong Joint Laboratory of Quantum Matter South China Normal University Guangzhou 510006 China Quantum Science Center of Guangdong-HongKong-Macao Greater Bay Area (Guangdong) Shenzhen 518000 China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu 611731 China National Key Laboratory of Security Communication Institute of Southwestern Communication Chengdu 610041 China

Privacy amplification (PA) is a vital step in the postprocessing stage of quantum key distribution, which can extract a secure key from a source partially leaked to the environment. We propose a PA scheme that uses the square hash (SQH)–modular arithmetic hash (MH) function. In consideration of a potential quantum attacker, we use the trace distance as a metric to measure the closeness between two classical-quantum states. We transform a raw key state to a processed state using this scheme and derive the trace distance between the processed state and the ideal target state. It is proven that the trace distance can be reached as small as desired. Additionally, our approach accelerates the SQH-MH function through the number-theoretic transform, reducing the computational complexity to O(nlog n). On the basis of a CPU, a maximum throughput rate of 1.06 Gbit/s is achieved, and the results show that our algorithm demonstrates good stability of the throughput rate when handling tasks with different compression ratios.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fast Decryption of Excel Document Encrypted by RC4 Algorithm 20

Fast Decryption of Excel Document Encrypted by RC4 Algorithm

引用

20th IEEE International Conference on communication technology, ICCT 2020

作者： Zhang, Lijun Tan, Cheng Yu, Fei Science and Technology on Communication Security Laboratory Chengdu610041 China

ISBN: (纸本)9781728181417

In this paper, we give a fast decryption method of Excel document encrypted by RC4 algorithm. Through a detailed analysis of document storage structure and encryption process, we illustrate the inner principle of key generation and data encryption in the block by block manner. We present an efficient way of recovering the intermediate key by using rainbow table attack, which can be directly applied to decrypt the Excel document. The advantage of our method is that the decryption time of one document is no longer affected by the password length and complexity. In our practical test, it has achieved the decryption of Excel encrypted documents in an average of 3 minutes on a common personal computer, which greatly improves decryption efficiency of encrypted documents compared with the current dictionary and brute force attack methods of recovering document password. © 2020 IEEE.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Construction of Nonlinear Optimal Diffusion Functions over Finite Fields 8

Construction of Nonlinear Optimal Diffusion Functions over F...

引用

8th International Conference on communication and Information Processing, ICCIP 2022

作者： Shen, Bing Zhou, Yu Science and Technology on Communication Security Laboratory Chengdu610041 China

ISBN: (纸本)9781450397100

The diffusion function with large branch number is a fundamental building block in the construction of many block ciphers to achieve provable bounds against differential and linear cryptanalysis. Conventional diffusion functions, which are constructed based on linear error-correction code, has the undesirable side effect that a linear diffusion function by itself is "transparent"(i.e., has transition probability of 1) to differential and linear cryptanalysis. Nonlinear diffusion functions are less studied in cryptographic literature, up to now. In this paper, we propose a practical criterion for nonlinear optimal diffusion functions. Using this criterion we construct generally a class of nonlinear optimal diffusion functions over finite field. Unlike the previous constructions, our functions are non-linear, and thus they can provide enhanced protection against differential and linear cryptanalysis. © 2022 ACM.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient key agreement mechanism for underwater sensor networks 7th

An energy-efficient key agreement mechanism for underwater s...

引用

7th International Conference on IT Convergence and security, ICITCS 2017

作者： Zhao, Yue Tian, Bo Chen, Zhouguo Liu, Yiming Ding, Jianwei Science and Technology on Communication Security Laboratory Chengdu610041 China

ISBN: (纸本)9789811064531

The key agreement mechanisms are designed according to different communication links of underwater sensor networks. Combined with the underwater nodes deployment and geographic location information, the key agreement mechanism, which using the elliptic curve point multiplication with lower computational overhead, can support the identity authentication and session key agreements between the nodes on the non-bidirectional links, and resist Sybil attacks, replay attacks, spoofed node attacks, node replication attacks, and so on. Extensive simulations demonstrate that the proposed energy-efficient key agreement mechanism has better security and network performance, especially reducing the energy consumption of low-performance sensor nodes. The underwater sensor networks can achieve high network connectivity, meanwhile guaranteeing that the energy consumption of the cluster-head node and sensor node is less then 20 J and 10 J respectively. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

New bounds on the sum-of-squares indicator

New bounds on the sum-of-squares indicator

引用

2012 7th International ICST Conference on communications and Networking in China, CHINACOM 2012

作者： Zhou, Yu Dong, Xinfeng Zhang, Wenzheng Zeng, Bing Science and Technology on Communication Security Laboratory Chengdu 610041 China

ISBN: (纸本)9781467326995

The two indicators the sum-of-squares indicator and the absoluate indicator between two different Boolean functions f and g are introduced by Yu Zhou, Min Xie, Guozhen Xiao, On the global avalanche characteristics of two Boolean functions and the higher order nonlinearity. Information sciences. 180(2010) 256-265, to measure of cryptographic behavior in a global manner. In this paper, we derive a new bound on the sum-of-squares indicator. Moreover, we obtain some bounds on the sum-of-squares indicator of a Boolean function f by using two decomposition functions f1, f2. Finally, we give a method to construct balanced Boolean functions with n(n >= 6) variables by the disjoint spectra functions, where n is an even integer, satisfying strict avalanche criterion, high nonlinearity and lower GAC. © 2012 IEEE.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Preserving Gait Recognition Scheme Under Homomorphic Encryption

A Privacy-Preserving Gait Recognition Scheme Under Homomorph...

引用

2022 International Conference on Networking and Network Applications, NaNA 2022

作者： Lin, Leyu Tian, Bo Zhao, Yue Niu, Yiru Science and Technology on Communication Security Laboratory Chengdu610041 China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

In recent years, machine learning and deep neural networks have achieved remarkable results and have been widely used in different domains. Affected by COVID-19, the potential of gait feature recognition in biometric authentication has gradually emerged. However, machine learning algorithms are generally demanded in terms of computing power, sometimes need the support of cloud service providers, and require raw data, which is often sensitive, most privacy-preserving approaches only encrypted the trained model, and the data collected from users are unprotected. We propose a scheme for running deep neural networks on encrypted data using homomorphic encryption to address these issues. © 2022 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：