检索结果-南通市图书馆

An Overview of General Theory of security

在线全文

学校读者我要写书评

暂无评论

China Communications 2017年第7期14卷 1-10页

作者： Min Lei Yixian Yang Xinxin Niu Yu Yang Jie Hao Information security center Beijing University of Posts and Telecommunications Guizhou University Guizhou Provincial Key Laboratory of Public Big Data Jiangsu Engineering center of network monitoring Nanjing University of Information Science & Technology

Cyber security lacks comprehensive theoretical guidance. General security theory, as a set of basic security theory concepts, is intended to guide cyber security and all the other security work. The general theory of security aims to unify the main branches of cyber security and establish a unified basic theory. This paper proposal an overview on the general theory of security, which is devoted to constructing a comprehensive model of network security. The hierarchical structure of the meridian-collateral tree is described. Shannon information theory is employed to build a cyberspace security model. Some central concepts of security, i.e., the attack and defense, are discussed and several general theorems on security are presented.

关键词： cyber security network attack and defense meridian-collateral theory

Minimum length key in MST cryptosystems

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第5期60卷 142-152页

作者： Haibo HONG Licheng WANG Haseeb AHMAD Yixian YANG Zhiguo QU School of Computer Science and Information Engineering Zhejiang Gongshang University Information security center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Jiangsu Engineering center of network monitoring Nanjing University of Information Science & Technology

As a special factorization category of finite groups, logarithmic signature(LS) is used as the main component of cryptographic keys that operate within secret key cryptosystems such as PGM and public key cryptosystems like M ST1, M ST2 and M ST3. An LS with the shortest length is called a minimal logarithmic signature(MLS) that constitutes of the smallest sized blocks and offers the lowest complexity, and is therefore desirable for cryptographic constructions. However, the existence of MLSs for finite groups should be firstly taken into an account. The MLS conjecture states that every finite simple group has an MLS. If it holds, then by the consequence of Jordan-H¨older Theorem, every finite group would have an MLS. In fact, many cryptographers and mathematicians are keen for solving this problem. Some effective work has already been done in search of MLSs for finite groups. Recently, we have made some progress towards searching a minimal length key for MST cryptosystems and presented a theoretical proof of MLS conjecture.

关键词： MLS conjecture finite groups (minimal) logarithmic signature minimum length key MST cryp tosystems

Universally composable secure TNC model and EAP-TNC protocol in IF-T

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第3期53卷 465-482页

作者： MOON SangJae Mobile network security Technology Research center Kyungpook National University

This paper analyzes trusted network connect (TNC) protocols within the universally composable (UC) framework. We propose the first TNC model in the UC framework by first designing the TNC ideal functionality FTNC, the EAP ideal functionality FEAP and the EAP-TNC ideal functionality FE-PA. Then, we construct a trusted network connect protocol named TK-TNC that UC-realizes FTNC in the (FEAP, FE-PA)- hybrid model. Subsequently, we perform a security analysis on protocol D-H PN given in the TCG specification and show that this protocol cannot securely realize the EAP-TNC ideal functionality and be resistant to an attack. Finally, we propose an alternative protocol using the twin Diffie-Hellman key-exchange technique, named protocol TD-H PN, which can securely realize the EAP-TNC ideal functionality in the (FREG, FCERT)-hybrid model.

关键词： network security universally composable security trusted network connect

Provably Secure Identity-based Group Key Exchange Protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2007年第4期4卷 11-22页

作者： SangJae Moon Mobile network security Technology Research center Kyungpook National University

Group key management is one of the basic building blocks in securing group communication.A number of solutions to group key exchange have been proposed,but most of them are not scalable and,in particular,require at least 0(log n) communication *** formally present a constant -round Identity-based protocol with forward secrecy for group key exchange,which is provably secure in the security model introduced by Bresson et *** protocol focuses on round efficiency and the number of communication round is only one greater than the lower bound presented by Becker and ***,the protocol provides a batch verification technique,which simultaneously verifies the validity of messages from other group participants and greatly improves computational ***,in our protocol,it is no necessary of always-online key generation center during the execution of the protocol compared to other Identity-based protocols.

关键词： provable security group key exchange bilinear pairings

Universally composable one-time signature and broadcast authentication

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第3期53卷 567-580页

作者： MOON SangJae Mobile network security Technology Research center Kyungpook National University

