-
1
-
-
85062838317
-
Safeguarding cryptographic keys
-
G. R. Blakley. Safeguarding Cryptographic keys, in AFIPS Conference Proceedings, vol. 48, 1979, pp. 313-317.
-
(1979)
AFIPS Conference Proceedings
, vol.48
, pp. 313-317
-
-
Blakley, G.R.1
-
3
-
-
84898960610
-
Completeness theorems for non-cryptographic fault-tolerant distributed computation
-
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, in Proceedings of STOC '88, 1988, pp. 1-10.
-
(1988)
Proceedings of STOC '88
, pp. 1-10
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
4
-
-
0001476931
-
A perfect threshold secret sharing scheme to identify cheaters
-
M. Carpentieri. A perfect threshold secret sharing scheme to identify cheaters, Designs, Codes, and Cryptography n. 5 (1995), 183-187.
-
(1995)
Designs, Codes, and Cryptography
, Issue.5
, pp. 183-187
-
-
Carpentieri, M.1
-
5
-
-
85028775273
-
Size of shares and probability of cheating in threshold schemes
-
EUROCRYPT '93
-
M. Carpentieri, A. De Santis, and U. Vaccaro. Size of shares and probability of cheating in threshold schemes, Lecture Notes in Computer Science, n. 765 (1993), 118-125 (EUROCRYPT '93).
-
(1993)
Lecture Notes in Computer Science
, Issue.765
, pp. 118-125
-
-
Carpentieri, M.1
De Santis, A.2
Vaccaro, U.3
-
7
-
-
0022199386
-
Verifiable secret sharing and achieving simultaneity in presence of faults
-
B. Chor, S. Goldwasser, S. Micali, and B. Awerbach. Verifiable Secret Sharing and Achieving Simultaneity in Presence of Faults, in Proceedings of FOCS '85, 1985, pp. 383-395.
-
(1985)
Proceedings of FOCS '85
, pp. 383-395
-
-
Chor, B.1
Goldwasser, S.2
Micali, S.3
Awerbach, B.4
-
9
-
-
0000613666
-
Non-interactive and information theoretic secure verifiable secret sharing
-
P. Feldman. Non-interactive and Information Theoretic Secure Verifiable Secret Sharing, in Proceedings of FOCS '87, 1987, pp. 427-437.
-
(1987)
Proceedings of FOCS '87
, pp. 427-437
-
-
Feldman, P.1
-
10
-
-
30744474182
-
Cheating in visual cryptography
-
G. Horng, T. Chen, D.-S. Tsai. Cheating in Visual Cryptography, Designs, Codes and Cryptography, n. 38 (2006), 219-236.
-
(2006)
Designs, Codes and Cryptography
, Issue.38
, pp. 219-236
-
-
Horng, G.1
Chen, T.2
Tsai, D.-S.3
-
12
-
-
84949949642
-
Constructions of cheating immune secret sharing
-
ICISC '01
-
J. Pieprzyk and X. M. Zhang. Constructions of Cheating Immune Secret Sharing, Lecture Notes in Computer Science, n. 2288 (2001), 226-243 (ICISC '01).
-
(2001)
Lecture Notes in Computer Science
, Issue.2288
, pp. 226-243
-
-
Pieprzyk, J.1
Zhang, X.M.2
-
14
-
-
0024859552
-
Verifiable secret sharing and multiparty protocols with honest majority
-
T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, in Proceedings of STOC '89, 1989, pp. 73-85.
-
(1989)
Proceedings of STOC '89
, pp. 73-85
-
-
Rabin, T.1
Ben-Or, M.2
-
15
-
-
0018545449
-
How to share a secret
-
A. Shamir. How to Share a Secret, Communications of the ACM, n. 22 (1979), 612-613.
-
(1979)
Communications of the ACM
, Issue.22
, pp. 612-613
-
-
Shamir, A.1
-
16
-
-
0000708528
-
An explication of secret sharing schemes
-
D. R. Stinson. An Explication of Secret Sharing Schemes, Designs, Codes and Cryptography, n. 2 (1992), 357-390.
-
(1992)
Designs, Codes and Cryptography
, Issue.2
, pp. 357-390
-
-
Stinson, D.R.1
-
17
-
-
84944048103
-
Unconditionally secure proactive secret sharing scheme with combinatorial structures
-
SAC '99
-
D. R. Stinson and R. Wei. Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. Lecture Notes in Computer Science, n. 1758 (2000), 200-214 (SAC '99).
-
(2000)
Lecture Notes in Computer Science
, Issue.1758
, pp. 200-214
-
-
Stinson, D.R.1
Wei, R.2
-
18
-
-
0024141971
-
How to share a secret with cheaters
-
M. Tompa and H. Woll. How to Share a Secret with Cheaters, Journal of Cryptology, n. 1 (1988), 133-138.
-
(1988)
Journal of Cryptology
, Issue.1
, pp. 133-138
-
-
Tompa, M.1
Woll, H.2
|