检索结果-南通市图书馆

Formal analysis and design of multi-party fair exchange protocols

在线全文

学校读者我要写书评

暂无评论

Science in china(Series F) 2006年第2期49卷 155-174页

作者： QING Sihan1,2.3.& LI Gaicheng1,3.1. Engineering Research Center for information security Technology, Institute of Software, {2. academy of sciences, Beijing 100080, china 2. Beijing Zhongke Ansheng Corporation of information Technology, Beijing 100080, china 3. graduate School of the {2. academy of sciences, Beijing 10003., china Engineering Research Center for information security Technology Institute of Software Chinese Academy of Sciences Beijing China Beijing Zhongke Ansheng Corporation of information Technology Beijing China graduate School of the chinese {2. of {3. Beijing China

Based on the origin of message items and channel combination between transacting parties, and events and relations among events, this paper presents a concise, precise, and hierarchical model for general fair exchange protocols, formally specifies various security requirements which are able to reflect inherent requirements for fair exchange protocols more rigorously, and partition these security requirements with fine granularity. This work helps analyze, debug, and design multi-party fair exchange protocols more effectively and elaborately,

关键词： fair exchange logical protocol formal model security requirement.

Power functions with low uniformity on odd characteristic finite fields

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2010年第8期53卷 1931-1940页

作者： ZHA ZhengBang 1,3.& WANG XueLi 2.1 School of Mathematical sciences,Luoyang Normal university,Luoyang 47102.,{2. 2.School of Mathematical sciences,South {2. Normal university,Guangzhou 51063.,{2. 3.State Key Laboratory of information security,{13.,Beijing 100049,{2. School of Mathematical sciences Luoyang Normal University Luoyang China State Key Laboratory of information {2. Graduate University of Chinese Academy of Sciences Beijing China School of Mathematical sciences South China Normal University Guangzhou China

In this paper,we give some new low differential uniformity of some power functions defined on finite fields with odd *** corollaries of the uniformity,we obtain two families of almost perfect nonlinear functions in GF... 详细信息

关键词： almost perfect nonlinear function differential uniform function finite field

CMQV+:An authenticated key exchange protocol from CMQV

在线全文

学校读者我要写书评

暂无评论

Science china(information {2.) 2012年第7期55卷 1666-1674页

作者： LI Hui 1,2.& WU ChuanKun 1 1 State Key Laboratory of information {2.,Institute of Software,chinese academy of sciences,Beijing 100190,china 2.graduate university of chinese academy of sciences,Beijing 100049,china State Key Laboratory of information {2. Institute of Software Chinese Academy of Sciences Beijing China graduate university of chinese academy of sciences Beijing China

Ustaoglu presents a secure and efficient key exchange protocol named CMQV,based on the design rationales of HMQV and *** with the latter two protocols,on one hand,CMQV achieves high performance of HMQV,and on the other,it is proven secure in eCK model as NAXOS ***,CMQV enjoys the security proof under gap Diffie-Hellman assumption as indicated by its *** this paper,we propose a variant of CMQV,called CMQV+,which is proven secure under a weaker assumption (*** Diffie-Hellman assumption) in eCK model with random oracles while maintaining the high-performance feature of CMQV as much as possible.

关键词： key exchange eCK model trapdoor-test technique provable security CDH assumption

Mechanism and Defense on Malicious Code

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural sciences 2005年第1期10卷 83-88页

作者： WEN Wei-ping 1,2.3. QING Si-han 1,2.3.1. Institute of Software, the chinese {3. of {2., Beijing 100080, china 2.Engineering Research Center for information security Technology, the chinese {3. of {2., Beijing 100080, china 3.{13. School of the chinese {3. of {2., Beijing 100080, china Institute of Software the Chinese Academy of Sciences Beijing China Engineering Research Center for information security Technology the Chinese Academy of Sciences Beijing China graduate School of the chinese {2. of {3. Beijing China

With the explosive growth of network applications, the threat of the malicious code against network security becomes increasingly serious. In this paper we explore the mechanism of the malicious code by giving an attack model of the malicious code, and discuss the critical techniques of implementation and prevention against the malicious code. The remaining problems and emerging trends in this area are also addressed in the paper.

关键词： malicious code attacking model mechanism defense system security network security

A two-round honest-verifier zero-knowledge protocol

在线全文

学校读者我要写书评

暂无评论

Science china(information {2.) 2010年第5期53卷 954-963页

作者： LIU HanWu 1,2.& LIN DongDai 1 1 The State Key Laboratory of information {2., Institute of Software, chinese academy of sciences, Beijing 100190, china 2.graduate university of the chinese academy of sciences, Beijing {12., china The State Key Laboratory of information {2. Institute of Software Chinese Academy of Sciences Beijing China graduate university of the {2. {3. of sciences Beijing China

Since the concept of zero-knowledge protocols was introduced, it has attracted a lot of attention and in turn showed significant effect on the development of cryptography, complexity theory and other areas. The round complexity of a zero-knowledge protocol is a very important efficiency consideration, and it is required to be as small as possible. Generally, it is desirable to have zero-knowledge protocols with constant numbers of rounds. Goldreich and Oren proved that only languages in BPP have one-round and two-round zero-knowledge protocols. Moreover, they also showed that only languages in BPP have one-round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself, and has many other uses. Thus, the problem as to whether there exist two-round honest-verifier zero-knowledge protocols becomes an important open problem. In this paper, we introduce a new simulation technique and present a two-round honest-verifier zero-knowledge protocol for any language in N P under a standard complexity assumption based on this technique.

关键词： proof system argument system zero-knowledge witness indistinguishability black-box one-way permutation commitment scheme zap

On designated-weight Boolean functions with highest algebraic immunity

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china Mathematics 2010年第11期53卷 2847-2854页

作者： LIU MeiCheng1,3. DU YuSong2. PEI DingYi2.& LIN DongDai1 1The State Key Laboratory of {3. {2., Institute of Software of chinese academy of sciences, Beijing 100190, china 2.ollege of Mathematics and {3. sciences, Guangzhou university, Guangzhou 510006, china 3.14}, Beijing {12., china The State Key Laboratory of information {2. Institute of Software of Chinese Academy of Sciences Beijing China graduate university of chinese academy of sciences Beijing China College of Mathematics and information sciences Guangzhou University Guangzhou China

Algebraic immunity has been considered as one of cryptographically significant properties for Boolean functions. In this paper, we study ∑d-1 i=0 (ni)-weight Boolean functions with algebraic immunity achiev-ing the minimum of d and n - d + 1, which is highest for the functions. We present a simpler sufficient and necessary condition for these functions to achieve highest algebraic immunity. In addition, we prove that their algebraic degrees are not less than the maximum of d and n - d + 1, and for d = n1 +2.their nonlinearities equalthe minimum of ∑d-1 i=0 (ni) and ∑ d-1 i=0 (ni). Lastly, we identify two classes of such functions, one having algebraic degree of n or n-1.

关键词： cryptography Boolean function algebraic immunity algebraic degree nonlinearity

An ID-based authenticated dynamic group key agreement with optimal round

在线全文

学校读者我要写书评

暂无评论

Science china(information {2.) 2012年第11期55卷 2542-2554页

作者： TENG JiKai1,2.WU ChuanKun1 & TANG ChunMing3.1State Key Laboratory of information {2.,Institute of Software of chinese academy of sciences,Beijing 100090,china 2.7},Beijing 100049,china 3.aculty of Mathematic and information Science,Guangzhou university,Guangzhou 510006,china State Key Laboratory of information {2. Institute of Software of Chinese Academy of Sciences Beijing China graduate university of chinese academy of sciences Beijing China Faculty of Mathematic and information Science Guangzhou University Guangzhou China

Group key agreement protocols are crucial for achieving secure group *** are designed to provide a set of users with a shared secret key to achieve cryptographic goal over a public *** group membership changes,the session key should be refreshed efficiently and *** previous group key agreement protocols need at least two rounds to establish or refresh session *** this paper,a dynamic authenticated group key agreement(DAGKA) protocol based on identity-based cryptography is *** making use of the members' values stored in previous sessions,our Join and Leave algorithms reduce the computation and communication costs of *** the proposed protocol,Setup and Join algorithms need one *** session key can be refreshed without message exchange among remaining users in Leave algorithm,which makes the protocol more *** security is proved under decisional bilinear Diffie-Hellman(DBDH) assumption in random oracle model.

关键词： identity-based cryptography dynamic group key agreement provably secure admissible pairing

Threshold quantum secure direct communication without entanglement

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第2期51卷 176-183页

作者： YANG YuGuang1,3.& WEN QiaoYan2.1 College of Computer Science and Technology, Beijing university of Technology, Beijing 10002., {3. 2.School of Science, Beijing university of Posts and Telecommunications, Beijing 100876, {3. 3.State Key Laboratory of information security (graduate School of chinese academy of {13.), Beijing 100049, {3. College of Computer Science and Technology Beijing University of Technology Beijing China State Key Laboratory of information {2. ({3. School of chinese academy of sciences) Beijing China School of Science Beijing University of Posts and Telecommunications Beijing China

For the first time, a threshold quantum secure direct communication (TQSDC) scheme is presented. Similar to the classical Shamir's secret sharing scheme, the sender makes n shares, S1, …, Sn of secret key K and each receiver keeps a share secretly. If the sender wants to send a secret message M to the receivers, he en-codes the information of K and M on a single photon sequence and sends it to one of the receivers. According to the secret shares, the t receivers sequentially per-form the corresponding unitary operations on the single photon sequence and ob-tain the secret message M. The shared shares may be reusable if it can be judged that there is no eavesdropper in line. We discuss that our protocol is feasible with current technology.

关键词： quantum secure direct communication threshold secure direct communication quantum secret sharing

Dynamic tree-based authenticated group key exchange protocol

在线全文

学校读者我要写书评

暂无评论

Science china(information {2.) 2010年第8期53卷 1591-1602页

作者： LI Hui 1,2., WU ChuanKun 1 & TENG JiKai 1,2.1 State Key Laboratory of {3. {2., Institute of Software, chinese academy of sciences, Beijing 100190, china 2.graduate university of chinese academy of sciences, Beijing 100049, china State Key Laboratory of information {2. Institute of Software Chinese Academy of Sciences Beijing China graduate university of chinese academy of sciences Beijing China

Authenticated group key exchange protocols allow a group of users over a public network to establish a shared secret key for the subsequent cryptographic goals. In this paper, we extend BD-II scheme into a dynamic setting, and propose a tree-based authenticated key exchange protocol which is more suitable for dynamic groups in such as ad hoc networks. Our protocol is proven secure in random-oracle model. Additionally, we analyze the costs of our protocols in both communication and computation terms, and compare its performance with three well-known protocols.

关键词： tree-based group key exchange dynamic provable security