-
1
-
-
45249098450
-
On oblivious transfer capacity
-
R. Ahlswede and I. Csiszár, "On oblivious transfer capacity," in Proc. ISIT 2007, pp. 2061-2064.
-
Proc. ISIT
, vol.2007
, pp. 2061-2064
-
-
Ahlswede, R.1
Csiszár, I.2
-
2
-
-
84928743703
-
Precomputing oblivious transfer
-
D. Coppersmith Ed. Lecture Notes in Computer Science
-
D. Beaver, "Precomputing oblivious transfer," in Proc. CRYPTO, D. Coppersmith, Ed., 1995, vol. 963, Lecture Notes in Computer Science, pp. 97-109.
-
(1995)
Proc. CRYPTO
, vol.963
, pp. 97-109
-
-
Beaver, D.1
-
3
-
-
0029405656
-
Generalized privacy amplification
-
Nov.
-
C. H. Bennett, G. Brassard, C. Crěpeau, and U. M. Maurer, "Generalized privacy amplification," IEEE Trans. Inf. Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
-
(1995)
IEEE Trans. Inf. Theory
, vol.41
, Issue.6
, pp. 1915-1923
-
-
Bennett, C.H.1
Brassard, G.2
Crěpeau, C.3
Maurer, U.M.4
-
4
-
-
0023985539
-
Privacy amplification by public discussion
-
C. H. Bennett, G. Brassard, and J. Robert, "Privacy amplification by public discussion," SIAM J. Comput., vol. 17, no. 2, pp. 210-229, 1988.
-
(1988)
SIAM J. Comput.
, vol.17
, Issue.2
, pp. 210-229
-
-
Bennett, C.H.1
Brassard, G.2
Robert, J.3
-
5
-
-
0032313750
-
Oblivious transfer with a memory-bounded receiver
-
C. Cachin, C. Crěpeau, and J. Marcil, "Oblivious transfer with a memory-bounded receiver," in Proc. 39th IEEE Annu. Symp. Found. Comput. Sci., 1998, pp. 493-502.
-
(1998)
Proc. 39th IEEE Annu. Symp. Found. Comput. Sci.
, pp. 493-502
-
-
Cachin, C.1
Crěpeau, C.2
Marcil, J.3
-
6
-
-
0018456171
-
Universal classes of hash functions
-
J. L. Carter and M. N.Wegman, "Universal classes of hash functions," J. Comput. Syst. Sci., vol. 18, pp. 143-154, 1979.
-
(1979)
J. Comput. Syst. Sci.
, vol.18
, pp. 143-154
-
-
Carter, J.L.1
Wegman, M.N.2
-
7
-
-
0000182415
-
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
-
H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations," Ann. Math. Statistics, vol. 23, pp. 493-507, 1952.
-
(1952)
Ann. Math. Statistics
, vol.23
, pp. 493-507
-
-
Chernoff, H.1
-
8
-
-
0015565580
-
Enumerative source encoding
-
Jan.
-
T. M. Cover, "Enumerative source encoding," IEEE Trans. Inf. Theory, vol. IT-19, no. 1, pp. 73-77, Jan. 1975.
-
(1975)
IEEE Trans. Inf. Theory
, vol.IT-19
, Issue.1
, pp. 73-77
-
-
Cover, T.M.1
-
9
-
-
85030121757
-
Equivalence between two flavours of oblivious transfers
-
Lecture Notes in Computer Science
-
C. Crěpeau, "Equivalence between two flavours of oblivious transfers," in Proc. CRYPTO '87, vol. 293, Lecture Notes in Computer Science, pp. 350-354.
-
Proc. CRYPTO '87
, vol.293
, pp. 350-354
-
-
Crěpeau, C.1
-
10
-
-
0010074899
-
Efficient cryptographic protocols based on noisy channels
-
C. Crěpeau, "Efficient cryptographic protocols based on noisy channels," in Proc. EUROCRYPT 1997, pp. 306-317.
-
Proc. EUROCRYPT
, vol.1997
, pp. 306-317
-
-
Crěpeau, C.1
-
11
-
-
0024132071
-
Achieving oblivious transfer using weakened security assumptions (extended abstract)
-
C. Crěpeau and J. Kilian, "Achieving oblivious transfer using weakened security assumptions (extended abstract)," in Proc. FOCS 1988, pp. 42-52.
-
Proc. FOCS
, vol.1988
, pp. 42-52
-
-
Crěpeau, C.1
Kilian, J.2
-
12
-
-
84957649042
-
A. tapp. Committed oblivious transfer and private multi-party computation
-
C. Crěpeau and J. van de Graaf, "A. tapp. Committed oblivious transfer and private multi-party computation," in Proc. CRYPTO 1995, pp. 110-123.
-
Proc. CRYPTO
, vol.1995
, pp. 110-123
-
-
Crěpeau, C.1
Van De Graaf, J.2
-
13
-
-
23944515855
-
Efficient unconditional oblivious transfer from almost any noisy channel
-
Security in Communication Networks - 4th International Conference, SCN 2004
-
C. Crěpeau and K. Morozov, "S. wolf. Efficient unconditional oblivious transfer from almost any noisy channel," in Proc. SCN 2004, vol. 3352, Lecture Notes in Computer Science, pp. 47-59. (Pubitemid 41190996)
-
(2005)
Lecture Notes in Computer Science
, vol.3352
, pp. 47-59
-
-
Crepeau, C.1
Morozov, K.2
Wolf, S.3
-
14
-
-
33746042169
-
Optimal reductions between oblivious transfers using Interactive Hashing
-
Advances in Cryptology - EUROCRYPT 2006 - 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
-
C. Crěpeau and G. Savvides, "Optimal reductions between oblivious transfers using interactive hashing," in Proc. EUROCRYPT 2006, vol. 4004, Lecture Notes in Computer Science, pp. 201-221. (Pubitemid 44072241)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4004
, pp. 201-221
-
-
Crepeau, C.1
Savvides, G.2
-
15
-
-
54249132643
-
Statistical security conditions for two-party secure function evaluation
-
Lecture Notes in Computer Science
-
C. Crěpeau and J. Wullschleger, "Statistical security conditions for two-party secure function evaluation," in Proc. ICITS 2008, vol. 5155, Lecture Notes in Computer Science, pp. 86-99.
-
(2008)
Proc. ICITS
, vol.5155
, pp. 86-99
-
-
Crěpeau, C.1
Wullschleger, J.2
-
17
-
-
33947520247
-
Constant-round oblivious transfer in the bounded storage model
-
DOI 10.1007/s00145-006-0438-1
-
Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel, "Constant-round oblivious transfer in the bounded storage model," J. Cryptology, vol. 20, pp. 165-202, 2007. (Pubitemid 46473854)
-
(2007)
Journal of Cryptology
, vol.20
, Issue.2
, pp. 165-202
-
-
Ding, Y.Z.1
Harnik, D.2
Rosen, A.3
Shaltiel, R.4
-
18
-
-
52149117439
-
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
-
Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM J. Comput., vol. 38, no. 1, pp. 97-139, 2008.
-
(2008)
SIAM J. Comput.
, vol.38
, Issue.1
, pp. 97-139
-
-
Dodis, Y.1
Ostrovsky, R.2
Reyzin, L.3
Smith, A.4
-
19
-
-
0002337124
-
How to play any mental game, or: A completeness theorem for protocols with honest majority
-
O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game, or: A completeness theorem for protocols with honest majority," in Proc. 19th ACM STOC, 1997, pp. 20-31.
-
(1997)
Proc. 19th ACM STOC
, pp. 20-31
-
-
Goldreich, O.1
Micali, S.2
Wigderson, A.3
-
20
-
-
0345253860
-
A pseudorandom generator from any one-way function
-
J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, "A pseudorandom generator from any one-way function," SIAM J. Comput., vol. 28, no. 4, pp. 1364-1396, 1999.
-
(1999)
SIAM J. Comput.
, vol.28
, Issue.4
, pp. 1364-1396
-
-
Hastad, J.1
Impagliazzo, R.2
Levin, L.A.3
Luby, M.4
-
23
-
-
0024866111
-
Pseudo-random generation from one-way functions (extended abstracts)
-
R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way functions (extended abstracts)," in Proc. STOC 1989, pp. 12-24.
-
Proc. STOC
, vol.1989
, pp. 12-24
-
-
Impagliazzo, R.1
Levin, L.A.2
Luby, M.3
-
24
-
-
84898989941
-
Founding cryptography on oblivious transfer
-
J. Kilian, "Founding cryptography on oblivious transfer," in Proc. STOC 1988, pp. 20-31.
-
Proc. STOC
, vol.1988
, pp. 20-31
-
-
Kilian, J.1
-
25
-
-
84955566100
-
Generalized oblivious transfer protocols based on noisy channels
-
Information Assurance in Computer Networks Methods, Models and Architectures for Network Security
-
V. Korjik and K. Morozov, "Generalized oblivious transfer protocols based on noisy channels," in Proc. MMM ACNS 2001, vol. 2052, Lecture Notes in Computer Science, pp. 219-229. (Pubitemid 33275979)
-
(2001)
Lecture Notes in Computer Science
, Issue.2052
, pp. 219-229
-
-
Korjik, V.1
Morozov, K.2
-
26
-
-
45249089615
-
On the oblivious-transfer capacity of noisy resources
-
Jun.
-
A. C. A. Nascimento and A. Winter, "On the oblivious-transfer capacity of noisy resources," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2572-2581, Jun. 2008.
-
(2008)
IEEE Trans. Inf. Theory
, vol.54
, Issue.6
, pp. 2572-2581
-
-
Nascimento, A.C.A.1
Winter, A.2
-
27
-
-
0030086632
-
Randomness is linear in space
-
N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comput. Syst. Sci., vol. 52, no. 1, pp. 43-53, 1996.
-
(1996)
J. Comput. Syst. Sci.
, vol.52
, Issue.1
, pp. 43-53
-
-
Nisan, N.1
Zuckerman, D.2
-
28
-
-
1542660671
-
Fair games against an all-powerful adversary
-
Providence, RI: Amer. Math. Soc.
-
R. Ostrovsky, R. Venkatesan, and M. Yung, "Fair games against an all-powerful adversary," in AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: Amer. Math. Soc., 1993, pp. 155-169.
-
(1993)
AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, pp. 155-169
-
-
Ostrovsky, R.1
Venkatesan, R.2
Yung, M.3
-
29
-
-
0003462641
-
How to exchange secrets by oblivious transfer
-
Harvard Univ., Tech. Rep. TR-81
-
M. O. Rabin, "How to exchange secrets by oblivious transfer," Aiken Computation Laboratory, Harvard Univ., Tech. Rep. TR-81, 1981, .
-
(1981)
Aiken Computation Laboratory
-
-
Rabin, M.O.1
-
30
-
-
0002956996
-
Bounds for dispersers, extractors, and depthtwo superconcentrators
-
J. Radhakrishnan and A. Ta-Shma, "Bounds for dispersers, extractors, and depthtwo superconcentrators," SIAM J. Discrete Math., vol. 13, no. 1, pp. 2-24, 2000.
-
(2000)
SIAM J. Discrete Math.
, vol.13
, Issue.1
, pp. 2-24
-
-
Radhakrishnan, J.1
Ta-Shma, A.2
-
31
-
-
54249170631
-
Interactive hashing and reductions between oblivious transfer variants Ph.D. dissertation
-
McGill Univ., Montreal, QC, Canada
-
G. Savvides, "Interactive hashing and reductions between oblivious transfer variants," Ph.D. dissertation, School of Computer Science, McGill Univ., Montreal, QC, Canada, 2007.
-
(2007)
School of Computer Science
-
-
Savvides, G.1
-
33
-
-
0001998264
-
Conjugate coding
-
S. Wiesner, "Conjugate coding," ACM SIGACT News, vol. 15, no. 1, pp. 78-88, 1983.
-
(1983)
ACM SIGACT News
, vol.15
, Issue.1
, pp. 78-88
-
-
Wiesner, S.1
-
34
-
-
0016562514
-
The wire-tap channel
-
A. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, pp. 1355-1387, 1975.
-
(1975)
Bell Syst. Tech. J.
, vol.54
, pp. 1355-1387
-
-
Wyner, A.1
|