检索结果-南通市图书馆

A quantum encryption scheme using d-level systems

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2006年第8期15卷 1690-1694页

作者：郭奋卓高飞温巧燕朱甫臣 School of Science Beijing University of Posts and Telecommunications Beijing 100876 China State Key laboratory of Integrated Services Network Xidian University Xi'an 710071 China National laboratory for Modern Communications P.O. Box 810 Chengdu 610041 China

Using the generalized Bell states and quantum gates, we introduce a quantum encryption scheme of d-level states （qudits）. The scheme can detect and correct arbitrary transmission errors using only local operations and classical communications between the communicators. In addition, the entanglement key used to encrypt can be recycled. The protocol is informationally secure, because the output state is a totally mixed one for every input state p.

关键词： quantum encryption d-level quantum cryptography quantum information

New automatic tool for finding impossible differentials and zero-correlation linear approximations

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第2期64卷 246-248页

作者： Tingting CUI Shiyao CHEN Kai FU Meiqin WANG Keting JIA School of Cyberspace Hangzhou Dianzi University Key laboratory of Cryptologic Technology and Information Security Ministry of EducationShandong University China Academy of Information and Communications Technology Department of Computer Science and Technology Tsinghua University

Dear editor,Impossible differential cryptanalysis and zero-correlation linear cryptanalysis are two powerful methods in the block cipher field. Herein, we present an automatic tool to find impossible differentials(IDs) and zero-correlation linear approximations(ZCLAs) for both ARX and S-box-based ciphers. Similar to the idea of using mixed-integer linear programming(MILP) models for differential cryptanalysis in [1], we first use linear inequalities to describe all the target cipher’s components exactly.

关键词： Impossible differential cryptanalysis zero-correlation linear cryptanalysis MILP automatic tool block cipher

Quantum Secret Sharing Protocols with High Efficiency

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第1期12卷 117-120页

作者： GAO Fei WEN Qiaoyan ZHU Fuchen School of Science Beijing University of Posts andTelecommunications Beijing 100876 China National laboratory for Modern Communications Chengdu 610041 Sichuan China

Measuring the two photons from a Bell state will yield certain correlations between the measurement results. Based on this feature, two quantum secret sharing protocols were proposed. The security against several general attacks was analysed and it was shown that both schemes are secure in theory. Furthermore, both schemes achieve full efficiency and there is no need to utilize multi-particle entanglement, which is relatively more difficult to generate.

关键词： quantum secret sharing quantum cryptography entanglement information security

Adaptively secure hierarchical identity-based signature in the standard model

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2010年第6期17卷 95-100页

作者： ZHANG Le-you HU Yu-pu WU Qing Department of Mathematics Science Xidian University Xi'an 710071 China Key laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China School of Automation Xi'an Institute of Posts and Telecommunications Xi'an 710121 China

Hierarchical identity-based signature （HIBS） has wide applications in the large network. However,the existing works cannot solve the trade-off between the security and efficiency. The main challenge at present is to construct a high efficient and strong secure HIBS with a low computation cost. In this paper,a new construction of HIBS scheme is proposed. The new scheme achieves the adaptive security which is a strong security in the identity-based cryptography. But our scheme has short public parameters and the private keys size shrinks as the hierarchy depth increases. The signature size is a constant and the cost of verification only requires four bilinear pairings,which are independent of hierarchy depth. Furthermore,under the q-strong computational diffie-Hellman problem （q-SDH） assumption,the scheme is provably secure against existential forgery for adaptive chosen message and identity attack in the standard model.

关键词： Hierarchical identity-based signature adaptive security standard model q-SDH problem provably secure

Server-aided immediate and robust user revocation mechanism for SM9

在线全文

学校读者我要写书评

暂无评论

Cybersecurity 2020年第1期3卷 190-202页

作者： Shuzhou Sun Hui Ma Rui Zhang Wenhan Xu State Key laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China School of Cyber Security University of Chinese Academy of SciencesBeijing 100049China.

As the only approved Identity-Based Encryption scheme in China that is also standardized by ISO,SM9-IBE has been widely adopted in many real-world ***,similar to other IBE standard algorithms,SM9-IBE currently lacks revocation mechanism,which is vital for a real *** still,we find that existing revocable techniques may not be suitable and efficient when applying to *** the widespread use of SM9-IBE,an efficient and robust user revocation mechanism becomes an urgent *** this work,we propose a dedicated server-aided revocation mechanism,which for the first time achieves the secure,immediate and robust user revocation for *** with a compact system model,the proposed method leverages an existing server to perform all heavy workloads during user revocation,thus leaving no communication and computation costs for the key generation center and ***,the mechanism supports key-exposure resistance,meaning the user revocation mechanism is robust even if the revocation key *** then formally define and prove the *** last,we present theoretical comparisons and an implementation in terms of computational latency and *** results indicate the efficiency and practicability of the proposed mechanism.