Broadcast authentication is a vital security primitive for the management of a copious number of parties. In the universally composable framework, this paper investigates broadcast authentication using one-time signature based on the fact that one-time signature has efficient signature generation and verification suitable for low-power devices, and gives immediate authentication, which is a favorable property for time-critical messages. This paper first formulates a broadcast authentication model with the ideal functionalities such as one-time signature and broadcast authentication, and proposes a broadcast authentication scheme in the hybrid model. This paper then improves HORS, which is secure based on a strong assumption (i.e., a subset-resilient hash function) and presents the improved version as HORS+, which diffiers from HORS such that it is a secure one-time signature based on weaker assumptions, i.e. one-way functions, one-way hash functions and collisionresistant hash functions. At the same time, a protocol OWC using one-way chains is proposed to provide more registered keys for multi-message broadcast authentication. Our broadcast authentication scheme constructed by the combined use of HORS+ and OWC is universally composable secure and suitable for low-power devices.

关键词： network security universally composable security broadcast authentication one-time signature

Efficient quantum state transmission via perfect quantum network coding

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第1期62卷 191-204页

作者： Zhen-Zhen LI Gang XU Xiu-Bo CHEN Zhiguo QU Xin-Xin NIU Yi-Xian YANG Information security center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Guizhou Provincial Key Laboratory of Public Big Data Guizhou University Jiangsu Engineering center of network monitoring Nanjing University of Information Science and Technology

Quantum network coding with the assistance of auxiliary resources can achieve perfect transmission of the quantum state. This paper suggests a novel perfect network coding scheme to efficiently solve the quantum k-pair problem, in which only a few assisting resources are introduced. Specifically, only one pair of maximally entangled state needs to be pre-shared between two intermediate nodes, and only O(k) of classical information is transmitted though the network. Moreover, the classical communication used in our protocol does not cause transmission congestion, providing better adaptability to large-scale quantum k-pair *** relevant analyses and comparisons, we demonstrate that our proposed scheme saves resources and has good application value, thereby showing its high efficiency. Furthermore, the proposed scheme achieves 1-max flow quantum communication, and the achievable rate region result is extended from its counterpart over the butterfly network.

关键词： perfect quantum network coding quantum k-pair problem efficient quantum state transmission communication efficiency achievable rate region

Controlled remote preparation of an arbitrary four-qubit cluster-type state

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2016年第10期25卷 52-57页

作者：陈维林马松雅瞿治国 School of Mathematics and Statistics Henan University Jiangsu Engineering center of network monitoring Nanjing University of Information Science and Technology

Two schemes are proposed to realize the controlled remote preparation of an arbitrary four-qubit cluster-type state via a partially entangled channel. We construct ingenious measurement bases at the sender’s and the controller’s locations, which play a decisive role in the proposed schemes. The success probabilities can reach 50% and 100%, respectively. Compared with the previous proposals, the success probabilities are independent of the coefficients of the entangled channel.

关键词： controlled remote state preparation partially entangled channel measurement basis quantum network communication

Improved quantum ripple-carry addition circuit

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第4期59卷 104-111页

作者： Feng WANG Mingxing LUO Huiran LI Zhiguo QU Xiaojun WANG College of mathematical sciences Dezhou University Information security and National Computing Grid Laboratory Southwest Jiaotong University Jiangsu Engineering center of network monitoring Nanjing University of Information Science & Technology School of Electronic Engineering Dublin City University

A serious obstacle to large-scale quantum algorithms is the large number of elementary gates, such as the controlled-NOT gate or Toffoli gate. Herein, we present an improved linear-depth ripple-carry quantum addition circuit, which is an elementary circuit used for quantum computations. Compared with previous addition circuits costing at least two Toffoli gates for each bit of output, the proposed adder uses only a single Toffoli gate. Moreover, our circuit may be used to construct reversible circuits for modular multiplication, Cx mod M with x < M, arising as components of Shor’s algorithm. Our modular-multiplication circuits are simpler than previous constructions, and may be used as primitive circuits for quantum computations.

关键词： quantum addition circuit modular multiplication CNOT gate Toffoli gate circuit complexity

Quantum private comparison based on quantum dense coding

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第11期59卷 195-207页

作者： Feng WANG Mingxing LUO Huiran LI Zhiguo QU Xiaojun WANG College of Mathematical Sciences Dezhou University Information security and National Computing Grid Laboratory Southwest Jiaotong University Jiangsu Engineering center of network monitoring Nanjing University of Information Science & Technology School of Electronic Engineering Dublin City University

A serious problem in cloud computing is privacy information protection. This study proposes a new private comparison protocol using Einstein-Podolsky-Rosen(EPR) pairs. This protocol allows two parties to secretly compare their classical information. Quantum dense coding enables the comparison task to be completed with the help of a classical semi-honest center. A one-step transmission scheme and designed decoy photons can be used against various quantum attacks. The new protocol can ensure fairness, efficiency, and security. The classical semi-honest center cannot learn any information about the private inputs of the players. Moreover, this scheme can be easily generalized using the general EPR pairs in order to improve the transmission efficiency.

关键词： private comparison multiparty secure computation classical semi-honesty center quantum dense coding general EPR pair