Journal of Kaili University

A Key Agreement of the Improvements Based on Secure two-Party Computation

Junming Zhang

Published Jan 1, 2011• 0 citations

Abstract

Secure Multiparty Computation protocol is an important area in cryptography.The research of multi-party computation was a subject of great importance in the international cryptographic circle.A key agreement scheme based on secure two-party computation is improved.Three schemes are proposed.It can be proved that even if Eve gets the same data as the receiver,the schemes are still secure.

Related papers

A protocol of specific secure two-party computation

Bao Li

The research of multi-party computation was a subject of great importance in the international cryptographic circle. Based on the Φ-hiding assumption and public-key cryptosystem of homomprphic encryption, we constructed a protocol of special secure two-party computation--comparing protocol. The protocol could ensure fairness, security, efficiency and robustness. We also proved the security and correctness of the protocol, using the strict definition of the secure multi-party computation. Applications of the protocol included private bidding and auctions, secret ballot elections and so on.

Journal of China Institute of CommunicationsJan 1, 20044 citations

Scalar-product based secure two-party computation

Chih-Hao Shen, Justin Z. Zhan, Tsan‐sheng Hsu +2 more

Secure multiparty computation is a very important research topic in cryptography. The sub-problem of secure multiparty computation that has received special attention by researchers because of its close relation to many cryptographic tasks is secure two-party computation. This area of research is concerned with the question: ldquoCan two party computation be achieved more efficiently and under weaker security assumptions than general multiparty computation?rdquo Yaopsilas protocol provided security against passive adversaries, while Lindell and Pinkas proposed secure two party protocols that are secure against active adversaries. In this paper, we would like to propose a set of information theoretically secure protocols based on scalar product protocol. The detailed complexity analysis is also provided.

IEEE International Conference on Granular Computing (GrC)Aug 1, 200810 citations

Improved two-party authenticated key agreement protocol

Zhang Long-xiang

Two-party authenticated key agreement is one of the methods to generate session keys.In this paper,the authors analyzed a new provably secure two-party authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al.and pointed out that this protocol was not secure if the adversary can obtain the long-term key of a participant.Then an improved protocol was presented,and in the new scheme,the parameters that may leak the long-term keys were encrypted.The authors also discussed the security and computational cost of the new scheme.The result shows that the new protocol realizes the secure key agreement with lower computational cost.

Journal of Computer ApplicationsJan 1, 20120 citations

Efficient and secure certificateless key agreement protocol

Xiaolei Dong

In the area of network information security,key agreement is essential between servers and clients.To overcome the key escrow property of identity-based cryptography,proposed certificateless public key cryptography,it combined the advantages of the traditional PKI and the identity-based cryptography.This paper proposed a new certificateless two-party key agreement protocol using pairing operation in elliptic curves,it only required each party to compute one pairing.Proved its security in ECK(extended Canetti-Krawczyk) model.Compared with existing certificateless protocols,the newly proposed key agreement protocol has better security and efficiency.

Jisuanji yingyong yanjiuJan 1, 20090 citations

General Cryptographic Protocols

Oded Goldreich

The design of secure protocols that implement arbitrarily desired functionalities is a major part of modern cryptography. Taking the opposite perspective, the design of any cryptographic scheme may be viewed as the design of a secure protocol for implementing a suitable functionality. Still, we believe that it makes sense to differentiate between basic cryptographic primitives (which involve little interaction) like encryption and signature schemes, on the one hand, and general cryptographic protocols, on the other hand. In this chapter we consider general results concerning secure multi –party computations, where the two –party case is an important special case. In a nutshell, these results assert that one can construct protocols for securely computing any desirable multi–party functionality (see the following terminology). Indeed, what is striking about these results is their generality, and we believe that the wonder is not diminished by the (various alternative) conditions under which these results hold. Our focus on the general study of secure multi–party computation (rather than on protocols for solving specific problems) is natural in the context of the theoretical treatment of the subject matter. We wish to highlight the importance of this general study to practice. Firstly, this study clarifies fundamental issues regarding security in a multi–party environment. Secondly, it draws the lines between what is possible in principle and what is not. Thirdly, it develops general techniques for designing secure protocols. And last, sometimes it may even yield schemes (or modules) that may be incorporated in practical systems.

Cambridge University Press eBooksMay 10, 200468 citations

Secure multi-party key establishment

Chih-Hung Li

For a secure communication through the public network, cryptographic encryption must be applied. The key establishment issue is the most important part in cryptographic encryption. Only the legitimate principals who have the key can encrypt messages and decrypt cryptograms. A secure multi-party communication held through the public network can only take place after a multi-party key establishment protocol has been executed. The multi-party key establishment protocol is designed so that the principals can receive a common key and use it to securely exchange the messages.\nIn this thesis, the secure multi-party key establishment protocols are discussed. W e start from investigating properties of two-party key establishment protocols such as motivation of using session key, adversaries in the protocols, attacks of the protocol and security analysis of the protocol. Then we give the requirements of a multi-party key establishment protocol and summarize about what should be considered in designing a multi-party key establishment protocol. After that we review some of the previous proposed multi-party key establishment protocol. The existing multi-party key establishment protocols are either impractical ( not efficient enough) or missing some important security goals such as authentication of principals. Three new protocols are proposed in this thesis. The first protocol addresses how to hold a conference for members of two hierarchical groups in an efficient way. The message broadcasting is used to reduce the cost of secure message transport.\nThe second and the third protocols manage the authentication problem by using a secret sharing scheme. We replace the principal authentication with the group authentication so that the computational overhead and communication overhead will be reduced especially in reuse of the protocol for new communication. Again, message broadcasting is used for replacing the expansive secure communication channel.\nPart of this thesis appeared in ACSC'99(Australian Computer Science Conference) and ACISP'99(Australian Conference of Information Security and Privacy).

Jan 1, 20000 citations