3,558 research outputs found
Lengths May Break Privacy â Or How to Check for Equivalences with Length
Security protocols have been successfully analyzed using symbolic models, where messages are represented by terms and protocols by processes. Privacy properties like anonymity or untraceability are typically expressed as equivalence between processes. While some decision procedures have been proposed for automatically deciding process equivalence, all existing approaches abstract away the information an attacker may get when observing the length of messages.
In this paper, we study process equivalence with length tests. We first show that, in the static case, almost all existing decidability results (for static equivalence) can be extended to cope with length tests.
In the active case, we prove decidability of trace equivalence with length tests, for a bounded number of sessions and for standard primitives. Our result relies on a previous decidability result from Cheval et al (without length tests). Our procedure has been implemented and we have discovered a new flaw against privacy in the biometric passport protocol
Sharp error terms for return time statistics under mixing conditions
We describe the statistics of repetition times of a string of symbols in a
stochastic process. Denote by T(A) the time elapsed until the process spells
the finite string A and by S(A) the number of consecutive repetitions of A. We
prove that, if the length of the string grows unbondedly, (1) the distribution
of T(A), when the process starts with A, is well aproximated by a certain
mixture of the point measure at the origin and an exponential law, and (2) S(A)
is approximately geometrically distributed. We provide sharp error terms for
each of these approximations. The errors we obtain are point-wise and allow to
get also approximations for all the moments of T(A) and S(A). To obtain (1) we
assume that the process is phi-mixing while to obtain (2) we assume the
convergence of certain contidional probabilities
YAPA: A generic tool for computing intruder knowledge
Reasoning about the knowledge of an attacker is a necessary step in many
formal analyses of security protocols. In the framework of the applied pi
calculus, as in similar languages based on equational logics, knowledge is
typically expressed by two relations: deducibility and static equivalence.
Several decision procedures have been proposed for these relations under a
variety of equational theories. However, each theory has its particular
algorithm, and none has been implemented so far. We provide a generic procedure
for deducibility and static equivalence that takes as input any convergent
rewrite system. We show that our algorithm covers most of the existing decision
procedures for convergent theories. We also provide an efficient
implementation, and compare it briefly with the tools ProVerif and KiSs
Pesantren and the Preservation of Islam Nusantara
This article describes the background of the rise of an Indonesian moderate Islamic understanding in the midst of a trans-national Islamic movement with the scriptural-puritanical in it's character which spread out pervasively in the country; and this new Islamic model is intolerant to local traditions. Meanwhile, historically, Islam Nusantara has been deeply rooted among the Moslems in archipelago, and this traditional-moderate Islam has been developed by Wali-songo. Islam Nusantara is accommodative to the local cultures and traditions. It produces a moderate and tolerant model of Islam. This article also describes the role of pesantren in protecting the heritages of Islam Nusantara. Copyright (c) 2015 by KARSA. All right reservedDOI: 10.19105/karsa.v23i2.71
The Hierarchical Formation of the Galactic Disk
I review the results of recent cosmological simulations of galaxy formation
that highlight the importance of satellite accretion in the formation of
galactic disks. Tidal debris of disrupted satellites may contribute to the disk
component if they are compact enough to survive the decay and circularization
of the orbit as dynamical friction brings the satellite into the disk plane.
This process may add a small but non-negligible fraction of stars to the thin
and thick disks, and reconcile the presence of very old stars with the
protracted merging history expected in a hierarchically clustering universe. I
discuss various lines of evidence which suggest that this process may have been
important during the formation of the Galactic disk.Comment: paper to be read at the "Penetrating Bars through Masks of Cosmic
Dust" conference in South Afric
- âŠ