Electronic Protocols for Voting and Bidding Based on Secure Multi-Party Proof

Dong Qing Xie; Chun Ming Tang

doi:10.4028/www.scientific.net/AMR.171-172.305

Paper Titles

Function Expansion of a Chaotic Logic Unit
p.283

The Research and Implementation of Illumination Technology in the 3D GIS Visualization
p.288

Study on Relationship of Miners′ Psychological Characteristic and Safety Degree
p.295

Image Encryption Algorithm Based on Chaos and S-Boxes Scrambling
p.299

Electronic Protocols for Voting and Bidding Based on Secure Multi-Party Proof
p.305

Research on Calculating Productivity of Multilateral Horizontal Gas Well with Wellbore Pressure Drop
p.311

Analysis of Three-Dimensional Strategy for Enhancing Capability for Organizational Learning in Private Enterprises
p.315

Performance Study of Hybrid Solid Oxide Fuel Cell–Gas Turbine Power System
p.319

Application of ArcGIS/MATLAB/ SQL Server/ VC++ Mixed Programming in Solar Energy Engineering
p.323

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 171-172Electronic Protocols for Voting and Bidding Based...

Electronic Protocols for Voting and Bidding Based on Secure Multi-Party Proof

Abstract:

A secure electronic protocol, which can be used for electronic voting and electronic bidding, is proposed. The protocol is based on a new cryptographical model called secure multi-party proof that allows any players and a verifier to securely compute a function in the following sense: each of the players learns nothing about other players’ input and nor any information about the value of , and the verifier obtains the value of and its validity but learns nothing about the input of any of the players. In this paper, we firstly define and construct a secure multi-party proof for any polynomial time function with semi-honest participants and verifier, then construct our secure electronic protocol.

You might also be interested in these eBooks

Engineering Materials, Energy, Management and Control

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 171-172)

Pages:

305-310

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.171-172.305

Citation:

Cite this paper

Online since:

December 2010

Authors:

Dong Qing Xie, Chun Ming Tang

Keywords:

Electronic Protocol, Multiparty Computation, Multi-Party Proof

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] O. Goldreich, H. Krawcyzk, and M. Luby. On the Existence of Pseudorandom Generators. SIAM Journal on Computing, 22(6) pp.1163-1175, (1993).

DOI: 10.1137/0222069

Google Scholar

[2] J. Hastad, R. Impagliazzo, L.A. Levin, and M. Luby. Construction of a Psedorandom Generator from Any One-Way Function. SIAM Journal on Computing, 28(4), pp.1364-1396, (1999).

DOI: 10.1137/s0097539793244708

Google Scholar

[3] Y. Lindell and B. Pinkas. A Proof of Yao's Protocol for Secure Two-Party Computation. Journal of Cryptology, 22(2), pp.161-188, (2009).

DOI: 10.1007/s00145-008-9036-8

Google Scholar

[4] Y. Lindell and B. Pinkas. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In Advances on EUROCRYPT 2007, LNCS 4515, pp.52-78, (2007).

DOI: 10.1007/978-3-540-72540-4_4

Google Scholar

[5] A. Yao. Protocols for Secure Computation. 23th FOCS, pp.160-164, (1982).

Google Scholar