-
1
-
-
30744459451
-
Public-key steganography with active attacks
-
M. Backes and C. Cachin. Public-key steganography with active attacks. In TCC '05, 2005.
-
(2005)
TCC '05
-
-
Backes, M.1
Cachin, C.2
-
2
-
-
84898960610
-
Completeness theorems for fault-tolerant distributed computing
-
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for fault-tolerant distributed computing. In Proc. of STOC '88, pages 1-10, 1988.
-
(1988)
Proc. of STOC '88
, pp. 1-10
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
3
-
-
0026383119
-
Noninteractive zero-knowledge
-
M. Blum, A. D. Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM J. Computing, 20(6):1084-1118, 1991.
-
(1991)
SIAM J. Computing
, vol.20
, Issue.6
, pp. 1084-1118
-
-
Blum, M.1
Santis, A.D.2
Micali, S.3
Persiano, G.4
-
4
-
-
84957868624
-
An information-theoretic model for steganography
-
C. Cachin. An information-theoretic model for steganography. In Proc. of Information Hiding '98, pages 306-318, 1998.
-
(1998)
Proc. of Information Hiding '98
, pp. 306-318
-
-
Cachin, C.1
-
5
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd FOCS, pages 136-145, 2001.
-
(2001)
Proc. 42nd FOCS
, pp. 136-145
-
-
Canetti, R.1
-
6
-
-
0029723583
-
Adaptively secure multi-party computation
-
R. Canetti, U. Feige, O. Goldreich, and M. Noar. Adaptively secure multi-party computation. In Proc. 28th STOC, pages 639-648, 1996.
-
(1996)
Proc. 28th STOC
, pp. 639-648
-
-
Canetti, R.1
Feige, U.2
Goldreich, O.3
Noar, M.4
-
7
-
-
84898947315
-
Multi-party unconditionally secure protocols
-
D. Chaum, C. Crépeau, and I. Damgård. Multi-party unconditionally secure protocols. In STOC '88, 1988.
-
(1988)
STOC '88
-
-
Chaum, D.1
Crépeau, C.2
Damgård, I.3
-
8
-
-
84945299487
-
A secure poker protocol that minimizes the effects of player coalitions
-
Crypto '85, Springer
-
C. Crépeau. A secure poker protocol that minimizes the effects of player coalitions. In Crypto '85, volume 218 of LNCS, pages 73-86. Springer, 1986.
-
(1986)
LNCS
, vol.218
, pp. 73-86
-
-
Crépeau, C.1
-
9
-
-
84974597111
-
Parallel reducibility for information-theoretically secure computation
-
Y. Dodis and S. Micali. Parallel reducibility for information-theoretically secure computation. In CRYPTO '00, pages 74-92, 2000.
-
(2000)
CRYPTO '00
, pp. 74-92
-
-
Dodis, Y.1
Micali, S.2
-
10
-
-
0003979335
-
-
chapter 7 (General Cryptographic Protocols). Cambridge University Press
-
O. Goldreich. Foundations of Cryptography, volume 2, chapter 7 (General Cryptographic Protocols). Cambridge University Press, 2004.
-
(2004)
Foundations of Cryptography
, vol.2
-
-
Goldreich, O.1
-
13
-
-
0023985465
-
A digital signature scheme secure against adaptive chosen-message attacks
-
Apr.
-
S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, Apr. 1988.
-
(1988)
SIAM J. Computing
, vol.17
, Issue.2
, pp. 281-308
-
-
Goldwasser, S.1
Micali, S.2
Rivest, R.L.3
|