A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and a⊕b = x∧y. Such boxes have been central to the study of quantum or generalized non-locality, as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice a...

Private Information Retrieval (PIR) allows a client to obtain data from a public database without disclosing the locations accessed. Traditionally, the stress is on preserving sublinear work for the client, while the server’s work is taken to inevitably be at least linear in the database size. Beimel, Ishai and Malkin (JoC 2004) show PIR schemes where, following a linear-work preprocessing stag...

Masking schemes are a prominent countermeasure to defeat power analysis attacks. One of their core ingredients is the encoding function. Due to its simplicity and comparably low complexity overheads, many masking schemes are based on a Boolean encoding. Yet, several recent works have proposed masking schemes that are based on alternative encoding functions. One such example is the inner product...

In cryptography it is assumed that adversaries only have black box access to the secret keys of honest parties. In real life, however, the black box approach is not sufficient because attackers have access to many physical means that enable them to derive information on the secret keys. In order to limit the attacker’s ability to read out secret information, the concept of Algorithmic Tamper Pr...

Goldreich and Izsak (Theory of Computing, 2012) initiated the research on understanding the role of negations in circuits implementing cryptographic primitives, notably, considering one-way functions and pseudo-random generators. More recently, Guo, Malkin, Oliveira and Rosen (TCC, 2014) determined tight bounds on the minimum number of negations gates (i.e., negation complexity) of a wide varie...

An ad hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point. In this chapter we present a design for the operation of such ad hoc networks. The basic idea of the design is to operate each mobile node as a specialized router, which periodically advertises its view of the interconnection topology with other mobi...

Classical conditions for the bifurcation of periodic solutions in perturbed auto-oscillating and conservative systems go back to Malkin and Mel’nikov, respectively. These authors’ papers were based on the Lyapunov–Schmidt reduction and the implicit function theorem, which lead to the requirement that both the cycles and the zeros of the bifurcation functions be simple. In this paper a geometric...

In Eurocrypt'99, Canetti, Malkin, and Nissim 1] presented a new tree based key distribution algorithm that required O(log n) (n is the group size) key update communications and key storage of O(n log n). The results in 1] are known to be the rst results presenting the sub-linear storage among the family of tree based key distribution schemes. The question of whether this storage was the possibl...

We study the problem of designing a storage efficient secure multicast key management scheme based on one-way function trees (OFT) for a prespecified key update communication overhead. Canetti, Malkin and Nissim presented a hybrid model that divides a group of N members into clusters of M members and assigns each cluster to one leaf node of a key tree. Using the model, we formulate a constraine...