메뉴 건너뛰기




Volumn 167, Issue 1, 2001, Pages 2-9

On privacy and partition arguments

Author keywords

Partition arguments; Private distributed computation

Indexed keywords

BOOLEAN FUNCTIONS; INFORMATION ANALYSIS; NETWORK PROTOCOLS; SET THEORY;

EID: 0035947794     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.3013     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 2
    • 84898960610 scopus 로고
    • Completeness theorems for non-cryptographic fault-tolerant distributed computation
    • Ben-or, M., Goldwasser, S., and Wigderson, A. (1988), Completeness theorems for non-cryptographic fault-tolerant distributed computation, in "Proc. of 20th STOC," pp. 1-10.
    • (1988) Proc. of 20th STOC , pp. 1-10
    • Ben-Or, M.1    Goldwasser, S.2    Wigderson, A.3
  • 4
    • 84898947315 scopus 로고
    • Multiparty unconditionally secure protocols
    • Chaum, D., Crépeau, C., and Damgård, I. (1988), Multiparty unconditionally secure protocols, in "Proc. of 20th STOC": pp. 11-19.
    • (1988) Proc. of 20th STOC , pp. 11-19
    • Chaum, D.1    Crépeau, C.2    Damgård, I.3
  • 5
    • 0028675686 scopus 로고
    • On the structure of the privacy hierarchy
    • Chor, B., Gereb-Graus, M., and Kushilevitz, E. (1994), On the structure of the privacy hierarchy, J. Cryptol. 7, 53-60.
    • (1994) J. Cryptol. , vol.7 , pp. 53-60
    • Chor, B.1    Gereb-Graus, M.2    Kushilevitz, E.3
  • 6
    • 0002738457 scopus 로고
    • A zero-one law for Boolean privacy
    • [Early version appears in "Proc. of 21th STOC," 1989, pp. 62-72]
    • Chor, B., and Kushilevitz, E. (1991), A zero-one law for Boolean privacy, SIAM J. Discrete math. 4(1), 36-47. [Early version appears in "Proc. of 21th STOC," 1989, pp. 62-72]
    • (1991) SIAM J. Discrete Math. , vol.4 , Issue.1 , pp. 36-47
    • Chor, B.1    Kushilevitz, E.2
  • 7
    • 0013362413 scopus 로고
    • The privacy of dense symmetric functions
    • Chor, B., and Shani, N. (1995), The privacy of dense symmetric functions, Comput. Complex. 5, 43-59.
    • (1995) Comput. Complex , vol.5 , pp. 43-59
    • Chor, B.1    Shani, N.2
  • 8
    • 0023545076 scopus 로고
    • How to play any mental game (extended abstract)
    • Goldreich, O., Micali, S., and Wigderson, A. (1987), How to play any mental game (extended abstract), in "Proc. of 19th STOC," pp. 218-229.
    • (1987) Proc. of 19th STOC , pp. 218-229
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 10
    • 0002365530 scopus 로고
    • Privacy and communication complexity
    • [Early version appears in "Proc. of 30th FOCS," pp. 416-421]
    • Kushilevitz, E. (1992), Privacy and communication complexity, SIAM J. Discrete Math. 5(2), 273-284. [Early version appears in "Proc. of 30th FOCS," pp. 416-421]
    • (1992) SIAM J. Discrete Math. , vol.5 , Issue.2 , pp. 273-284
    • Kushilevitz, E.1
  • 11
    • 0020312165 scopus 로고
    • Protocols for secure computations (extended abstract)
    • Yao, A.C. 1982, Protocols for secure computations (extended abstract), in "Proc. of 23rd FOCS," pp. 160-164.
    • (1982) Proc. of 23rd FOCS , pp. 160-164
    • Yao, A.C.1


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