Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Privacy Leakages in Approximate Adders   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.

20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
3
The categories of this paper are: physics
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat