메뉴 건너뛰기




Volumn 3, Issue , 2009, Pages 34-41

Adapting privacy-preserving computation to the service provider model

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS MODELS; DISTRIBUTED ALGORITHM; DISTRIBUTED ALGORITHMIC MECHANISM DESIGN; IMPLEMENT MECHANISMS; PERFORMANCE IMPROVEMENTS; PRIVACY PRESERVING; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; SERVICE PROVIDER; SYSTEM ARCHITECTURES;

EID: 70849105124     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.261     Document Type: Conference Paper
Times cited : (14)

References (25)
  • 6
    • 85056898575 scopus 로고    scopus 로고
    • Scalable and Unconditionally Secure Multiparty Computation
    • I. Damgard, and J. Nielsen. Scalable and Unconditionally Secure Multiparty Computation. Proceedings of Crypto, 2007.
    • (2007) Proceedings of Crypto
    • Damgard, I.1    Nielsen, J.2
  • 11
    • 65949114950 scopus 로고    scopus 로고
    • Distributed algorithmic mechanism design: Recent results and future directions.
    • J. Feigenbaum, and S. Shenker. Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. Bulletin of the EATCS 79, 2003.
    • (2003) Bulletin of the EATCS , vol.79
    • Feigenbaum, J.1    Shenker., S.2
  • 16
    • 70849113029 scopus 로고    scopus 로고
    • Robust multiparty computation with linear communication complexity
    • M. Hirt, and J. Nielsen. Robust Multiparty Computation with Linear Communication Complexity. Proceedings of Crypto, 2006.
    • (2006) Proceedings of Crypto
    • Hirt, M.1    Nielsen, J.2
  • 19
    • 47949114798 scopus 로고    scopus 로고
    • Building a privacy-preserving benchmarking enterprise system
    • F. Kerschbaum. Building a Privacy-Preserving Benchmarking Enterprise System. Proceedings of EDOC Conference, 2007.
    • (2007) Proceedings of EDOC Conference
    • Kerschbaum, F.1
  • 22
    • 84919085619 scopus 로고
    • An improved algorithm for computing logarithms over gf(p) and its cryptographic significance
    • S. Pohlig, and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory 24, 1978.
    • (1978) IEEE Transactions on Information Theory , vol.24
    • Pohlig, S.1    Hellman, M.2
  • 24
    • 25444462746 scopus 로고    scopus 로고
    • Non-cooperative computation: Boolean functions with, correctness, and exclusivity
    • Y. Shoham, and M. Tennenholtz. Non-Cooperative Computation: boolean functions with correctness and exclusivity. Theoretical Computer Science 343(1-2), 2005.
    • (2005) Theoretical Computer Science , vol.343 , Issue.1-2
    • Shoham, Y.1    Tennenholtz, M.2


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