Secure and verifiable schemes for election and general distributed computing problems

This paper explores the idea of using simple secure and verifiable distributed protocols as building blocks for ccnstructing more complicated protocols. A notion of reduction among multi-party problems is introduced and formally defined. The very simple and natural distributed sum problem is shown to be universal under the notion of reduction. An optimally secure, verifiable, and robust protocol for the distributed sum problem and the closely related election problem is presented. The distributed sum protocol together with the proof of reduction from the multi-party problems yields an efficient systematic method for the automatic generation of secure and verifiable protocols for all multi-party problems.

[1]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[2]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[3]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Gilles Brassard,et al.  Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[6]  Shang-Hua Teng,et al.  A Universal Problem in Secure and Verifiable Distributed Computation , 1988, CRYPTO.

[7]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[8]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[9]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[10]  Moti Yung,et al.  Distributing the power of a government to enhance the privacy of voters , 1986, PODC '86.

[11]  Nancy A. Lynch,et al.  Cryptographic protocols , 1982, STOC '82.

[12]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[13]  Michael J. Fischer,et al.  A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[15]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[16]  Moti Yung,et al.  Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.