检索结果-南通市图书馆

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

Authentication Methods for 802.11s Mesh Networks

在线全文

学校读者我要写书评

暂无评论

China Communications 2007年第1期4卷 56-65页

作者： sangjae moon Mobile Network Security Technology Research Center

With the rapid development of the WLAN,the 802. 11 s mesh network is ***,adaptability and scalability are the most important attributes of a mesh ***,the security in an 802.11s mesh network is not well defined or specified,and there is no standard method to authenticate a mesh point that is creating a mesh *** this paper,we propose solutions for the authentication of mesh *** the Basic Infrastructure Security Mode,we combine the 802.1X/EAP and neighbor graph to realize the fast mutual authentication between a new mesh point and every its mesh *** prove that our scheme maintains the security of the standardized EAP authentication *** the same time,the simulation result shows that the authentication latency of our scheme is much lower than that of the scheme in[2].In the Basic Decentralized Security Mode(BDSM),802.11s mesh networks are very similar to ad hoc networks,but they are different in several *** first analyze the differences between *** on this analysis, we investigate the main authentication methods used in ad hoc networks and select the pairwise key pre-distribution model and identity-based model for the WLAN mesh network.

关键词： authentication 802.11s mesh networks ad hoc networks

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

Universally composable anonymous Hash certification model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science in China(Series F) 2007年第3期50卷 440-455页

作者： ZHANG Fan MA JianFeng sangjae moon Key Laboratory of Computer Networks and Information Security (Ministry of Education) Xidian UniversityXi'an 710071 China Mobile Network Security Technology Research Center Kyungpook National University Sankyuk-dongBuk-ku Daeyu 702-701 Korea

Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous authentication with other kind of certificate. Therefore, inspired by the work of Marten, an anonymous hash certification ideal function and a more universal certificate CA model are proposed in this paper. We define the security requirements and security notions for this model in the framework of universal composable security and prove in the plain model （not in the random-oracle model） that these security notions can be achieved using combinations of a secure digital signature scheme, a symmetrical encryption mechanism, a family of pseudorandom functions, and a family of one-way collision-free hash functions. Considering the limitation of wireless environment and computation ability of wireless devices, this anonymous Hash certification ideal function is realized by using symmetry primitives.

关键词： anonymous authentication Hash universal composable security

A new approach for UC security concurrent deniable authentication

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2008年第4期51卷 352-367页

作者： FENG Tao LI FengHua MA JianFeng sangjae moon Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China School of Computer and Communications Lanzhou University of Technology Lanzhou 730050 China Mobile Network Security Technology Research Center Kyungpook National University Sankyuk-dong Buk-ku Daeyu 702-701 Korea

Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such authentication ever took place. When we consider an asynchronous multi-party network with open communications and an adversary that can adaptively corrupt as many parties as it wishes, we present a new approach to solve the problem of concurrent deniable authentication within the framework of universally composable （UC） security. We formulate a definition of an ideal functionality for deniable authentication. Our constructions rely on a modification of the verifiably smooth projective hashing （VSPH） with projection key function by trapdoor commitment. Our protocols are forward deniable and UC security against adaptive adversaries in the common reference string model. A new approach implies that security is preserved under concurrent composition of an unbounded number of protocol executions; it implies non-malleability with respect to arbitrary protocols and more. The novelty of our schemes is the use of witness indistinguishable protocols and the security is based on the decisional composite residuosity （DCR） assumption. This new approach is practically relevant as it leads to more efficient protocols and security reductions.

关键词： information security concurrent deniable authentication universally composable verifiably smooth projective hashing the decisional composite residuosity assumption

Provable Efficient Certificateless Group Key Exchange Protocol

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第1期12卷 41-45页

作者： CAO Chunjie MA Jianfeng moon sangjae Key Laboratory of Computer Networks and InformationSecurity Ministry of Education Xidian University Xi＇ an 710071Shaanxi China Mobile Network Security Technology Research Center Kyungpook National University Daeyu 702701 Korea

Certificateless public key cryptography （CL-PKC） avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.

关键词： group key exchange certificateless public key cryptography provable security bilinear pairings