[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/112600.112605acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article
Free access

How to withstand mobile virus attacks (extended abstract)

Published: 01 July 1991 Publication History
First page of PDF

References

[1]
L. Adelman Abstract Theory o/ Computer Viruses CRYPTO 88.
[2]
Bar Ilan J. and D. Beaver, Non. Cryptographic Secure Computation in Constant Rounds PODC 1989, ACM.
[3]
Beaver D., S. Micali and P. Rogaway, The Round Complexity of Secure Protocols, STOC 1990, ACM, pp. 503-513.
[4]
Beaver D., S. Goldwasser Multiparty Computation with Faulty Majority FOCS 1989, IEEE, pp. 468-473.
[5]
Ben-Or M., S. Goldwasser and A. Wigderson, Completeness Theorem for Noncryptographic Fault-tolerant Distributed Computing, STOC 1988, ACM, pp. 1-10.
[6]
Ben-Or M. and G. E1-Yaniv., Manuscript.
[7]
D. Chaum, C. Crepeau and i. Damgard, Multi. party Unconditionally Secure Protocols, STOC 1988, ACM, pp. 11-19.
[8]
F. Cohen, Computer Viruses, Ph.D. dissertation, UCS, 1986.
[9]
I. Cidon, I. Goapl, and S. Katten, New Models and Algorithms for Future Networks, 7-th ACM PODC, pp. 75-89.
[10]
D. Denning, An Intrusion. Detection Model, IEEE Sym. on Security and Privacy, 1986, pp. 118-131.
[11]
E.W. Dijkstra, Sel/-Stabilizing Systems in spite o/Distributed Control, CA CM, 17, 1974, pp. 643-644.
[12]
D. Dolev, C. Dwork, O. Waarts and M. Yung, Per/ectly Secure Message Transmission, FOCS 1990, IEEE.
[13]
J. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan, Making Data Structure Persistent, STOC 1986, ACM.
[14]
M. Eichin and J. Rochlis, With Microscope and Tweezers: An Analysis of the Internet Virus of November 1988, IEEE Sym. on Security and Privacy, 1989, pp. 326-343.
[15]
R. Feldman and S. Micali, An Optimal Algorithms For Synchronous Byzantine Agreement, STOC 1988, ACM, pp. 148-161.
[16]
P. Feldman Optimal Algorithms for Byzantine Agreement, MIT Ph.D. Thesis, 1988.
[17]
M. Franklin and M. Yung, Parallel Secure Distributed Computing, manuscript.
[18]
Z. Galil, S. Haber and M. Yung, Cryptographic Computations and the Public-Key Model, The 7-th Crypto 1987, Springer-Verlag, pp. 135- 155.
[19]
O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But their Validity, FOCS 1986, iEEE, pp. 174-187.
[20]
O. Goldreich, S. Micali and A. Wigderson, How to Play any Mental Poker, STOC 1987, ACM, pp. 218-229.
[21]
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity o/ Interactive Proo/. Systems, STOC 1985, ACM, pp. 291-304.
[22]
M. Joseph, and A. Avizienis, A Fault- Tolerance Approach to Computer Viruses, IEEE Sym. on Security and Privacy, 1988, pp. 52-58.
[23]
P.A. Kager, Limiting the Damage Potential o/ Discretionary Trojan Horses, IEEE Sym. on Security and Privacy, 1987, pp. 32-37.
[24]
Jeff Kephart and Steve White, Directed-Graph Epidemiological Models o/ Computer Viruses, IBM Research Report, also in iEEE Sym. on Security and Privacy, 1991.
[25]
S. MicaJi and P. Rogaway Secure Computation, a manuscript.
[26]
S. Micali and T. Rabin. Collective Coin Tossing without Assumptions nor Broadcast, Crypto-90.
[27]
J. Piccioto, The Design o/an Effective Auditing Subsystem, IEEE Sym. on Security and Privacy, 1987, pp. 13-22.
[28]
M. Pease, R. Shostak, and L. Lamport Reaching agreement in the presence o//aults, JACM, 27(2), 1980.
[29]
S-P. Shieh, and V. Gligor, Auditing the Use o/Covert Channels in Secure Systems, IEEE Sym. on Security and Privacy, 1990, pp. 285- 295.
[30]
T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, STOC 1989, ACM, pp. 73-85.
[31]
Steve White, Personal Communication.

Cited By

View all
  • (2025)Threshold CryptographyEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_330(2602-2609)Online publication date: 8-Jan-2025
  • (2024)Key Backup and Recovery for Resilient DID EnvironmentMathematics10.3390/math1206083012:6(830)Online publication date: 12-Mar-2024
  • (2024)Fast Two-party Threshold ECDSA with Proactive SecurityProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670387(1567-1580)Online publication date: 2-Dec-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing
July 1991
355 pages
ISBN:0897914392
DOI:10.1145/112600
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1991

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

PODC91
Sponsor:

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)175
  • Downloads (Last 6 weeks)19
Reflects downloads up to 16 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Threshold CryptographyEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_330(2602-2609)Online publication date: 8-Jan-2025
  • (2024)Key Backup and Recovery for Resilient DID EnvironmentMathematics10.3390/math1206083012:6(830)Online publication date: 12-Mar-2024
  • (2024)Fast Two-party Threshold ECDSA with Proactive SecurityProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670387(1567-1580)Online publication date: 2-Dec-2024
  • (2024)Secure Archival is Hard... Really HardProceedings of the 16th ACM Workshop on Hot Topics in Storage and File Systems10.1145/3655038.3666093(38-46)Online publication date: 8-Jul-2024
  • (2024)hinTS: Threshold Signatures with Silent Setup2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00057(3034-3052)Online publication date: 19-May-2024
  • (2024)Modeling Mobile Crash in Byzantine Consensus2024 IEEE 37th Computer Security Foundations Symposium (CSF)10.1109/CSF61375.2024.00043(159-171)Online publication date: 8-Jul-2024
  • (2024)A Dynamic Proactive Secret Sharing Scheme for Quadratic FunctionsIEEE Access10.1109/ACCESS.2024.336668812(25749-25761)Online publication date: 2024
  • (2024)A novel approach for long-term secure storage of domain independent videosJournal of Visual Communication and Image Representation10.1016/j.jvcir.2024.104279104(104279)Online publication date: Oct-2024
  • (2024)Statistical Layered MPCTheory of Cryptography10.1007/978-3-031-78023-3_12(362-394)Online publication date: 3-Dec-2024
  • (2024)Threshold Encryption with Silent SetupAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68394-7_12(352-386)Online publication date: 18-Aug-2024
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media