Journal of Software Engineering and Applications

Volume 3, Issue 7 (July 2010)

ISSN Print: 1945-3116   ISSN Online: 1945-3124

Google-based Impact Factor: 2.23  Citations  h5-index & Ranking

Secure Multi-Party Proof and its Applications

HTML  Download Download as PDF (Size: 243KB)  PP. 709-717  
DOI: 10.4236/jsea.2010.37081    5,745 Downloads   8,929 Views  Citations

Affiliation(s)

.

ABSTRACT

We define a new type cryptographical model called secure multi-party proof that allows any players and a verifier to securely compute a function : each of the players learns nothing about other players’ input and about the value of , and the verifier obtains the value of and it’s validity but learns nothing about the input of any of the players. It is implemented by a protocol using oblivious transfer and Yao’s scrambled circuit. We prove that our protocol is secure if the players and the verifier are semi-honest (i.e. they follow the protocol) and polynomial time bounded. The main applications of our protocol are for electronic voting and electronic bidding.

Share and Cite:

C. Tang and S. Gao, "Secure Multi-Party Proof and its Applications," Journal of Software Engineering and Applications, Vol. 3 No. 7, 2010, pp. 709-717. doi: 10.4236/jsea.2010.37081.

Cited by

[1] Anonymous electronic voting protocol with traceability
Internet Technology and Secured Transactions (ICITST), 2011 International Conference for. IEEE, 2011

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.