arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.08919cs.CRcs.AR
收藏

近似加法器中的隐私泄漏

Privacy Leakages in Approximate Adders

Shahrzad Keshavarz, Daniel Holcomb

摘要:

近似计算最近已经成为一种很有前途的方法,以满足数字设计的低功耗要求。在近似计算中产生的错误输出可以部分地是每个芯片的工艺变化的函数。我们表明,在这样的计划中,每个芯片实例上产生的错误输出可以揭示执行计算的芯片的身份,可能危及用户隐私。在这项工作中,我们进行仿真实验的32位纹波进位加法器,进位前瞻加法器,和汉卡尔森加法器运行在过缩放的工作点。我们的研究结果表明,识别是可能的,我们对比了每种类型的加法器的可识别性,我们量化的识别成功率如何随过缩放和噪声的程度而变化。我们的研究结果首次表明,近似的数字计算可能会损害隐私。未来近似计算系统的设计者应该意识到可能的隐私泄露,并决定在其应用中是否需要缓解。

英文摘要:

Approximate computing has recently emerged as a promising method to meet the low power requirements of digital designs. The erroneous outputs produced in approximate computing can be partially a function of each chip's process variation. We show that, in such schemes, the erroneous outputs produced on each chip instance can reveal the identity of the chip that performed the computation, possibly jeopardizing user privacy. In this work, we perform simulation experiments on 32-bit Ripple Carry Adders, Carry Lookahead Adders, and Han-Carlson Adders running at over-scaled operating points. Our results show that identification is possible, we contrast the identifiability of each type of adder, and we quantify how success of identification varies with the extent of over-scaling and noise. Our results are the first to show that approximate digital computations may compromise privacy. Designers of future approximate computing systems should be aware of the possible privacy leakages and decide whether mitigation is warranted in their application.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