Is there a Need for Survivable Computation in Critical Infrastructures?

[1]  Ueli Maurer,et al.  Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.

[2]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[3]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[4]  Matthias Fitzi,et al.  General Adversaries in Unconditional Multi-party Computation , 1999, ASIACRYPT.

[5]  Yongge Wang,et al.  Maximum Flows and Critical Vertices in AND/OR Graphs , 2002, COCOON.

[6]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[7]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[8]  Yvo Desmedt,et al.  Some Recent Research Aspects of Threshold Cryptography , 1997, ISW.

[9]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[10]  Yongge Wang,et al.  Using Approximation Hardness to Achieve Dependable Computation , 1998, RANDOM.

[11]  Shimon Even,et al.  Graph Algorithms , 1979 .

[12]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[13]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[14]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[15]  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).

[16]  D. Reid,et al.  Are we on the right track? , 2001, The Australian journal of physiotherapy.