-
1
-
-
0018545449
-
How to share a secret
-
A. Shamir, "How to share a secret", Commun. ACM, vol. 22, pp. 612-613, 1979.
-
(1979)
Commun. ACM
, vol.22
, pp. 612-613
-
-
Shamir, A.1
-
2
-
-
85062838317
-
Safeguarding cryptographic keys
-
R. E. Merwin, J. T. Zanca, and M. Smith, Eds., AFIPS Press, ser. AFIPS Conf. Proc.
-
G. R. Blakley, "Safeguarding cryptographic keys", in Proc. 1979 AFIPS Nat. Comput. Conf., R. E. Merwin, J. T. Zanca, and M. Smith, Eds., 1979, vol. 48, pp. 313-317, AFIPS Press, ser. AFIPS Conf. Proc.
-
(1979)
Proc. 1979 AFIPS Nat. Comput. Conf.
, vol.48
, pp. 313-317
-
-
Blakley, G.R.1
-
3
-
-
0023543848
-
Secret sharing schemes realizing general access structure
-
M. Ito, A. Saito, and T. Nishizeki, "Secret sharing schemes realizing general access structure", in Proc. IEEE Global Telecommun. Conf. Globecom 87, 1987, pp. 99-102.
-
(1987)
Proc. IEEE Global Telecommun. Conf. Globecom
, vol.87
, pp. 99-102
-
-
Ito, M.1
Saito, A.2
Nishizeki, T.3
-
5
-
-
84898960610
-
Completeness theorems for noncryptographic fault-tolerant distributed computations
-
M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for noncryptographic fault-tolerant distributed computations", in Proc. 20th ACM Symp. Theory of Comput., 1988, pp. 1-10.
-
(1988)
Proc. 20th ACM Symp. Theory of Comput.
, pp. 1-10
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
6
-
-
84898947315
-
Multiparty unconditionally secure protocols
-
D. Chaum, C. Crépeau, and I. Damgård, "Multiparty unconditionally secure protocols", in Proc. 20th ACM Symp. Theory of Comput., 1988, pp. 11-19.
-
(1988)
Proc. 20th ACM Symp. Theory of Comput.
, pp. 11-19
-
-
Chaum, D.1
Crépeau, C.2
Damgård, I.3
-
7
-
-
84948975649
-
General secure multi-party computation from any linear secret-sharing scheme
-
B. Preneel, Ed., ser. Lecture Notes in Comput. Sci., Springer-Verlag
-
R. Cramer, I. Damgård, and U. Maurer, "General secure multi-party computation from any linear secret-sharing scheme", in Adv. Cryptol.-EUROCRYPT 2000, B. Preneel, Ed., 2000, vol. 1807, pp. 316-334, ser. Lecture Notes in Comput. Sci., Springer-Verlag.
-
(2000)
Adv. Cryptol.-EUROCRYPT 2000
, vol.1807
, pp. 316-334
-
-
Cramer, R.1
Damgård, I.2
Maurer, U.3
-
8
-
-
85022187530
-
Shared generation of authenticators and signatures
-
J. Feigenbaum, Ed., ser. Lecture Notes in Comput. Sci., Springer-Verlag
-
Y. Desmedt and Y. Frankel, "Shared generation of authenticators and signatures", in Proc. Adv. Cryptol.-CRYPTO'91, J. Feigenbaum, Ed., 1992, vol. 576, pp. 457-469, ser. Lecture Notes in Comput. Sci., Springer-Verlag.
-
(1992)
Proc. Adv. Cryptol.-CRYPTO'91
, vol.576
, pp. 457-469
-
-
Desmedt, Y.1
Frankel, Y.2
-
9
-
-
0032162620
-
Access control and signatures via quorum secret sharing
-
M. Naor and A. Wool, "Access control and signatures via quorum secret sharing", IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 1, pp. 909-922, 1998.
-
(1998)
IEEE Trans. Parallel Distrib. Syst.
, vol.9
, Issue.1
, pp. 909-922
-
-
Naor, M.1
Wool, A.2
-
10
-
-
34547273527
-
Attribute-based encryption for fine-grained access control of encrypted data
-
V. Goyal, O. Pandey, A. Sahai, and B. Waters, "Attribute-based encryption for fine-grained access control of encrypted data", in Proc. 13th ACM Conf. Comput. Commun. Secur., 2006, pp. 89-98.
-
(2006)
Proc. 13th ACM Conf. Comput. Commun. Secur.
, pp. 89-98
-
-
Goyal, V.1
Pandey, O.2
Sahai, A.3
Waters, B.4
-
11
-
-
69649091318
-
Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization cryptol
-
B. Waters, Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization Cryptol. ePrint Archive, Tech. Rep. 2008/290, 2008 [Online]. Available: http://eprint.iacr.org
-
(2008)
EPrint Archive, Tech. Rep. 2008/290
-
-
Waters, B.1
-
12
-
-
85027202957
-
Generalized secret sharing and monotone functions
-
S. Goldwasser, Ed., ser. Lecture Notes in Computer Science, Springer-Verlag
-
J. Benaloh and J. Leichter, "Generalized secret sharing and monotone functions", in Proc. Adv. Cryptol.-CRYPTO'88, S. Goldwasser, Ed., 1990, vol. 403, pp. 27-35, ser. Lecture Notes in Computer Science, Springer-Verlag.
-
(1990)
Proc. Adv. Cryptol.-CRYPTO'88
, vol.403
, pp. 27-35
-
-
Benaloh, J.1
Leichter, J.2
-
14
-
-
84948964778
-
A linear construction of perfect secret sharing schemes
-
A. De Santis, Ed., ser. Lecture Notes in Comput. Sci., Springer-Verlag
-
M. V. Dijk, "A linear construction of perfect secret sharing schemes", in Proc. Adv. Cryptol.-EUROCRYPT'94, A. De Santis, Ed., 1995, vol. 950, pp. 23-34, ser. Lecture Notes in Comput. Sci., Springer-Verlag.
-
(1995)
Proc. Adv. Cryptol.-EUROCRYPT'94
, vol.950
, pp. 23-34
-
-
Dijk, M.V.1
-
16
-
-
0003128147
-
The geometry ofshared secret schemes
-
G. J. Simmons, W. Jackson, and K. M. Martin, "The geometry ofshared secret schemes", Bull. ICA, vol. 1, pp. 71-88, 1991.
-
(1991)
Bull. ICA
, vol.1
, pp. 71-88
-
-
Simmons, G.J.1
Jackson, W.2
Martin, K.M.3
-
17
-
-
84948972864
-
The size of a share must be large
-
A. De Santis, Ed., ser. Lecture Notes in Comput. Sci., Springer-Verlag
-
L. Csirmaz, "The size of a share must be large", in Proc. Adv. Cryptol.-EUROCRYPT'94, A. De Santis, Ed., 1995, vol. 950, pp. 13-22, ser. Lecture Notes in Comput. Sci., Springer-Verlag.
-
(1995)
Proc. Adv. Cryptol.-EUROCRYPT'94
, vol.950
, pp. 13-22
-
-
Csirmaz, L.1
-
18
-
-
0020543282
-
On secret sharing systems
-
E. D. Karnin, J. W. Greene, and M. E. Hellman, "On secret sharing systems", IEEE Trans. Inf. Theory, vol. 29, no. 1, pp. 35-41, 1983.
-
(1983)
IEEE Trans. Inf. Theory
, vol.29
, Issue.1
, pp. 35-41
-
-
Karnin, E.D.1
Greene, J.W.2
Hellman, M.E.3
-
19
-
-
0027607213
-
On the size of shares for secret sharing schemes
-
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, "On the size of shares for secret sharing schemes", J. Cryptol., vol. 6, no. 3, pp. 157-168, 1993.
-
(1993)
J. Cryptol.
, vol.6
, Issue.3
, pp. 157-168
-
-
Capocelli, R.M.1
De Santis, A.2
Gargano, L.3
Vaccaro, U.4
-
20
-
-
0030569864
-
On the information rate of secret sharing schemes
-
C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, "On the information rate of secret sharing schemes", Theoret. Comput. Sci., vol. 154, no. 2, pp. 283-306, 1996.
-
(1996)
Theoret. Comput. Sci.
, vol.154
, Issue.2
, pp. 283-306
-
-
Blundo, C.1
De Santis, A.2
Gargano, L.3
Vaccaro, U.4
-
21
-
-
0001522694
-
On the information rateofperfect secret sharing schemes
-
M. V. Dijk, "On the information rateofperfect secret sharing schemes", Designs, Codes Cryptogr., vol. 6, pp. 143-169, 1995.
-
(1995)
Designs, Codes Cryptogr.
, vol.6
, pp. 143-169
-
-
Dijk, M.V.1
-
22
-
-
0004020725
-
The dealer's random bits in perfect secret sharing schemes
-
L. Csirmaz, "The dealer's random bits in perfect secret sharing schemes", Studia Sci. Math. Hung., vol. 32, no. 3-4, pp. 429-437, 1996.
-
(1996)
Studia Sci. Math. Hung.
, vol.32
, Issue.3-4
, pp. 429-437
-
-
Csirmaz, L.1
-
23
-
-
0040113669
-
Superpolynomial lower bounds for monotone span programs
-
L. Babai, A. Gál, and A. Wigderson, "Superpolynomial lower bounds for monotone span programs", Combinatorica, vol. 19, no. 3, pp. 301-319, 1999.
-
(1999)
Combinatorica
, vol.19
, Issue.3
, pp. 301-319
-
-
Babai, L.1
Gál, A.2
Wigderson, A.3
-
24
-
-
0037699040
-
A characterization of span program size and improved lower bounds for monotone span programs
-
A. Gál, "A characterization of span program size and improved lower bounds for monotone span programs", Computat. Complex., vol. 10, no. 4, pp. 277-296, 2002.
-
(2002)
Computat. Complex.
, vol.10
, Issue.4
, pp. 277-296
-
-
Gál, A.1
-
25
-
-
0032124111
-
On characterization of entropy function via information inequalities
-
Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities", IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1440-1452, 1998.
-
(1998)
IEEE Trans. Inf. Theory
, vol.44
, Issue.4
, pp. 1440-1452
-
-
Zhang, Z.1
Yeung, R.W.2
-
26
-
-
0041415983
-
A new class of non-Shannon type inequalities for entropies
-
K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non-Shannon type inequalities for entropies", Commun. Inf. Syst., vol. 2, no. 2, pp. 147-166, 2002.
-
(2002)
Commun. Inf. Syst.
, vol.2
, Issue.2
, pp. 147-166
-
-
Makarychev, K.1
Makarychev, Y.2
Romashchenko, A.3
Vereshchagin, N.4
-
27
-
-
33144487831
-
On a new non-Shannon type information inequality
-
Z. Zhang, "On a new non-Shannon type information inequality", Commun. Inf. Syst., vol. 3, no. 1, pp. 47-60, 2003.
-
(2003)
Commun. Inf. Syst.
, vol.3
, Issue.1
, pp. 47-60
-
-
Zhang, Z.1
-
28
-
-
33846049315
-
Six new non-Shannon information inequalities
-
R. Dougherty, C. Freiling, and K. Zeger, "Six new non-Shannon information inequalities", in Proc. IEEE Int. Symp. Inf. Theory, 2006, pp. 233-236.
-
(2006)
Proc. IEEE Int. Symp. Inf. Theory
, pp. 233-236
-
-
Dougherty, R.1
Freiling, C.2
Zeger, K.3
-
29
-
-
52349100491
-
A projection method for derivation of non-Shannon-type information inequalities
-
W. Xu, J. Wang, and J. Sun, "A projection method for derivation of non-Shannon-type information inequalities", in Proc. IEEE Int. Symp. Inf. Theory, 2008, pp. 2116-2120.
-
(2008)
Proc. IEEE Int. Symp. Inf. Theory
, pp. 2116-2120
-
-
Xu, W.1
Wang, J.2
Sun, J.3
-
30
-
-
80052366705
-
-
Online. Available:, Online. Available
-
R. Dougherty, C. Freiling, and K. Zeger, Linear Rank Inequalities on Five or More Variables arXiv.org, Tech. Rep., 2009 [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:0910.0284, [Online]. Available
-
(2009)
Linear Rank Inequalities on Five or More Variables ArXiv.org, Tech. Rep.
-
-
Dougherty, R.1
Freiling, C.2
Zeger, K.3
-
31
-
-
51649097192
-
Infinitely many information inequalities
-
F. Matúš, "Infinitely many information inequalities", in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 41-44.
-
(2007)
Proc. IEEE Int. Symp. Inf. Theory
, pp. 41-44
-
-
Matúš, F.1
-
32
-
-
0036648210
-
On a relation between information inequalities and group theory
-
T. H. Chan and R. W. Yeung, "On a relation between information inequalities and group theory", IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1992-1995, 2002.
-
(2002)
IEEE Trans. Inf. Theory
, vol.48
, Issue.7
, pp. 1992-1995
-
-
Chan, T.H.1
Yeung, R.W.2
-
33
-
-
0346707320
-
Balanced information inequalities
-
T. H. Chan, "Balanced information inequalities", IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3261-3267, 2003.
-
(2003)
IEEE Trans. Inf. Theory
, vol.49
, Issue.12
, pp. 3261-3267
-
-
Chan, T.H.1
-
34
-
-
0033872924
-
Inequalities for Shannon entropies and Kolmogorov complexities
-
D. Hammer, A. E. Romashchenko, A. Shen, and N. K. Vereshchagin, "Inequalities for Shannon entropies and Kolmogorov complexities", J. Comput. Syst. Sci., vol. 60, pp. 442-464, 2000.
-
(2000)
J. Comput. Syst. Sci.
, vol.60
, pp. 442-464
-
-
Hammer, D.1
Romashchenko, A.E.2
Shen, A.3
Vereshchagin, N.K.4
-
35
-
-
0041692108
-
Conditions for representability and transversability of matroids
-
Springer-Verlag
-
A. W. Ingleton, "Conditions for representability and transversability of matroids", in Proc. Fr. Br. Conf. 1970, 1971, pp. 62-67, Springer-Verlag.
-
(1971)
Proc. Fr. Br. Conf. 1970
, pp. 62-67
-
-
Ingleton, A.W.1
-
36
-
-
78149410461
-
New inequalities for subspace arrangements
-
R. Kinser, "New inequalities for subspace arrangements", J. Combinator. Theory Ser. A, vol. 118, pp. 152-161, 2011.
-
(2011)
J. Combinator. Theory Ser. A
, vol.118
, pp. 152-161
-
-
Kinser, R.1
-
37
-
-
34249811774
-
Networks, matroids, and non-Shannon information inequalities
-
R. Dougherty, C. Freiling, and K. Zeger, "Networks, matroids, and non-Shannon information inequalities", IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 1949-1969, 2007.
-
(2007)
IEEE Trans. Inf. Theory
, vol.53
, Issue.6
, pp. 1949-1969
-
-
Dougherty, R.1
Freiling, C.2
Zeger, K.3
-
38
-
-
54749110342
-
Dualities between entropy functions and network codes
-
T. H. Chan and A. Grant, "Dualities between entropy functions and network codes", IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4470-4487, 2008.
-
(2008)
IEEE Trans. Inf. Theory
, vol.54
, Issue.10
, pp. 4470-4487
-
-
Chan, T.H.1
Grant, A.2
-
39
-
-
33846088151
-
Two constructions on limits of entropy functions
-
F. Matúš, "Two constructions on limits of entropy functions", IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 320-330, 2007.
-
(2007)
IEEE Trans. Inf. Theory
, vol.53
, Issue.1
, pp. 320-330
-
-
Matúš, F.1
-
40
-
-
80052373545
-
Graph entropy, network coding and guessing games CoRR
-
S. Riis, Graph Entropy, Network Coding and Guessing Games CoRR, Tech. Rep. 0711.4175, 2007 [Online]. Available: http://arxiv.org/abs/0711.4175
-
(2007)
Tech. Rep. 0711.4175
-
-
Riis, S.1
-
41
-
-
40249109897
-
Matroids can be far from ideal secret sharing
-
R. Canetti, Ed., ser. Lecture Notes in Comput. Sci.
-
A. Beimel, N. Livne, and C. Padró, "Matroids can be far from ideal secret sharing", in Proc. 5th Theory of Cryptogr. Conf.-TCC 2008, R. Canetti, Ed., 2008, vol. 4948, pp. 194-212, ser. Lecture Notes in Comput. Sci.
-
(2008)
Proc. 5th Theory of Cryptogr. Conf.-TCC 2008
, vol.4948
, pp. 194-212
-
-
Beimel, A.1
Livne, N.2
Padró, C.3
-
42
-
-
80052352507
-
Improved upper bounds for the information rates of the secret sharing schemes induced by the vamos matroid CoRR
-
J. R. Metcalf-Burton, Improved Upper Bounds for the Information Rates of the Secret Sharing Schemes Induced by the Vamos Matroid CoRR, Tech. Rep. 0809.3010, 2008 [Online]. Available: http://arxiv.org/abs/0809.3010
-
(2008)
Tech. Rep. 0809.3010
-
-
Metcalf-Burton, J.R.1
-
43
-
-
0004061262
-
-
Oxford, U. K.: Oxford Univ. Press
-
J. G. Oxley, Matroid Theory. Oxford, U. K.: Oxford Univ. Press, 1992.
-
(1992)
Matroid Theory
-
-
Oxley, J.G.1
-
44
-
-
38049002374
-
Weakly-private secret sharing schemes
-
S. Vadhan, Ed., ser. Lecture Notes in Comput. Sci., Springer-Verlag
-
A. Beimel and M. Franklin, "Weakly-private secret sharing schemes", in Proc. 4th Theory of Cryptogr. Conf.-TCC 2007, S. Vadhan, Ed., 2007, vol. 4392, pp. 253-272, ser. Lecture Notes in Comput. Sci., Springer-Verlag.
-
(2007)
Proc. 4th Theory of Cryptogr. Conf.-TCC 2007
, vol.4392
, pp. 253-272
-
-
Beimel, A.1
Franklin, M.2
-
45
-
-
84984804645
-
A construction of practical secret sharing schemes using linear block codes
-
J. Seberry and Y. Zheng, Eds., ser. Lecture Notes in Comput. Sci., Springer-Verlag
-
M. Bertilsson and I. Ingemarsson, "A construction of practical secret sharing schemes using linear block codes", in Proc. Adv. Cryptol.-AUSCRYPT'92, J. Seberry and Y. Zheng, Eds., 1993, vol. 718, pp. 67-79, ser. Lecture Notes in Comput. Sci., Springer-Verlag.
-
(1993)
Proc. Adv. Cryptol.-AUSCRYPT'92
, vol.718
, pp. 67-79
-
-
Bertilsson, M.1
Ingemarsson, I.2
-
46
-
-
0029513522
-
Lower bounds for monotone span programs
-
journal version in Computat. Complex.
-
A. Beimel, A. Gál, and M. Paterson, "Lower bounds for monotone span programs", in Proc. 36th IEEE Symp. on Found. Comput. Sci., 1995, pp. 674-681, journal version in Computat. Complex.
-
(1995)
Proc. 36th IEEE Symp. on Found. Comput. Sci.
, pp. 674-681
-
-
Beimel, A.1
Gál, A.2
Paterson, M.3
-
47
-
-
0042468042
-
Monotone complexity and the rank ofmatrices
-
A. Gál and P. Pudlák, "Monotone complexity and the rank ofmatrices", Inf. Process. Lett., vol. 87, pp. 321-326, 2003.
-
(2003)
Inf. Process. Lett.
, vol.87
, pp. 321-326
-
-
Gál, A.1
Pudlák, P.2
-
50
-
-
0042854815
-
On secret sharing schemes
-
C. Blundo, A. De Santis, and U. Vaccaro, "On secret sharing schemes", Inf. Process. Lett., vol. 65, no. 1, pp. 25-32, 1998.
-
(1998)
Inf. Process. Lett.
, vol.65
, Issue.1
, pp. 25-32
-
-
Blundo, C.1
De Santis, A.2
Vaccaro, U.3
-
51
-
-
0027239099
-
Secret sharing over infinite domains
-
B. Chor and E. Kushilevitz, "Secret sharing over infinite domains", J. Cryptol., vol. 6, no. 2, pp. 87-96, 1993.
-
(1993)
J. Cryptol.
, vol.6
, Issue.2
, pp. 87-96
-
-
Chor, B.1
Kushilevitz, E.2
-
52
-
-
0028429265
-
Universally ideal secret sharing schemes
-
A. Beimel and B. Chor, "Universally ideal secret sharing schemes", IEEE Trans. Inf. Theory, vol. 40, no. 3, pp. 786-794, 1994.
-
(1994)
IEEE Trans. Inf. Theory
, vol.40
, Issue.3
, pp. 786-794
-
-
Beimel, A.1
Chor, B.2
-
53
-
-
77950222301
-
Robust computational secret sharing and a unified account of classical secret-sharing goals
-
M. Bellare and P. Rogaway, "Robust computational secret sharing and a unified account of classical secret-sharing goals", in Proc. 14th ACM Conf. Comput. Commun. Secur., 2007, pp. 172-184.
-
(2007)
Proc. 14th ACM Conf. Comput. Commun. Secur.
, pp. 172-184
-
-
Bellare, M.1
Rogaway, P.2
-
54
-
-
0018020371
-
Polymatroidal dependence structure of a set of random variables
-
S. Fujishige, "Polymatroidal dependence structure of a set of random variables", Inf. Contr., vol. 39, no. 1-3, pp. 55-72, 1978.
-
(1978)
Inf. Contr.
, vol.39
, Issue.1-3
, pp. 55-72
-
-
Fujishige, S.1
-
55
-
-
0003745894
-
-
Ph. D. dissertation, Technion, Haifa, Israel, Online. Available
-
A. Beimel, "Secure schemes for secret sharing and key distribution" Ph. D. dissertation, Technion, Haifa, Israel, 1996 [Online]. Available: www.cs.bgu.ac.il/~beimel/pub.html
-
(1996)
Secure Schemes for Secret Sharing and Key Distribution
-
-
Beimel, A.1
|