Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A method for unbounded verification of privacy-type properties   In this paper, we consider the problem of verifying anonymity and
unlinkability in the symbolic model, where protocols are represented as
processes in a variant of the applied pi calculus, notably used in the ProVerif
tool. Existing tools and techniques do not allow to verify directly these
properties, expressed as behavioral equivalences. We propose a different
approach: we design two conditions on protocols which are sufficient to ensure
anonymity and unlinkability, and which can then be effectively checked
automatically using ProVerif. Our two conditions correspond to two broad
classes of attacks on unlinkability, i.e. data and control-flow leaks. This
theoretical result is general enough that it applies to a wide class of
protocols based on a variety of cryptographic primitives. In particular, using
our tool, UKano, we provide the first formal security proofs of protocols such
as BAC and PACE (e-passport), Hash-Lock (RFID authentication), etc. Our work
has also lead to the discovery of new attacks, including one on the LAK
protocol (RFID authentication) which was previously claimed to be unlinkable
(in a weak sense).

0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
11
The categories of this paper are: hep-lat
5
The categories of this paper are: gr-qc
33
The categories of this paper are: plasm-ph
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex