Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Formal Computational Unlinkability Proofs of RFID Protocols   We set up a framework for the formal proofs of RFID protocols in the
computational model. We rely on the so-called computationally complete symbolic
attacker model. Our contributions are: i) To design (and prove sound) axioms
reflecting the properties of hash functions (Collision-Resistance, PRF); ii) To
formalize computational unlinkability in the model; iii) To illustrate the
method, providing the first formal proofs of unlinkability of RFID protocols,
in the computational model.

24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
13
The categories of this paper are: quant-ph