Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Computer Applications

A secure two-party bargaining protocol based on additive homomorphic public key cryptosystem

Fengli Zhang

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

Secure multi-party computation with its applications is an important direction in current cryptography research field. The research focuses on how to accomplish the secure cooperative computation among multi-party without the participation of the third party. The two-party bargaining protocol, based on homomorphic public key cryptosystem, was an example of secure multi-party computation's applications. One participant can make a bargain with the other by implementing the protocol. During the implementation of protocol, the privacy of input and the correctness of output could be preserved. The protocol can be implemented without the participation of the third party and its security was based on additive homomorphic public key cryptosystem.

Related papers

An Improved Secure Two-Party Bargaining Protocol

Qin Zhi-guang

In this paper a secure two-party bargaining protocol is proposed which is based on Pallier homomorphic public key cryptosystem. The participant can make a bargain with another one by implementing the protocol. During the protocol, the privacy of input and the correctness of output should be preserved. The third party will participate in working out the final price only under the condition of success agreement. Through the analysis of complexity and security, this protocol holds higher implementing efficiency and security characters, and therefore has application value in the e-commerce.

Dianzi Ke-ji Daxue xuebao•Jan 1, 2007•0 citations

A Improved Secure Two-Party Bargaining Protocol without Third Trusted Party

Changgen Peng

A secure two-party bargaining protocol is proposed which is based on Pallier homomorphic public key cryptosystem.The agreement offered the privacy of information and the right of the results.After the success of bargaining,it prevents one party from tampering with the agreement and thus to deceive the other party.The agreement does not require third-party.The final price can be calculated by the parties of bargaining.The analysis of complexity and security shows that the efficiency and security features of the agreement is higher.

Journal of Guizhou University•Jan 1, 2009•0 citations

A Protocol of Comparing Information without Leaking

Jing Qin

At present, research on secure multi-party computation is of great interest in modern cryptography. It should be acknowledged that if any function can be computed securely, then it results in a very powerful tool. In fact, all natural protocols are, or can be rephrased to be, special cases of the multi-party computation problems. Design and analysis of the special multi-party computation protocols is meaningful and has attracted much interest in this field. Based on the combination of a public-key cryptosystem of the homomorphic encryption and on the theoretic construction relying on the F-hiding assumption, a protocol for comparing information of equality is proposed. The protocol needs only a single round of interaction and ensures fairness, efficiency and security. The protocol is fair, which means that one party knows the sound result of the comparison if and only if the other one knows the result. The protocol is efficient with the help of an oblivious third party for calculating. However, the third party cannot learn any information about the participant抯 private inputs and even about the comparison result, and cannot collude with any participant. The protocol is secure for the two participants, that is, any information about their secret input will not leak except the final computation result. A precise proof of security of the protocol is presented. Applications of this protocol may include private bidding and auctions, secret ballot elections, commercial business, identification in a number of scenarios and so on. It is believed that the protocol may be of practical significance for electronic transaction.

•Jan 1, 2004•24 citations

Research on Secure Scalar Product Protocol and Its' Application

Fen Xu, Shuai Zeng, Shoushan Luo +3 more

Secure scalar product protocol is an important fundamental protocol in secure multi-party computation. Serving as a basic building block for many other secure protocols, it is widely used in data mining, statistical analysis and scientific computation. Based on additive homomorphism public key cryptosystem, we develop a new secure scalar product protocol under semi-honest model with low communication complexity which is easy to implement and understanding. Furthermore, we firstly apply it to position relationship decision for privacy preserving space vectors.

International Conference on Computational Intelligence and Software Engineering (CiSE)•Sep 1, 2010•8 citations

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 Communications•Jan 1, 2004•4 citations

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Gang Xu, Fan Yun, Xiu‐Bo Chen +5 more

Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant’s attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.

Intelligent Automation & Soft Computing•Jan 1, 2022•17 citations
Secure multi-party computation with its applications is an important direction in current cryptography research field. The research focuses on how to accomplish the secure cooperative computation among multi-party without the participation of the third party. The two-party bargaining protocol, based on homomorphic public key cryptosystem, was an example of secure multi-party computation's applications. One participant can make a bargain with the other by implementing the protocol. During the implementation of protocol, the privacy of input and the correctness of output could be preserved. The protocol can be implemented without the participation of the third party and its security was based on additive homomorphic public key cryptosystem.
In this paper a secure two-party bargaining protocol is proposed which is based on Pallier homomorphic public key cryptosystem. The participant can make a bargain with another one by implementing the protocol. During the protocol, the privacy of input and the correctness of output should be preserved. The third party will participate in working out the final price only under the condition of success agreement. Through the analysis of complexity and security, this protocol holds higher implementing efficiency and security characters, and therefore has application value in the e-commerce.
A secure two-party bargaining protocol is proposed which is based on Pallier homomorphic public key cryptosystem.The agreement offered the privacy of information and the right of the results.After the success of bargaining,it prevents one party from tampering with the agreement and thus to deceive the other party.The agreement does not require third-party.The final price can be calculated by the parties of bargaining.The analysis of complexity and security shows that the efficiency and security features of the agreement is higher.
At present, research on secure multi-party computation is of great interest in modern cryptography. It should be acknowledged that if any function can be computed securely, then it results in a very powerful tool. In fact, all natural protocols are, or can be rephrased to be, special cases of the multi-party computation problems. Design and analysis of the special multi-party computation protocols is meaningful and has attracted much interest in this field. Based on the combination of a public-key cryptosystem of the homomorphic encryption and on the theoretic construction relying on the F-hiding assumption, a protocol for comparing information of equality is proposed. The protocol needs only a single round of interaction and ensures fairness, efficiency and security. The protocol is fair, which means that one party knows the sound result of the comparison if and only if the other one knows the result. The protocol is efficient with the help of an oblivious third party for calculating. However, the third party cannot learn any information about the participant抯 private inputs and even about the comparison result, and cannot collude with any participant. The protocol is secure for the two participants, that is, any information about their secret input will not leak except the final computation result. A precise proof of security of the protocol is presented. Applications of this protocol may include private bidding and auctions, secret ballot elections, commercial business, identification in a number of scenarios and so on. It is believed that the protocol may be of practical significance for electronic transaction.
Secure scalar product protocol is an important fundamental protocol in secure multi-party computation. Serving as a basic building block for many other secure protocols, it is widely used in data mining, statistical analysis and scientific computation. Based on additive homomorphism public key cryptosystem, we develop a new secure scalar product protocol under semi-honest model with low communication complexity which is easy to implement and understanding. Furthermore, we firstly apply it to position relationship decision for privacy preserving space vectors.
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.
Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant’s attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.