{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:32:30Z","timestamp":1759336350689},"reference-count":42,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Security Technical Report"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1363-4127(02)02003-4","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"11-21","source":"Crossref","is-referenced-by-count":2,"title":["Is there a Need for Survivable Computation in Critical Infrastructures?"],"prefix":"10.1016","volume":"7","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1363-4127(02)02003-4_BIB1","unstructured":"Spies in the wires. Horizon BBC2 (Television), February 5, 1984."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 113\u2013131, May 2\u20134, 1988.","DOI":"10.1145\/62212.62223"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB3","unstructured":"B. Blakley. The measure of information security is dollars. Workshop on Economics and Information Security University of California, Berkeley, May 16\u201317, 2002."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB4","doi-asserted-by":"crossref","unstructured":"R. Blakley. Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc., pp. 313\u2013317, 1979. vol.48.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB5","doi-asserted-by":"crossref","unstructured":"M. Burmester, Y. Desmedt, and Y. Wang. Using approximation hardness to achieve dependable computation. In M. Luby, J. Rolim, and M. Serna, editors, Randomization and Approximation Techniques in Computer Science, Proceedings (Lecture Notes in Computer Science 1518), pp. 172\u2013186. Springer-Verlag, October, 8\u201310 1998. Barcelona, Spain.","DOI":"10.1007\/3-540-49543-6_15"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB6","unstructured":"C. Burns. Two Asian markets set record with no hint of Y2K bug. January 2, 2000. http:\/\/www.cnn.com\/2000\/TECH\/computing\/01\/02\/y2k.reports.roundup.04\/index.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB7","unstructured":"Paul Cashman. The dot.com deadpools, the end of the dot.com craze. May 1, 2001. http:\/\/www.cs.uwa.edu.au\/undergraduate\/units\/233.410\/ book2001\/paulc\/"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 11\u201319, May 2\u20134, 1988.","DOI":"10.1145\/62212.62214"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB9","unstructured":"Rob Conlin. Toysrus.com slapped with class action lawsuit. E-Commerce Times, see also http:\/\/www.ecommercetimes.com\/perl\/story\/2190.html, January 12, 2000."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB10","unstructured":"Dominique Deckmyn. De Jager defends Y2K hype. January 4, 2000. http:\/\/www.cnn.com\/2000\/TECH\/computing\/01\/04\/dejager.y2k.idg\/index.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB11","unstructured":"Y. Desmedt, M. Burmester, and Y. Wang. Are we on the right track to achieve survivable computer network systems. Accepted at the Fourth Information Survivability Workshop (ISW-2001), March 18\u201320."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB12","unstructured":"Desmedt, J. Vandewalle, and R. Govaerts. Cryptography protects information against several frauds. In Proc. Intern. Carnahan Conference on Security Technology, pp. 255\u2013259, Z\u00fcrich, Switzerland, October 4\u20136, 1983. IEEE."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB13","doi-asserted-by":"crossref","unstructured":"Desmedt and Y. Wang. Maximum flows and critical vertices in and\/or graphs. Accepted for COCOON'02, August 15\u201317, 2002, Singapore, and to appear in the proceedings (Lecture Notes in Computer Science), Springer Verlag.","DOI":"10.1007\/3-540-45655-4_27"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB14","doi-asserted-by":"crossref","unstructured":"Y. G. Desmedt. Threshold cryptography. European Trans. on Telecommunications, 5(4), pp. 449\u2013457, July\u2013August 1994. (Invited paper).","DOI":"10.1002\/ett.4460050407"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB15","doi-asserted-by":"crossref","unstructured":"Y. Desmedt. Some recent research aspects of threshold cryptography. In E. Okamoto, G. Davida, and M. Mambo, editors, Information Security, Proceedings (Lecture Notes in Computer Science 1396), pp. 158\u2013173. Springer-Verlag, 1997. Invited lecture, September 17\u201319, 1997, Tatsunokuchi, Ishikawa, Japan, Springer-Verlag.","DOI":"10.1007\/BFb0030418"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB16","unstructured":"Y. Desmedt, M. Burmester, and Y. Wang. Using economics to model threats and security in distributed computing. Workshop on Economics and Information Security, Berkeley, May 16\u201317, 2002, http:\/\/www.sims.berkeley.edu\/resources\/ affiliates\/workshops\/econsecurity\/econws\/33.ps."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB17","doi-asserted-by":"crossref","unstructured":"D. Dolev. The Byzantine generals strike again. Journal of Algorithms, 3, pp. 14\u201330, 1982.","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB18","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(1), pp. 17\u201347, January 1993.","DOI":"10.1145\/138027.138036"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB19","unstructured":"G. Ensley. Common flaw in security exploited. Tallahassee Democrat, p. 1, September 19, 2001."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB20","unstructured":"S. Even. Graph algorithms. Computer science press, Rockville, Maryland, 1979."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB21","doi-asserted-by":"crossref","unstructured":"M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. In K. Y. Lam, E. Okamoto, and C. Xing, editors, Advances in Cryptology- ASIACRYPT '99, volume 1716 of Lecture Notes in Computer Science, pp. 232\u2013246. Springer-Verlag, November, 14\u201318 1999.","DOI":"10.1007\/978-3-540-48000-6_19"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB22","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but the validity of the assertion and the methodology of cryptographic protocol design. Preliminary version, MIT, 20th March 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB23","unstructured":"M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons Ltd., New York, 1984."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB24","doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 25\u201334, August 1997.","DOI":"10.1145\/259380.259412"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB25","unstructured":"Is there trouble ahead for travel agents? April 2000. http:\/\/www.hotel-online.com\/Neo\/News\/PressReleases2000_2nd\/Apr00_IssuesInternetSites.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB26","unstructured":"David Isenberg. Electronic Pearl Harbor? more hype than threat. Cato Institute, http:\/\/www.cato.org\/dailys\/01-03-00a.html, January 3, 2000."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB27","unstructured":"M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures. In Proc. IEEE Global Telecommunications Conf., Globecom'87, pp. 99\u2013102. IEEE Communications Soc. Press, 1987."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB28","unstructured":"J. Kessel. Report: Neutral nations' trade kept Nazi war machine going. June 2, 1998. http:\/\/www.cnn.com\/US\/9806\/02\/us.nazi.gold\/"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB29","doi-asserted-by":"crossref","unstructured":"L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on programming languages and systems, 4(2), pp. 382\u2013401, 1982.","DOI":"10.1145\/357172.357176"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB30","unstructured":"F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. North-Holland Publishing Company, 1978."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB31","unstructured":"Y. Desmedt (moderator). Towards a funded research agenda. Fourth Information Survivability Workshop, Vancouver, Canada, March 18\u201320, 2002, http:\/\/www.cert.org\/research\/isw\/isw2001\/slides\/summary-work-group-2.pdf."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB32","unstructured":"J.R. Mooneyham. The signposts timeline: Shopping and employment are changing drastically in the developed nations (2014). http:\/\/ www.jrmooneyham.com\/ecom.html, December 1999."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB33","unstructured":"Catherine Mulroney. Gunfight at the on-line corral: As airlines, internet travel sites and traditional agencies shoot it out, the battle for ticket sales has become a virtual Wild West. Special to The Globe and Mail, October 10, 2000. http:\/\/www.globeandmail.com\/travel\/reports\/10102000\/ Gunfight.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB34","unstructured":"Critical foundations, the report of the President's Commission on Critical Infrastructure Protection. http:\/\/www.ciao.gov\/resource\/pccip\/PCCIP_Report.pdf, October 1997."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB35","unstructured":"Report of the accountability review boards on the embassy bombings in Nairobi and Dar es Salaam on August 7, 1998. January 1999. http:\/\/ www.state.gov\/www\/regions\/africa\/accountability_report.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB36","doi-asserted-by":"crossref","unstructured":"Shamir. How to share a secret. Commun. ACM, 22, pp. 612\u2013613, November 1979.","DOI":"10.1145\/359168.359176"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB37","unstructured":"The Inman report. http:\/\/www.fas.org\/irp\/threat\/inman\/index.html, 1985."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB38","unstructured":"L. Scott Tillett. Critics: State Dept. Y2K-travel reports lack detail. September 15, 1999. http:\/\/www.cnn.com\/TECH\/computing\/9909\/15\/critics.y2k.idg\/index.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB39","unstructured":"U.S. State Department advises travelers to make New Year backup plans. http:\/\/www.cnn.com\/1999\/TRAVEL\/NEWS\/12\/14\/Y2K.notice\/index.html, December 14, 1999."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB40","unstructured":"K. Wallace. Clinton's dual New Year's eve role: host, Y2K overseer. December 29, 1999. http:\/\/www.cnn.com\/1999\/ALLPOLITICS\/stories\/12\/29\/whitehouse.y2k\/index.html"},{"key":"10.1016\/S1363-4127(02)02003-4_BIB41","unstructured":"Will Y2K bug stop flow of milk? http:\/\/cnn.com\/TECH\/computing\/9903\/25\/foodchain.y2k.hln\/index.html."},{"key":"10.1016\/S1363-4127(02)02003-4_BIB42","unstructured":"Yawn2K? bug mostly a no-show as world returns to work. January 3, 2000. http:\/\/www.cnn.com\/2000\/TECH\/computing\/01\/03\/y2k.bug.reports\/index.html"}],"container-title":["Information Security Technical Report"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1363412702020034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1363412702020034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T15:31:07Z","timestamp":1682350267000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1363412702020034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1363412702020034"],"URL":"https:\/\/doi.org\/10.1016\/s1363-4127(02)02003-4","relation":{},"ISSN":["1363-4127"],"issn-type":[{"value":"1363-4127","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}