Article

Free access

Secure and verifiable schemes for election and general distributed computing problems

Authors:

Ming-Deh A. Huang,

Shang-Hua TengAuthors Info & Claims

PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

Pages 182 - 196

https://doi.org/10.1145/62546.62577

Published: 01 January 1988 Publication History

PDF eReader

References

[1]

G. Brassard, C Crepeau. Non-transitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond. In IEEE FOCS, 1986.

Digital Library

Google Scholar

[2]

ft. C. Benaloh, M. Yung. Distributing the power of a government to enhance the privacy of voters. In A CM POD C, 1986.

Digital Library

Google Scholar

[3]

D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. CA CM 24, pp84-88, Feb. 1981.

Digital Library

Google Scholar

[4]

:I. D. Cohen, M. :l. Fisher. A robust and verifiable cryptographically secure election scheme. In FOCS 85, pp372-382, 1985.

Google Scholar

[5]

J. D. Cohen. improving Privacy i~ Crvptographic Election. TR-545, Yale University, Feb, 1986.

Google Scholar

[6]

R. A. Demillo, N. A. Lynch, M. :I. Merritt. Cryptogxaphic protocols. In A CM STOC, pp383-400, 1982.

Digital Library

Google Scholar

[7]

Z. Galil, S. Haber, M. Yung. Cryptographic computation: secure fault-tolerant protocols and the public-key model. In Crypto87.

Digital Library

Google Scholar

[8]

S. Goldwasscr, S. MicaH. Probabilistic encryption. dCSS 28 (2), 1984.

Google Scholar

[9]

S. Goldwasscx, S. Micali, C. Rackoff. The knowledge of complexity of interactive proof-systems. In A CM STOC, pp291-304, 1985.

Digital Library

Google Scholar

[10]

O. Goldreich, S. MicaH, A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In IEEE FOCS, pp174-187, 1986.

Digital Library

Google Scholar

[11]

O. Goldreich, S. MicaH, A. Wigderson. How to play any mental game. In A CM STOC, pp218- 229, 1987.

Digital Library

Google Scholar

[12]

M-D. A. Huang, S-H. Teng. Secure and Verifiable Schemes for Election and General Distributed Computing Problems. Technical Report CRI 87- 47, Computer Research Institute, USC, 1987.

Google Scholar

[13]

M-D. A. Huang, S-H. Teng. A Universal Problem in Secure and Verifiable Distributed Compufa~ion. Manuscript, USC, 1988.

Google Scholar

[14]

M-D. A. Huang, S-H. Teng. Election Schemes of Optimal Security and Verifiability. Manuscript, USC, 1988.

Google Scholar

[15]

M. Rabin. Digitalized Signatures and Public- Key Functions as Intractable as Fac~oriza~ion MIT/LCS/TR-212, 1979.

Digital Library

Google Scholar

[16]

R. L. Rivest, A. Shamir, L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. CA CM24, pp120-126, Feb. 1978.

Digital Library

Google Scholar

[17]

A. C-C. Yao. Protocols for secure computations. In IEEE FOCS, pp160-164, 1982.

Crossref

Google Scholar

[18]

A. C-C. Yao. Theory and application of tiapdoor functions. In IEEE FOCS, pp80-9I, 1982.

Google Scholar

[19]

A. C-C. Yao. How to generate and exchange secrets. In IEEE FOCS, pp162-167, 1986.

Digital Library

Google Scholar

Cited By

View all

Sehgal SSaroop A(2007)Privacy Preserving Vehicle Purchase MarketplaceProceedings of the International Conference on Computing: Theory and Applications10.1109/ICCTA.2007.107(182-187)Online publication date: 5-Mar-2007
https://dl.acm.org/doi/10.1109/ICCTA.2007.107
Sehgal SPal A(2005)Privacy preserving decentralized method for computing a pareto-optimal solutionProceedings of the 7th international conference on Distributed Computing10.1007/11603771_66(578-583)Online publication date: 27-Dec-2005
https://dl.acm.org/doi/10.1007/11603771_66
Huang MTeng S(2000)A Universal Problem in Secure and Verifiable Distributed ComputationAdvances in Cryptology — CRYPTO’ 8810.1007/0-387-34799-2_27(336-352)Online publication date: 1-Dec-2000
https://doi.org/10.1007/0-387-34799-2_27
Show More Cited By

Index Terms

Secure and verifiable schemes for election and general distributed computing problems

Recommendations

New signature schemes in the standard model based on publicly verifiable CCA-secure public key encryption

Till now, there are not many ways to construct signature schemes in the standard model and recently many researchers show great interest in construction secure signatures in the standard model. CCA secure publicly verifiable public key encryption in the ...
Secure Password Authentication for Distributed Computing
Computational Intelligence and Security

This paper describes secure password-based authentication involving a trusted third party, while the previous secure password authentication schemes focused on authentication involving two parties who shares the password. Kerberos is a well-known ...
Provably secure delegation-by-certification proxy signature schemes
InfoSecu '04: Proceedings of the 3rd international conference on Information security

In this paper, we first show that a previous proxy signature scheme by delegation with certificate is not provably secure under adaptive-chosen message attacks and adaptive-chosen warrant attacks. The scheme does not provide the strong undeniability. ...

Comments

Information & Contributors

Information

Published In

PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

January 1988

303 pages

ISBN:0897912772

DOI:10.1145/62546

Chairman:
Danny Dolev
Hebrew Univ., Jerusalem

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC88

Sponsor:

PODC88: The seventh annual conference on Principles of distributed computing

August 15 - 17, 1988

Ontario, Toronto, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
491
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)2

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sehgal SSaroop A(2007)Privacy Preserving Vehicle Purchase MarketplaceProceedings of the International Conference on Computing: Theory and Applications10.1109/ICCTA.2007.107(182-187)Online publication date: 5-Mar-2007
https://dl.acm.org/doi/10.1109/ICCTA.2007.107
Sehgal SPal A(2005)Privacy preserving decentralized method for computing a pareto-optimal solutionProceedings of the 7th international conference on Distributed Computing10.1007/11603771_66(578-583)Online publication date: 27-Dec-2005
https://dl.acm.org/doi/10.1007/11603771_66
Huang MTeng S(2000)A Universal Problem in Secure and Verifiable Distributed ComputationAdvances in Cryptology — CRYPTO’ 8810.1007/0-387-34799-2_27(336-352)Online publication date: 1-Dec-2000
https://doi.org/10.1007/0-387-34799-2_27
Varnovsky NVerchenko APrimenko E(1993)Mathematical problems in cryptologyJournal of Soviet Mathematics10.1007/BF0109627167:6(3373-3406)Online publication date: Dec-1993
https://doi.org/10.1007/BF01096271
Hankley WTsai P(1992)Ada/TL specification and verification of a distributed computationProceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's10.1145/130069.130098(846-855)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1145/130069.130098
Huang MTeng S(1990)A universal problem in secure and verifiable distributed computationProceedings on Advances in cryptology10.5555/88314.88973(336-352)Online publication date: 1-Feb-1990
https://dl.acm.org/doi/10.5555/88314.88973

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

New signature schemes in the standard model based on publicly verifiable CCA-secure public key encryption

Secure Password Authentication for Distributed Computing

Provably secure delegation-by-certification proxy signature schemes

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

New signature schemes in the standard model based on publicly verifiable CCA-secure public key encryption

Secure Password Authentication for Distributed Computing

Provably secure delegation-by-certification proxy signature schemes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations