-
2
-
-
0026834814
-
Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs
-
N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth. Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38 (192):509-516, 1992.
-
(1992)
IEEE Transactions on Information Theory
, vol.38
, Issue.192
, pp. 509-516
-
-
Alon, N.1
Bruck, J.2
Naor, J.3
Naor, M.4
Roth, R.5
-
3
-
-
4444329922
-
The difference between consecutive primes ii
-
3
-
R. Baker, G. Harman, and J. Pintz. The difference between consecutive primes ii. London Math. Soc, (3) 83:532-562, 2001.
-
(2001)
London Math. Soc
, vol.83
, pp. 532-562
-
-
Baker, R.1
Harman, G.2
Pintz, J.3
-
4
-
-
84979291225
-
Broadcast encryption
-
A. Fiat and M. Naor. Broadcast encryption. In Crypto, pages 480-491, 1993.
-
(1993)
Crypto
, pp. 480-491
-
-
Fiat, A.1
Naor, M.2
-
5
-
-
84957067564
-
Efficient methods for integrating traceability and broadcast encryption
-
E. Gafni, J. Staddon, and Y. Yin. Efficient methods for integrating traceability and broadcast encryption. In Crypto, pages 372-387, 1999.
-
(1999)
Crypto
, pp. 372-387
-
-
Gafni, E.1
Staddon, J.2
Yin, Y.3
-
6
-
-
84937435227
-
The lsd broadcast encryption scheme
-
D. Halevy and A. Shamir. The lsd broadcast encryption scheme. In Crypto, pages 47-60, 2002.
-
(2002)
Crypto
, pp. 47-60
-
-
Halevy, D.1
Shamir, A.2
-
9
-
-
84957057937
-
Coding constructions for blacklisting problems without computational assumptions
-
R. Kumar, S. Rajagopalan, and A. Sahai. Coding constructions for blacklisting problems without computational assumptions. In Crypto, pages 609-623, 1999.
-
(1999)
Crypto
, pp. 609-623
-
-
Kumar, R.1
Rajagopalan, S.2
Sahai, A.3
-
10
-
-
0038077520
-
A note on the set systems used for broadcast encryption
-
R. Kumar and A. Russell. A note on the set systems used for broadcast encryption. In SODA, pages 470-471, 2003.
-
(2003)
SODA
, pp. 470-471
-
-
Kumar, R.1
Russell, A.2
-
11
-
-
0037761940
-
Revocation and tracing schemes for stateless receivers
-
J. Lotspiech, D. Naor, and N. Naor. Revocation and tracing schemes for stateless receivers. In Crypto, pages 41-62, 2000.
-
(2000)
Crypto
, pp. 41-62
-
-
Lotspiech, J.1
Naor, D.2
Naor, N.3
-
12
-
-
0000848816
-
Explicit expanders and the ramanujan conjectures
-
A. Lubotzky, R. Phillips, and P. Sarnak. Explicit expanders and the ramanujan conjectures. Combinatorica, 8:261-277, 1988.
-
(1988)
Combinatorica
, vol.8
, pp. 261-277
-
-
Lubotzky, A.1
Phillips, R.2
Sarnak, P.3
-
13
-
-
0038311649
-
Combinatorial bounds for broadcast encryption
-
M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In Eurocrypt, 1998.
-
(1998)
Eurocrypt
-
-
Luby, M.1
Staddon, J.2
-
14
-
-
0000137420
-
Secure fremeproof codes, key distribution patters, group testing algorithms and related structures
-
D. Stinson, T. Trung, and R. Wei. Secure fremeproof codes, key distribution patters, group testing algorithms and related structures. Journal of Statistical Planning and Inference, 86:595-617, 2000.
-
(2000)
Journal of Statistical Planning and Inference
, vol.86
, pp. 595-617
-
-
Stinson, D.1
Trung, T.2
Wei, R.3
-
15
-
-
15844399700
-
Absolute o(log m) error in approximating random set covering: An average case analysis
-
O. Telelis and V. Zissimopoulos. Absolute o(log m) error in approximating random set covering: an average case analysis. Information Processing Letters, 94:4:171-177, 2005.
-
(2005)
Information Processing Letters
, vol.94
, Issue.4
, pp. 171-177
-
-
Telelis, O.1
Zissimopoulos, V.2
|