Zero knowledge proof for secure two-party computation with malicious adversaries in distributed networks
Zero-knowledge proof
Homomorphic Encryption
Secure two-party computation
Commitment scheme
DOI:
10.1504/ijcse.2018.093809
Publication Date:
2018-08-07T07:31:07Z
AUTHORS (2)
ABSTRACT
Distributed networks remarkably enhance the convenience of network connectivity. How to achieve efficient cooperative computation while preserving data privacy is a challenge in scenario distributed networks. Secure computation, as key technology information security and protection networks, attracts more attention. In paper, we develop protocols secure two-party presence malicious adversaries which are constructed with homomorphic probabilistic cryptosystem, propose four honest-verifier zero-knowledge proof detect two cheating behaviours adversary. The proposed targeted than existing work. analysis shows that complete, sound zero-knowledge. As an application, show how use our protocol cheating, can make it adversaries.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (1)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....