Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Rusinowitch, Michael"'
Publikováno v:
EPTCS 342, 2021, pp. 22-34
Cryptographic protocols are often specified by narrations, i.e., finite sequences of message exchanges that show the intended execution of the protocol. Another use of narrations is to describe attacks. We propose in this paper to compile, when possi
Externí odkaz:
http://arxiv.org/abs/2109.02802
Currently, most of the online social networks (OSN) keep their data secret and in centralized manner. Researchers are allowed to crawl the underlying social graphs (and data) but with limited rates, leading to only partial views of the true social gr
Externí odkaz:
http://arxiv.org/abs/1609.01616
Complex networks usually expose community structure with groups of nodes sharing many links with the other nodes in the same group and relatively few with the nodes of the rest. This feature captures valuable information about the organization and ev
Externí odkaz:
http://arxiv.org/abs/1607.02060
Rather than anonymizing social graphs by generalizing them to super nodes/edges or adding/removing nodes and edges to satisfy given privacy parameters, recent methods exploit the semantics of uncertain graphs to achieve privacy protection of particip
Externí odkaz:
http://arxiv.org/abs/1408.1209
Publikováno v:
Logical Methods in Computer Science, Volume 10, Issue 1 (February 9, 2014) lmcs:808
We investigate unification problems related to the Cipher Block Chaining (CBC) mode of encryption. We first model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element. By interpreting a
Externí odkaz:
http://arxiv.org/abs/1401.0445
Publikováno v:
EPTCS 122, 2013, pp. 39-49
Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but the feasability of these scenarios need to be confirmed at the implement
Externí odkaz:
http://arxiv.org/abs/1307.8210
We define guarded variable automata (GVAs), a simple extension of finite automata over infinite alphabets. In this model the transitions are labelled by letters or variables ranging over an infinite alphabet and guarded by conjunction of equalities a
Externí odkaz:
http://arxiv.org/abs/1304.6297
To model Web services handling data from an infinite domain, or with multiple sessions, we introduce fresh-variable automata, a simple extension of finite-state automata in which some transitions are labeled with variables that can be refreshed in so
Externí odkaz:
http://arxiv.org/abs/1302.4205
Publikováno v:
7th International Conference on Language and Automata Theory and Application (2013)
We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules. We also extend the param
Externí odkaz:
http://arxiv.org/abs/1212.5108
The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator s
Externí odkaz:
http://arxiv.org/abs/1207.4871