메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1157-1161

Distributed computing with privacy

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL ENTROPY; CORRELATED DATA; INTERACTIVE COMMUNICATIONS; MULTITERMINAL SOURCE CODING; PUBLIC COMMUNICATIONS;

EID: 84867546625     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283035     Document Type: Conference Paper
Times cited : (3)

References (10)
  • 1
    • 0027629488 scopus 로고
    • Common randomness in information theory and cryptography-part i: Secret sharing
    • R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-part i: Secret sharing," IEEE Trans. Inform. Theory, vol. 39, pp. 1121-1132, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1121-1132
    • Ahlswede, R.1    Csiszár, I.2
  • 2
    • 0029706655 scopus 로고    scopus 로고
    • Almost independence and secrecy capacity
    • I. Csiszár, "Almost independence and secrecy capacity," Prob. Pered. Inform., vol. 32, no. 1, pp. 48-57, 1996.
    • (1996) Prob. Pered. Inform. , vol.32 , Issue.1 , pp. 48-57
    • Csiszár, I.1
  • 4
    • 10644270917 scopus 로고    scopus 로고
    • Secrecy capacities for multiple terminals
    • I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.12 , pp. 3047-3061
    • Csiszár, I.1    Narayan, P.2
  • 5
    • 45249104852 scopus 로고    scopus 로고
    • Secrecy capacities for multiterminal channel models
    • I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2437-2452, 2008.
    • (2008) IEEE Trans. Inform. Theory , vol.54 , Issue.6 , pp. 2437-2452
    • Csiszár, I.1    Narayan, P.2
  • 6
    • 77957602848 scopus 로고    scopus 로고
    • Information inequalities for joint distributions, with interpretations and applications
    • M. Madiman and P. Tetali, "Information inequalities for joint distributions, with interpretations and applications," IEEE Trans. Inform. Theory, vol. 56, pp. 2699-2713, 2010.
    • (2010) IEEE Trans. Inform. Theory , vol.56 , pp. 2699-2713
    • Madiman, M.1    Tetali, P.2
  • 7
    • 0027599802 scopus 로고
    • Secret key agreement by public discussion from common information
    • May
    • U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inform. Theory, vol. 39, pp. 733-742, May 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 733-742
    • Maurer, U.M.1
  • 10
    • 80053961199 scopus 로고    scopus 로고
    • When is a function securely computable?
    • Oct
    • H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable?" IEEE Trans. Inform. Theory, vol. 57, no. 10, pp. 6337-6350, Oct 2011.
    • (2011) IEEE Trans. Inform. Theory , vol.57 , Issue.10 , pp. 6337-6350
    • Tyagi, H.1    Narayan, P.2    Gupta, P.3


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