Motivated by the peer-to-peer content sharing systems in large-scale networks, we will study interval routing schemes in ErdösRényi random graphs. C. Gavoille and D. Peleg [13] posed an open question… (More)

Cryptology is a mathematical hard core of information security, since many of the information security problems (e.g. confidentiality, integrity, authenticity of information) can be (and often are)… (More)

Recently, there was a new authentication and key distribution protocol presented in [EHA98]. In this paper we show that certain claims on its properties are not valid. We also suggest some… (More)

Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are… (More)

We consider an n-ary random Boolean function f such that Pr[f(α̃) = 1] = p for α̃ ∈ {0, 1} and study its geometric model, the so called interval graph. The interval graph of a Boolean function was… (More)

Emergence of dominating cliques in Erdös-Rényi random graph model G(n, p) is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a… (More)

The successful growth of Internet, lead to application of World Wide Web (WWW) technologies in current IT systems. One of the traditional high-level objectives of IT security is integrity. We focus… (More)