메뉴 건너뛰기




Volumn 1, Issue , 2016, Pages 342-351

Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHARACTER RECOGNITION; DATA PRIVACY; DISTRIBUTED DATABASE SYSTEMS; FORECASTING; LEARNING SYSTEMS; OPTICAL CHARACTER RECOGNITION; THROUGHPUT;

EID: 84997765950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (593)

References (27)
  • 1
    • 0041783510 scopus 로고    scopus 로고
    • Privacypreserving data mining
    • ACM
    • Agrawal, Rakesh and Srikant, Ramakrishnan. Privacypreserving data mining. In ACM Sigmod Record, pp. 439-450. ACM, 2000.
    • (2000) ACM Sigmod Record , pp. 439-450
    • Agrawal, R.1    Srikant, R.2
  • 5
    • 84893357415 scopus 로고    scopus 로고
    • Improved security for a ring-based fully homomorphic encryption scheme
    • Springer
    • Bos, Joppe W, Lauter, Kristin, Loftus, Jake, and Naehrig, Michael. Improved security for a ring-based fully homomorphic encryption scheme. In Cryptography and Coding, pp. 45-64. Springer, 2013.
    • (2013) Cryptography and Coding , pp. 45-64
    • Bos, J.W.1    Lauter, K.2    Loftus, J.3    Naehrig, M.4
  • 7
    • 70350345197 scopus 로고    scopus 로고
    • Privacy-preserving backpropagation neural network learning
    • Chen, Tingting and Zhong, Sheng. Privacy-preserving backpropagation neural network learning. Neural Networks, IEEE Transactions on, 20(10):1554-1564, 2009.
    • (2009) Neural Networks, IEEE Transactions on , vol.20 , Issue.10 , pp. 1554-1564
    • Chen, T.1    Zhong, S.2
  • 11
    • 70350642087 scopus 로고    scopus 로고
    • Fully homomorphic encryption using ideal lattices
    • Gentry, Craig. Fully homomorphic encryption using ideal lattices. In STOC, volume 9, pp. 169-178, 2009.
    • (2009) STOC , vol.9 , pp. 169-178
    • Gentry, C.1
  • 21
    • 36949019777 scopus 로고    scopus 로고
    • Oblivious neural network computing via homomorphic encryption
    • Orlandi, Claudio, Piva, Alessandro, and Barni, Mauro. Oblivious neural network computing via homomorphic encryption. EURASIP Journal on Information Security, 2007:18, 2007.
    • (2007) EURASIP Journal on Information Security , vol.2007 , pp. 18
    • Orlandi, C.1    Piva, A.2    Barni, M.3
  • 25
    • 79958014767 scopus 로고    scopus 로고
    • Making ntru as secure as worst-case problems over ideal lattices
    • Springer
    • Stehlé, Damien and Steinfeld, Ron. Making ntru as secure as worst-case problems over ideal lattices. In Advances in Cryptology-EUROCRYPT 2011, pp. 27-47. Springer, 2011.
    • (2011) Advances in Cryptology-EUROCRYPT 2011 , pp. 27-47
    • Stehlé, D.1    Steinfeld, R.2
  • 27
    • 45249105634 scopus 로고    scopus 로고
    • Privacy preserving k-nearest neighbor classification
    • Zhan, Justin Zhijun, Chang, LiWu, and Matwin, Stan. Privacy preserving k-nearest neighbor classification. IJNetwork Security, 1(1):46-51, 2005.
    • (2005) IJNetwork Security , vol.1 , Issue.1 , pp. 46-51
    • Zhan, J.Z.1    Chang, L.2    Matwin, S.3


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