-
1
-
-
0003745894
-
-
Ph.D. dissertation, Department of Computer Science, Technion, , Kesalsaba, Israel
-
A. Beimel, "Secure schemes for secret sharing and key distribution," Ph.D. dissertation, Department of Computer Science, Technion, , Kesalsaba, Israel, 1996.
-
(1996)
Secure Schemes for Secret Sharing and Key Distribution
-
-
Beimel, A.1
-
2
-
-
38049002374
-
Weakly-private secret sharing schemes
-
A. Beimel and M. Franklin, "Weakly-private secret sharing schemes," in Proc. 4th Theory Crypt, Conf, (TCC), 2007, vol. 4392, pp. 253-272.
-
(2007)
Proc. 4th Theory Crypt, Conf, (TCC)
, vol.4392
, pp. 253-272
-
-
Beimel, A.1
Franklin, M.2
-
4
-
-
85062838317
-
Safeguarding cryptographic keys
-
G. R. Blakley, "Safeguarding cryptographic keys," in Proc. AFIPS Nat. Comput. Conf., 1979, vol. 48, pp. 313-317.
-
(1979)
Proc. AFIPS Nat. Comput. Conf.
, vol.48
, pp. 313-317
-
-
Blakley, G.R.1
-
6
-
-
33749269532
-
Efficient sharing of many secrets
-
C. Blundo, A. De Santis, and U. Vaccaro, "Efficient sharing of many secrets," in Proc. Symp. Theor. Aspects Comput. Sci., 1993, pp. 692-703.
-
(1993)
Proc. Symp. Theor. Aspects Comput. Sci.
, pp. 692-703
-
-
Blundo, C.1
De Santis, A.2
Vaccaro, U.3
-
7
-
-
0042854815
-
On secret sharing schemes
-
PII S0020019097001944
-
C. Blundo, A. De Santis, and U. Vaccaro, "On secret sharing schemes," Inf. Process. Lett., vol. 65, no. 1, pp. 25-32, 1998. (Pubitemid 128393453)
-
(1998)
Information Processing Letters
, vol.65
, Issue.1
, pp. 25-32
-
-
Blundo, C.1
De Santis, A.2
Vaccaro, U.3
-
8
-
-
70350343371
-
Asymptotically good ideal linear secret sharing with strong multiplication over Any finite field
-
Aug.
-
I. Cascudo, H. Chen, R. Cramer, and C. Xing, "Asymptotically good ideal linear secret sharing with strong multiplication over Any finite field," in Proc. 29th Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA, USA, Aug. 2009, pp. 466-486.
-
(2009)
Proc. 29th Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA, USA
, pp. 466-486
-
-
Cascudo, I.1
Chen, H.2
Cramer, R.3
Xing, C.4
-
9
-
-
80051980228
-
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
-
Aug.
-
I. Cascudo, R. Cramer, and C. Xing, "The torsion-limit for algebraic function fields and its application to arithmetic secret sharing," in Proc. 31st Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA, Aug. 2011, pp. 685-705.
-
(2011)
Proc. 31st Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA
, pp. 685-705
-
-
Cascudo, I.1
Cramer, R.2
Xing, C.3
-
10
-
-
84859739517
-
Algebraic geometric secret sharing schemes and secure multi-party computation over small fields
-
Aug.
-
H. Chen and R. Cramer, "Algebraic geometric secret sharing schemes and secure multi-party computation over small fields," in Proc. 26th Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA, Aug. 2006, pp. 516-531.
-
(2006)
Proc. 26th Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA
, pp. 516-531
-
-
Chen, H.1
Cramer, R.2
-
11
-
-
54749107188
-
Secure computation from random error correcting codes
-
May
-
H. Chen, R. Cramer, S. Goldwasser, R. de Haan, and V. Vaikuntanathan, "Secure computation from random error correcting codes," in Proc. 26th Int. Conf. Theory Appl. Cryptographic Techniques (EUROCRYPT), Barcelona, Spain, May 2007, pp. 329-346.
-
(2007)
Proc. 26th Int. Conf. Theory Appl. Cryptographic Techniques (EUROCRYPT), Barcelona, Spain
, pp. 329-346
-
-
Chen, H.1
Cramer, R.2
Goldwasser, S.3
De Haan, R.4
Vaikuntanathan, V.5
-
12
-
-
84948975649
-
General secure multi-party computation from any linear secret sharing scheme
-
May
-
R. Cramer, I. Damgaard, and U. Maurer, "General secure multi-party computation from any linear secret sharing scheme," in Proc. 19th Int. Conf. Theory Appl. Cryptographic Techniques (EUROCRYPT), Brugge, Belgium, May 2000, pp. 316-334.
-
(2000)
Proc. 19th Int. Conf. Theory Appl. Cryptographic Techniques (EUROCRYPT), Brugge, Belgium
, pp. 316-334
-
-
Cramer, R.1
Damgaard, I.2
Maurer, U.3
-
13
-
-
84937432976
-
Optimal black-box secret sharing over arbitrary Abelian groups
-
Aug.
-
R. Cramer and S. Fehr, "Optimal black-box secret sharing over arbitrary Abelian groups," in Proc. 22nd Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA, Aug. 2002, vol. 2442, pp. 272-287.
-
(2002)
Proc. 22nd Annu. Int. Conf. Adv. Cryptology (CRYPTO), Santa Barbara, CA
, vol.2442
, pp. 272-287
-
-
Cramer, R.1
Fehr, S.2
-
14
-
-
84945116168
-
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
-
Advances in Cryptology - EUROCRYPT 2001 International Conference on the Theory and Application of Cryptographic Techniques
-
Y. Dodis, A. Sahai, and A. Smith, "On perfect and adaptive security in exposure-resilient cryptography," in Proc. 20th Annu. Int. Conf. Theory Appl. Cryptographic Techniques (EUROCRYPT), Innsbruck, Austria, May 2001, vol. 2045, pp. 301-324. (Pubitemid 33275839)
-
(2001)
Lecture Notes in Computer Science
, Issue.2045
, pp. 301-324
-
-
Dodis, Y.1
Sahai, A.2
Smith, A.3
-
15
-
-
0000210106
-
A bound for error-correcting codes
-
J. H. Griesmer, "A bound for error-correcting codes," IBMJ. Res. Develop., vol. 4, pp. 532-542, 1960.
-
(1960)
IBMJ. Res. Develop.
, vol.4
, pp. 532-542
-
-
Griesmer, J.H.1
-
17
-
-
0001652944
-
Perfect secret sharing schemes on five participants
-
W.-A. Jackson and K. Martin, "Perfect secret sharing schemes on five participants," Des. Codes Cryptogr., vol. 9, pp. 267-286, 1996. (Pubitemid 126708419)
-
(1996)
Designs, Codes, and Cryptography
, vol.9
, Issue.3
, pp. 267-286
-
-
Jackson, W.-A.1
Martin, K.M.2
-
19
-
-
0020543282
-
On secret sharing systems
-
Jan.
-
E. D. Karnin, J. W. Greene, and M. Hellman, "On secret sharing systems," IEEE Trans. Inf. Theory, vol. IT-29, pp. 35-41, Jan. 1983.
-
(1983)
IEEE Trans. Inf. Theory
, vol.IT-29
, pp. 35-41
-
-
Karnin, E.D.1
Greene, J.W.2
Hellman, M.3
-
21
-
-
0348104460
-
Minimal codewords and secret sharing
-
Aug.
-
J. L. Massey, "Minimal codewords and secret sharing," in Proc. 6th Joint Swedish-Russian Workshop Inf. Theory, Molle, Sweden, Aug. 1993, pp. 269-279.
-
(1993)
Proc. 6th Joint Swedish-Russian Workshop Inf. Theory, Molle, Sweden
, pp. 269-279
-
-
Massey, J.L.1
-
22
-
-
0019608784
-
On sharing secrets and reed-solomon codes
-
DOI 10.1145/358746.358762
-
R. J. McEliece and D. V. Sarwate, "On sharing secrets and Reed- Solomon codes," Comm. ACM, vol. 24, no. 9, pp. 583-584, 1981. (Pubitemid 12466159)
-
(1981)
Communications of the ACM
, vol.24
, Issue.9
, pp. 583-584
-
-
McEliece, R.J.1
Sarwate, D.V.2
-
23
-
-
1942544259
-
Some basic properties of general nonperfect secret sharing schemes
-
W. Ogata and K. Kurosawa, "Some basic properties of general nonperfect secret sharing schemes," J. Universal Comput. Sci., vol. 4, no. 8, pp. 690-704, 1998. (Pubitemid 128790113)
-
(1998)
Journal of Universal Computer Science
, vol.4
, Issue.8
, pp. 690-704
-
-
Ogata, W.1
Kurosawa, K.2
-
26
-
-
0018545449
-
How to share a secret
-
A. Shamir, "How to share a secret," Comm. ACM, vol. 22, no. 11, pp. 612-613, 1979.
-
(1979)
Comm. ACM
, vol.22
, Issue.11
, pp. 612-613
-
-
Shamir, A.1
|