-
1
-
-
84898960610
-
Completeness theorems for non-cryptographic fault-tolerant distributed computation
-
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC (May 2–4, 1988) pp. 1–10
-
(1988)
Theory of Computing
, pp. 1-10
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
3
-
-
9744259321
-
-
In Computer Security—ESORICS 94 (Lecture Notes in Computer Science 875)
-
Beth, T., Borcherding, M., Klein, B.: Valuation of trust in open networks. In Computer Security—ESORICS 94 (Lecture Notes in Computer Science 875) (1994) Springer-Verlag pp. 3–18 275
-
(1994)
Valuation of Trust in Open Networks
, pp. 3-18
-
-
Beth, T.1
Borcherdingklein, M.2
-
5
-
-
0345872645
-
Trust and security: A new look at the Byzantine generals problem
-
Burmester, M., Desmedt, Y., Kabatianskii, G.: Trust and security: A new look at the Byzantine generals problem. In Network Threats, DIMACS, Series in Discrete Mathematics and Theoretical Computer Science, December 2–4, 1996, vol. 38 (1998) R. N. Wright and P. G. Neumann, Eds., AMS 274, 275, 276, 277
-
(1996)
In Network Threats, DIMACS, Series in Discrete Mathematics and Theoretical Computer Science
, vol.38
-
-
Burmester, M.1
Desmedt, Y.2
Kabatianskii, G.3
-
6
-
-
84898947315
-
Multiparty unconditionally secure protocols
-
Chaum, D., Crépeau, C., Damgárd, I.: Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC (May 2–4, 1988) pp. 11–19
-
(1988)
Proceedings of the Twentieth Annual ACM Symp
, pp. 11-19
-
-
Chaum, D.1
Crépeau, C.2
Damgárd, I.3
-
7
-
-
0009768331
-
The Byzantine generals strike again
-
Dolev, D.: The Byzantine generals strike again. Journal of Algorithms 3 (1982) 14–30
-
(1982)
Journal of Algorithms
, vol.3
, pp. 14-30
-
-
Dolev, D.1
-
8
-
-
0027341860
-
Perfectly secure message transmission
-
Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of the ACM 40 (1993) 17–47
-
(1993)
Journal of the ACM
, vol.40
, pp. 17-47
-
-
Dolev, D.1
Dwork, C.2
Waarts, O.3
Yung, M.4
-
9
-
-
84956864812
-
Graph algorithms. Computer science press Rockville
-
Even, S.: Graph algorithms. Computer science press Rockville, Maryland 1979
-
(1979)
Maryland
-
-
Even, S.1
-
10
-
-
84957653101
-
In Advances in Cryptology — Eurocrypt’98, Proceedings (Lecture Notes in Computer Science 1403) (
-
Franklin, M., Wright, R.: Secure communication in minimal connectivity models. In Advances in Cryptology — Eurocrypt’98, Proceedings (Lecture Notes in Computer Science 1403) (1998) K. Nyberg, Ed. Springer-Verlag pp. 346–360
-
(1998)
Secure Communication in Minimal Connectivity Models
, pp. 346-360
-
-
Franklin, M.1
Wright, R.2
-
12
-
-
1542674248
-
Fault-tolerant computation in the full information model
-
Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM J. Comput. 27 (1998) 506–544
-
(1998)
SIAM J. Comput
, vol.27
, pp. 506-544
-
-
Goldreich, O.1
Goldwasser, S.2
Linial, N.3
-
13
-
-
0023545076
-
How to play any mental game
-
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In Proceedings of the Nineteenth annual ACM Symp. Theory of Computing, STOC (May 25–27, 1987) pp. 218–229
-
(1987)
Proceedings of the Nineteenth Annual ACM Symp
, pp. 218-229
-
-
Goldreich, O.1
Micali, S.2
Wigderson, A.3
-
15
-
-
0009771253
-
-
Prentice-Hall Englewood Cliffs, New Jersey
-
Kaufman, C., Perlman, R., Speciner, M.: Network Security. Prentice-Hall Englewood Cliffs, New Jersey 1995
-
(1995)
Network Security
-
-
Kaufman, C.1
Perlman, R.2
Speciner, M.3
-
16
-
-
84976699318
-
The Byzantine generals problem
-
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on programming languages and systems 4 (1982) 382–401
-
(1982)
ACM Transactions on Programming Languages and Systems
, vol.4
, pp. 382-401
-
-
Lamport, L.1
Shostak, R.2
Pease, M.3
-
17
-
-
84947294004
-
-
In Computer Security— ESORICS 96 (Lecture Notes in Computer Science
-
Maurer, U.: Modeling public-key infrastructure. In Computer Security— ESORICS 96 (Lecture Notes in Computer Science 1146) (1996) Springer-Verlag pp. 325–350 275
-
(1996)
Modeling Public-Key Infrastructure
, pp. 325-350
-
-
Maurer, U.1
-
18
-
-
84976810569
-
Reaching agreement in the presence of faults
-
Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of ACM 27 (1980) 228–234
-
(1980)
Journal of ACM
, vol.27
, pp. 228-234
-
-
Pease, M.1
Shostak, R.2
Lamport, L.3
-
19
-
-
0018683804
-
Encryption and secure computer networks
-
Popek, G. J., Kline, C. S.: Encryption and secure computer networks. ACM Computing Surveys 11 (1979) 335–356
-
(1979)
ACM Computing Surveys
, vol.11
, pp. 335-356
-
-
Popek, G.J.1
Kline, C.S.2
-
22
-
-
24944432519
-
Advances in Cryptology — Eurocrypt’99, Proceedings (Lecture Notes in Computer Science 1592) (1999) J. Stern, Ed
-
Wang, Y., Desmedt, Y.: Secure communication in broadcast channels. In Advances in Cryptology — Eurocrypt’99, Proceedings (Lecture Notes in Computer Science 1592) (1999) J. Stern, Ed. Springer-Verlag pp. 446–458
-
Secure Communication in Broadcast Channels
, vol.446-458
-
-
Wang, Y.1
Desmedt, Y.2
|