关键词： Identity-based encryption SM9 Server-aided immediate and robust revocation Chinese cryptography standard Security proof Performance evaluation

Cascaded liquid crystal holography for optical encryption

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Optics Letters 2023年第12期21卷 11-18页

作者：王泽宇张涵刘筱姮窦韵洁段薇陈伟马玲玲陆延青 National laboratory of Solid State Microstructures Key Laboratory of Intelligent Optical Sensing and ManipulationCollaborative Innovation Center of Advanced Microstructuresand College of Engineering and Applied SciencesNanjing UniversityNanjing 210023China School of Instrumentation and Optoelectronic Engineering Beihang UniversityBeijing 100191China

Cascaded holography coupled with the secret-sharing scheme has recently gained considerable attention due to its enhanced information processing and encryption ***,we propose a new holographic iterative algorithm and present the implementation of cascaded liquid crystal(LC)holography for optical *** LC layer acts as the secret key and can generate a distinct holographic *** cascading two LC elements,a new holographic image is ***,we showcase the dynamic optical encryption achieved by electrically switching LCs with combined electric *** work may offer promising applications in optical cryptography,all-optical computing,and data storage.

关键词： liquid crystals holography optical encryption

A lattice-based signcryption scheme without random oracles

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2014年第4期8卷 667-675页

作者： Xiuhua LU Qiaoyan WEN Zhengping JIN Licheng WANG Chunli YANG State Key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Mathematics and Information Science Langfang Teachers University Langfang 065000 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China

In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Information Sciences, 2012, 6（1）： 23-28] have independently extended the concept of signcryption to lattice-based cryptography. However, their schemes are only secure under the random or- acle model. In this paper, we present a lattice-based signcryp- tion scheme which is secure under the standard model. We prove that our scheme achieves indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the learning with errors （LWE） assumption and existential unforgeability against adaptive chosen-message attacks （EUF- CMA） under the small integer solution （SIS） assumption.

关键词： signcryption standard model lattice-based cryptography learning with errors problem small integer solution problem

Cryptanalysis of Schemes Based on Pseudoinverse Matrix

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2016年第3期21卷 209-213页

作者： LIU Jinhui ZHANG Huanguo JIA Jianwei School of Computer Wuhan University Wuhan 430072Hubei China Key laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan 430072 Hubei China

Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures up to now. The proposed new quasi-inverse based cryptography scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we illustrate that two of the quasi-inverse based cryptography are vulnerable to a structural attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. In addition, we conduct a detailed analysis on attack methods and provide some improved suggestions on these two schemes.

关键词： cryptography post-quantum computational cryptography key exchange protocol cryptanalysis matrix decomposition

Data Security and Privacy in Bitcoin System:A Survey

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2020年第4期35卷 843-862页

作者： Lie-Huang Zhu Bao-Kun Zheng Meng Shen Feng Gao Hong-Yu Li Ke-Xin Shi School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China School of Information Management for Law China University of Political Science and LawBeijing 102249China Key laboratory of Information Network Security Ministry of Public SecurityShanghai 201204China

To date,bitcoin has been the most successful application of blockchain technology and has received considerable attention from both industry and *** is an electronic payment system based on cryptography rather than on *** of whether people are in the same city or country,bitcoin can be sent by any one person to any other person when they reach an *** market value of bitcoin has been rising since its advent in 2009,and its current market value is US160 *** its development,bitcoin itself has exposed many problems and is facing challenges from all the sectors of society;therefore,adversaries may use bitcoin's weakness to make considerable *** survey presents an overview and detailed investigation of data security and privacy in bitcoin *** examine the studies in the literature/Web in two categories:1)analyses of the attacks to the privacy,availability,and consistency of bitcoin data and 2)summaries of the countermeasures for bitcoin data *** on the literature/Web,we list and describe the research methods and results for the two *** compare the performance of these methods and illustrate the relationship between the performance and the ***,we present several important open research directions to identify the follow-up studies in this area.

关键词： security privacy bitcoin availability consistency