检索结果-南通市图书馆

universally composable Three Party Password-based Key Exchange Protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2009年第3期6卷 150-155页

作者： Deng Miaolei Ma Jianfeng Le Fulong School of Computer Xidian University Xi＇an 710071 China Institute of Science Information Engineering University Zhengzhou 450001 China

Within the framework of universal composability,an appropriate ideal functionality that captures the basic security requirements of three party password-based key exchange was defined. An efficient real-word three party password-based key exchange protocol was also *** protocol securely realizes the ideal functionality with respect to static party *** it provides security guarantees under arbitrary composition with other protocols.

关键词： Diffie-Hellman attack key exchange universally composable protocol security

universally composable Symbolic Analysis of Group Key Exchange Protocol

在线全文

学校读者我要写书评

暂无评论

China Communications 2011年第2期8卷 59-65页

作者：张子剑祝烈煌廖乐健 School of Computer Science and Technology Beijing Institute of Technology

Canetti and Herzog have already proposed universally composable symbolic analysis(UCSA) to analyze mutual authentication and key exchange protocols. However,they do not analyze group key exchange protocol. Therefore,this paper explores an approach to analyze group key exchange protocols,which realize automation and guarantee the soundness of cryptography. Considered that there exist many kinds of group key exchange protocols and the participants’ number of each protocol is arbitrary. So this paper takes the case of Burmester-Desmedt(BD) protocol with three participants against passive adversary(3-BD-Passive) . In a nutshell,our works lay the root for analyzing group key exchange protocols automatically without sacrificing soundness of cryptography.

关键词： universally composable symbolic analysis universally composable mapping algorithm burmester-desmedt protocol group key exchange protocol

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

Quantum security analysis of a lattice-based oblivious transfer protocol

在线全文

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2017年第9期18卷 1348-1369页

作者： Mo-meng LIU Juliane KRAMER Yu-pu HU Johannes BUCHMANN State Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 China Technische Universitiat Darrastadt Darmstadt 64289 Germany

Because of the concise functionality of oblivious transfer （OT） protocols, they have been widely used as building blocks in secure multiparty computation and high-level protocols. The security of OT protocols built upon classical number theoretic problems, such as the discrete logarithm and factoring, however, is threatened as a result of the huge progress in quantum computing. Therefore, post-quantum cryptography is needed for protocols based on classical problems, and several proposals for post-quantum OT protocols exist. However, most post-quantum cryptosystems present their security proof only in the context of classical adversaries, not in the quantum setting. In this paper, we close this gap and prove the security of the lattice-based OT protocol proposed by Peikert et al. （CRYPTO, 2008）, which is universally composably secure under the assumption of learning with errors hardness, in the quantum setting. We apply three general quantum security analysis frameworks. First, we apply the quantum lifting theorem proposed by Unruh （EUROCRYPT, 2010） to prove that the security of the lattice-based OT protocol can be lifted into the quantum world. Then, we apply two more security analysis frameworks specified for post-quantum cryptographic primitives, i.e., simple hybrid arguments （CRYPTO, 2011） and game-preserving reduction （PQCrypto, 2014）.

关键词： Oblivious transfer Post-quantum Lattice-based Learning with errors universally composable