Boolean function

Abstract: We generalize the framework of non-cooperative computation (NCC), recently introduced by Shoham and Tennenholtz, to apply to cryptographic situations. We consider functions whose inputs are held by separate, self-interested agents. We consider four components of each agent's utility function: (a) the wish to know the correct value of the function, (b) the wish to prevent others from knowing it, (c) the wish to prevent others from knowing one's own private input, and (d) the wish to know other agents' private inputs. We provide an exhaustive game theoretic analysis of all 24 possible lexicographic orderings among these four considerations, for the case of Boolean functions (mercifully, these 24 cases collapse to four). In each case we identify the class of functions for which there exists an incentive-compatible mechanism for computing the function. In this article we only consider the situation in which the inputs of different agents are probabilistically independent.

Abstract: Korner defined the notion of graph entropy He used it to simplify the proof of the Fredman--Komlos lower bound for the family size of perfect hash functions We use this information-theoretic notion to obtain a general method for formula size lower bounds This method can be applied to low-complexity functions for which the other known general methods do not apply

Abstract: The S-boxes used in the DES are the major cryptographic component of the system Any structure which they possess can have far reaching implications for the security of the algorithm Structure may exist as a result of design principles intended to strengthen security Structure could also exist as a “trapdoor” for breaking the system This paper examines some properties which the S-boxes satisfy and attempts to determine a reason for such structure to exist

Abstract: We present a new approach to unbounded, fully symbolic model checking of timed automata that is based on an efficient translation of quantified separation logic to quantified Boolean logic. Our technique preserves the interpretation of clocks over the reals and can check any property in timed computation tree logic. The core operations of eliminating quantifiers over real variables and deciding the validity of separation logic formulas are respectively translated to eliminating quantifiers on Boolean variables and checking Boolean satisfiability (SAT). We can thus leverage well-known techniques for Boolean formulas, including Binary Decision Diagrams (BDDs) and recent advances in SAT and SAT-based quantifier elimination. We present preliminary empirical results for a BDD-based implementation of our method.