A New Efficient Secure Multi-Party Computation

Yong Long Tang

doi:10.4028/www.scientific.net/AMM.109.626

Paper Titles

Developing Students’ Comprehensive Abilities through Mathematical Modeling Teaching
p.608

Chinese New Word Identification Using N-Gram and PPM Models
p.612

Dynamics of a Pair of Five-Neuron Networks with Delays
p.617

The Study of Point Cloud Data Automatic Merging Technology in 3D Measuring
p.621

A New Efficient Secure Multi-Party Computation
p.626

Study on Cloud Computing in Telecommunications
p.631

A New Fuzzy Support Vector Machine for Credit Scoring
p.636

LAHP-Based Theory of Building e-Commerce Customer Satisfaction Degree Index System
p.641

A Study on the Development Strategies of the 4PL in Ningbo
p.646

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 109A New Efficient Secure Multi-Party Computation

A New Efficient Secure Multi-Party Computation

Abstract:

In an existed multi-party computation protocol, any verifier must be a participant. A new secure multi-party computation among t participants and a verifier was proposed, in which the verifier no belong to participants can learn the final output. Our protocol is more practicable in some important situations, for example, in an electronic bidding, where an arbiter is only a verifier but is usually not a participant.

You might also be interested in these eBooks

Emerging Systems for Materials, Mechanics and Manufacturing

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 109)

Pages:

626-630

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.109.626

Citation:

Cite this paper

Online since:

October 2011

Authors:

Yong Long Tang

Keywords:

Cryptography, Existed Secure Multi-Party Computation, Secure Multi-Party Computation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. Even, O. Goldreich and A. Lempel. A randomized Protocol for Signing Contracts. In Communications of the ACM, 28(1985) 637-647.

DOI: 10.1145/3812.3818

Google Scholar

[2] O. Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, (2004).

Google Scholar

[3] O. Goldreich, S. Goldwasser and S. Micali. How to Construct Random Functions. Journal of the ACM, 33(1986) 792-807.

DOI: 10.1145/6490.6503

Google Scholar

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

DOI: 10.1137/0222069

Google Scholar

[5] 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(1999) 1364-1396.

DOI: 10.1137/s0097539793244708

Google Scholar

[6] J. Kilian and E. Petrank. An Efficient Noninteractive Zero-Knowledge Prroof System for NP with General Assumptions. Journal of Cryptology, 11(1998) 1-27.

DOI: 10.1007/s001459900032

Google Scholar

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

DOI: 10.1007/s00145-008-9036-8

Google Scholar