Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Linda is a high level communication model which allows agents to communicate via a shared tuple spaces without knowing each other’s identities and without having to arrange for ...
Naftaly H. Minsky, Yaron Minsky, Victoria Ungurean...
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Misuse-based intrusion detection systems rely on models of attacks to identify the manifestation of intrusive behavior. Therefore, the ability of these systems to reliably detect ...
Giovanni Vigna, William K. Robertson, Davide Balza...