메뉴 건너뛰기




Volumn 54, Issue 6, 2008, Pages 2572-2581

On the oblivious-transfer capacity of noisy resources

Author keywords

Information theoretical security; Noisy resources; Oblivious transfer (OT) protocols

Indexed keywords

OBLIVIOUS TRANSFER (OT); TRANSFER CAPACITIES;

EID: 45249089615     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.921856     Document Type: Article
Times cited : (58)

References (37)
  • 1
    • 0027629488 scopus 로고
    • Common randomness in information theory and cryptography - part I: Secret sharing
    • Jul
    • R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography - part I: Secret sharing," IEEE Trans. Inf. Theory vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.4 , pp. 1121-1132
    • Ahlswede, R.1    Csiszár, I.2
  • 3
    • 0036495139 scopus 로고    scopus 로고
    • Strong converse for identification via quantum channels
    • May
    • R. Ahlswede and A. Winter, "Strong converse for identification via quantum channels," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 569-579, May 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.3 , pp. 569-579
    • Ahlswede, R.1    Winter, A.2
  • 4
    • 84928743703 scopus 로고
    • Precomputing oblivious transfer
    • Berlin, Germany: Springer-Verlag
    • D. Beaver, "Precomputing oblivious transfer," in Lecture Notes in Computer Science, ser. 963. Berlin, Germany: Springer-Verlag, 1995,pp. 97-109.
    • (1995) Lecture Notes in Computer Science , vol.963 , pp. 97-109
    • Beaver, D.1
  • 6
    • 21144437147 scopus 로고    scopus 로고
    • Oblivious transfers and privacy amplification
    • G. Brassard, C. Crépeau, and S. Wolf, "Oblivious transfers and privacy amplification," J. Cryptol., vol. 16, no. 4, 2003.
    • (2003) J. Cryptol , vol.16 , Issue.4
    • Brassard, G.1    Crépeau, C.2    Wolf, S.3
  • 8
    • 84957712978 scopus 로고    scopus 로고
    • On the foundations of oblivious transfer
    • Berlin, Germany: Springer-Verlag
    • C. Cachin, "On the foundations of oblivious transfer," in Lecture Notes in Computer Science, ser. 1403. Berlin, Germany: Springer-Verlag, 1998, pp. 361-374.
    • (1998) Lecture Notes in Computer Science , vol.1403 , pp. 361-374
    • Cachin, C.1
  • 9
    • 0018456171 scopus 로고
    • 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
  • 10
    • 14844342689 scopus 로고    scopus 로고
    • Quantum privacy and quantum wiretap channels
    • N. Cai and R. W. Yeung, "Quantum privacy and quantum wiretap channels," Probl. Inf. Transm., vol. 40, no. 4, pp. 318-336, 2004.
    • (2004) Probl. Inf. Transm , vol.40 , Issue.4 , pp. 318-336
    • Cai, N.1    Yeung, R.W.2
  • 12
    • 84957649042 scopus 로고
    • Committed oblivious transfer and private multi-party computations
    • C. Crépeau, J. van de Graaf, and A. Tapp, "Committed oblivious transfer and private multi-party computations," Proc. CRYPTO, pp. 110-123, 1995.
    • (1995) Proc. CRYPTO , pp. 110-123
    • Crépeau, C.1    van de Graaf, J.2    Tapp, A.3
  • 13
    • 84957356475 scopus 로고    scopus 로고
    • Efficient cryptographic protocols based on noisy channels
    • Berlin, Germany: Springer-Verlag
    • C. Crépeau, "Efficient cryptographic protocols based on noisy channels," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1997, pp. 306-317.
    • (1997) Lecture Notes in Computer Science , pp. 306-317
    • Crépeau, C.1
  • 14
    • 0024132071 scopus 로고
    • Achieving oblivious transfer using weakened security assumptions
    • C. Crépeau and J. Kilian, "Achieving oblivious transfer using weakened security assumptions," in Proc. 29th FOCS, 1988, pp. 42-52.
    • (1988) Proc. 29th FOCS , pp. 42-52
    • Crépeau, C.1    Kilian, J.2
  • 15
    • 85030121757 scopus 로고
    • Equivalence between two flavours of oblivious transfers
    • Berlin, Germany: Springer-Verlag
    • C. Crépeau, "Equivalence between two flavours of oblivious transfers," in Lecture Notes in Computer Science, ser. 293. Berlin, Germany: Springer-Verlag, 1988, pp. 350-354.
    • (1988) Lecture Notes in Computer Science , vol.293 , pp. 350-354
    • Crépeau, C.1
  • 16
    • 23944515855 scopus 로고    scopus 로고
    • Efficient unconditional oblivious transfer from almost any noisy channel
    • C. Crépeau, K. Morozov, and S. Wolf, "Efficient unconditional oblivious transfer from almost any noisy channel," SCN, pp. 47-59, 2004.
    • (2004) SCN , pp. 47-59
    • Crépeau, C.1    Morozov, K.2    Wolf, S.3
  • 18
    • 84957697395 scopus 로고    scopus 로고
    • On the (im possibility of basing oblivious transfer and bit commitment on weakened security assumptions
    • Berlin, Germany: Springer-Verlag
    • I. B. Daingård, J. Kilian, and L. Salvail, "On the (im possibility of basing oblivious transfer and bit commitment on weakened security assumptions," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1999, pp. 56-73.
    • (1999) Lecture Notes in Computer Science , pp. 56-73
    • Daingård, I.B.1    Kilian, J.2    Salvail, L.3
  • 19
    • 0022080529 scopus 로고
    • A randomized protocol for signing contracts
    • S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts," Commun. ACM, vol. 28, no. 6, pp. 637-647, 1985.
    • (1985) Commun. ACM , vol.28 , Issue.6 , pp. 637-647
    • Even, S.1    Goldreich, O.2    Lempel, A.3
  • 21
    • 38049157842 scopus 로고    scopus 로고
    • Strengthening key agreement using hard-core sets,
    • Ph.D. dissertation, Dept. Comp. Sci, Swiss Federal Institute of Technology ETH, Zurich, Switzerland
    • T. Holenstein, "Strengthening key agreement using hard-core sets," Ph.D. dissertation, Dept. Comp. Sci., Swiss Federal Institute of Technology (ETH), Zurich, Switzerland.
    • Holenstein, T.1
  • 23
    • 0033706604 scopus 로고    scopus 로고
    • More general completeness theorems for secure two-party computation
    • Portland, OR, May
    • J. Kilian, "More general completeness theorems for secure two-party computation," in Proc. 32nd Annu. ACM Symp. Theory of Computing (STOC), Portland, OR, May 2000, pp. 316-324.
    • (2000) Proc. 32nd Annu. ACM Symp. Theory of Computing (STOC) , pp. 316-324
    • Kilian, J.1
  • 24
    • 78149248764 scopus 로고
    • Protocols for secret key agreement by public discussion based on common information
    • Berlin, Germany: Springer-Verlag
    • U. Maurer, "Protocols for secret key agreement by public discussion based on common information," in Lecture Notes in Computer Science Berlin, Germany: Springer-Verlag, 1993, pp. 461-470.
    • (1993) Lecture Notes in Computer Science , pp. 461-470
    • Maurer, U.1
  • 25
    • 33645389777 scopus 로고    scopus 로고
    • Oblivious transfer from any genuine noise
    • preprint
    • A. Nascimento and A. Winter, "Oblivious transfer from any genuine noise," preprint.
    • Nascimento, A.1    Winter, A.2
  • 26
    • 0021595510 scopus 로고
    • Wire-tap channel II
    • Dec
    • L. H. Ozarow and A. D. Wyner, "Wire-tap channel II" Bell Syst. Tech. J., vol. 63, no. 10, pp. 2135-2157, Dec. 1984.
    • (1984) Bell Syst. Tech. J , vol.63 , Issue.10 , pp. 2135-2157
    • Ozarow, L.H.1    Wyner, A.D.2
  • 28
    • 33646767482 scopus 로고    scopus 로고
    • Simple and tight bounds for information reconciliation and privacy amplification
    • Berlin, Germany: Springer-Verlag
    • R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification," in Lecture Notes in Computer Science, ser. 3788. Berlin, Germany: Springer-Verlag, 2005, pp. 199-216.
    • (2005) Lecture Notes in Computer Science , vol.3788 , pp. 199-216
    • Renner, R.1    Wolf, S.2
  • 31
    • 0023985539 scopus 로고
    • Privacy amplification by public discussion
    • Apr
    • C. H. Bennett, G. Brassard, and J. Robert, "Privacy amplification by public discussion," SIAM J. Comput., vol. 17, no. 2, pp. 210-229, Apr. 1988.
    • (1988) SIAM J. Comput , vol.17 , Issue.2 , pp. 210-229
    • Bennett, C.H.1    Brassard, G.2    Robert, J.3
  • 32
    • 0036353675 scopus 로고    scopus 로고
    • Efficient oblivious transfer from any nontrivial binary-symmetric channel
    • Lausanne, Switzerland, Jun./Jul
    • D. Stebila and S. Wolf, "Efficient oblivious transfer from any nontrivial binary-symmetric channel," in Proc. IEEE Int. Symp. Information Theory (ISIT), Lausanne, Switzerland, Jun./Jul. 2002, p. 293.
    • (2002) Proc. IEEE Int. Symp. Information Theory (ISIT) , pp. 293
    • Stebila, D.1    Wolf, S.2
  • 33
    • 0001998264 scopus 로고
    • Conjugate coding
    • S. Wiesner, "Conjugate coding," SigactNews, vol. 15, no. 1, pp. 78-88, 1983.
    • (1983) SigactNews , vol.15 , Issue.1 , pp. 78-88
    • Wiesner, S.1
  • 34
    • 23944463739 scopus 로고    scopus 로고
    • Commitment capacity of discrete memoryless channels
    • Berlin, Germany: Springer-Verlag
    • A. Winter, A. C. A. Nascimento, and H. Imai, "Commitment capacity of discrete memoryless channels," in Lecture Notes in Computer Science ser. 2898. Berlin, Germany: Springer-Verlag, 2003, pp. 35-51.
    • (2003) Lecture Notes in Computer Science , vol.2898 , pp. 35-51
    • Winter, A.1    Nascimento, A.C.A.2    Imai, H.3
  • 36
    • 38049160265 scopus 로고    scopus 로고
    • Oblivious-transfer amplification
    • Berlin, Germany: Springer-Verlag
    • J. Wullschleger, "Oblivious-transfer amplification," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2007.
    • (2007) Lecture Notes in Computer Science
    • Wullschleger, J.1
  • 37
    • 0016562514 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.