메뉴 건너뛰기




Volumn 16, Issue 2, 2007, Pages 217-222

Multivariate oblivious polynomial evaluation protocol

Author keywords

Oblivious polynomial evaluation; Privacy preserving; Secure multi party computation

Indexed keywords

COMPUTATION THEORY; DATA PRIVACY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

EID: 34247481441     PISSN: 10224653     EISSN: 20755597     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (1)

References (21)
  • 2
    • 0242697123 scopus 로고    scopus 로고
    • A study of several specific secure two-party computation problems
    • Ph.D. Thesis, Purdue University, West Lafayette, Indiana, USA
    • W. Du, "A study of several specific secure two-party computation problems", Ph.D. Thesis, Purdue University, West Lafayette, Indiana, USA, 2001.
    • (2001)
    • Du, W.1
  • 5
    • 4544312695 scopus 로고    scopus 로고
    • Cryptographic techniques for privacy-preserving data mining
    • B. Pinkas, "Cryptographic techniques for privacy-preserving data mining", ACM SIGKDD Explorations Newsletter, Vol.4, No.2, pp.12-19, 2002.
    • (2002) ACM SIGKDD Explorations Newsletter , vol.4 , Issue.2 , pp. 12-19
    • Pinkas, B.1
  • 7
    • 24144488603 scopus 로고    scopus 로고
    • Keyword search and oblivious pseudorandom functions
    • Proc. of the 2nd Theory of Cryptography Conference TCC'05, Springer-Verlag, Cambridge, MA, pp
    • M. Freedman, Y. Ishai, B. Pinkas and O. Reingold, "Keyword search and oblivious pseudorandom functions", Proc. of the 2nd Theory of Cryptography Conference (TCC'05), LNCS 3378, Springer-Verlag, Cambridge, MA, pp.303-324, 2005.
    • (2005) LNCS , vol.3378 , pp. 303-324
    • Freedman, M.1    Ishai, Y.2    Pinkas, B.3    Reingold, O.4
  • 8
    • 33645606050 scopus 로고    scopus 로고
    • Privacy-preserving data mining over vertically partitioned data
    • Ph.D. Thesis, Purdue University, West Lafayette, Indiana, USA
    • J. Vaidya, "Privacy-preserving data mining over vertically partitioned data", Ph.D. Thesis, Purdue University, West Lafayette, Indiana, USA, 2004.
    • (2004)
    • Vaidya, J.1
  • 9
    • 84974555530 scopus 로고    scopus 로고
    • Privacy 'preserving data mining
    • Proc. of Advances in Cryptology-CRYPTO 2000, Springer-Verlag, Santa Barbara, California, USA, pp
    • Y. Lindell and B. Pinkas, "Privacy 'preserving data mining", Proc. of Advances in Cryptology-CRYPTO 2000, LNCS 1880, Springer-Verlag, Santa Barbara, California, USA, pp.36-54, 2000.
    • (2000) LNCS , vol.1880 , pp. 36-54
    • Lindell, Y.1    Pinkas, B.2
  • 10
    • 24944523186 scopus 로고    scopus 로고
    • On secure scalar product computation for privacy-preserving data mining
    • Proc. of the 7th Annual International Conf. in Information Security and Cryptology ICISC'04, Springer-Verlag, Seoul, Korea, pp
    • B. Goethals, S. Laur, H. Lipmaa and T. Mielikainen, "On secure scalar product computation for privacy-preserving data mining" , Proc. of the 7th Annual International Conf. in Information Security and Cryptology (ICISC'04), LNCS 3506, Springer-Verlag, Seoul, Korea, pp.104-120, 2004.
    • (2004) LNCS , vol.3506 , pp. 104-120
    • Goethals, B.1    Laur, S.2    Lipmaa, H.3    Mielikainen, T.4
  • 11
    • 84956852274 scopus 로고    scopus 로고
    • A new public-key cryptosystem as secure as factoring
    • Proc. of Advances in Cryptology-EUROCRYPT'98, Springer-Verlag, Espoo, Finland, pp
    • T. Okamoto and S. Uchiyama, "A new public-key cryptosystem as secure as factoring", Proc. of Advances in Cryptology-EUROCRYPT'98, LNCS 1403, Springer-Verlag, Espoo, Finland, pp.308-318, 1998.
    • (1998) LNCS , vol.1403 , pp. 308-318
    • Okamoto, T.1    Uchiyama, S.2
  • 12
    • 84942550998 scopus 로고    scopus 로고
    • Public-key cryptosystems based on composite degree residuosity classes
    • Proc. of Advances in Cryptology-EUROCRYPT'99, Springer-Verlag, Prague, Czech Republic, pp
    • P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes", Proc. of Advances in Cryptology-EUROCRYPT'99, LNCS 1592, Springer-Verlag, Prague, Czech Republic, pp.223-238, 1999.
    • (1999) LNCS , vol.1592 , pp. 223-238
    • Paillier, P.1
  • 14
    • 23844556499 scopus 로고    scopus 로고
    • Oblivious polynomial evaluation and oblivious neural learning
    • Y. Chang and C. Lu, "Oblivious polynomial evaluation and oblivious neural learning", Theoretical Computer Science, Vol.341, No.1-3, pp.39-54, 2005.
    • (2005) Theoretical Computer Science , vol.341 , Issue.1-3 , pp. 39-54
    • Chang, Y.1    Lu, C.2
  • 18
    • 33646505576 scopus 로고    scopus 로고
    • Privacy-preserving distance measurement and its applications
    • Y. Luo, L. Huang, G. Chen and H. Shen, "Privacy-preserving distance measurement and its applications", Chinese Journal of Electronics, Vol.15, No.2, pp.237-241, 2006.
    • (2006) Chinese Journal of Electronics , vol.15 , Issue.2 , pp. 237-241
    • Luo, Y.1    Huang, L.2    Chen, G.3    Shen, H.4
  • 19
    • 0022080529 scopus 로고
    • A randomized protocol for signing contracts
    • S. Even, O. Goldreich and A. Lempel, "A randomized protocol for signing contracts", Communications of the ACM, Vol.28, No.6, pp.637-647, 1985.
    • (1985) Communications of the ACM , vol.28 , Issue.6 , pp. 637-647
    • Even, S.1    Goldreich, O.2    Lempel, A.3


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