Secure and verifiable schemes for election and general distributed computing problems

Authors:
Ming-Deh A. Huang;Shang-Hua Teng
Affiliations:
Department of Computer Science, University of Southern California, Los Angeles, California;Department of Computer Science, University of Southern California, Los Angeles, California
Venue:
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Year:
1988

Distributing the power of a government to enhance the privacy of voters

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic protocols

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

A universal problem in secure and verifiable distributed computation

CRYPTO '88 Proceedings on Advances in cryptology
Ada/TL specification and verification of a distributed computation

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Privacy preserving decentralized method for computing a pareto-optimal solution

IWDC'05 Proceedings of the 7th international conference on Distributed Computing

Hi-index	0.00