搜索结果: 1-3 共查到“密码学 Decision Trees”相关记录3条 . 查询时间(0.046 秒)
Non-Malleable Codes for Decision Trees
non-malleable codes decision trees small-depth circuits
2019/4/16
We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by decision trees of depth d=n1/4−o(1)d=n1/4−o(1). In particular, each bit of...
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
2017/11/3
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm ...
Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models based on Pre-Computation
privacy-preserving private data
2016/7/29
Many data-driven personalized services require that private data of users is scored against a trained machine learning model. In this paper we propose a novel protocol for privacy-preserving classific...