Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an implementation of higher order logic. For each algorithm, functional correctness, namely that decryption inverts encryption, is formally proved by a simple but effective proof methodology involving application of invertibility lemmas in the course of symbolic evaluation. Block ciphers are then lifted to the encryption of arbitrary datatypes by using modes of operation to encrypt lists of bits produced by a polytypic encoding method. 1

System on Devices (SyD) is a specification for a middleware to enable heterogeneous collections of information, databases, or devices (such as hand-held devices) to collaborate with each other. This paper illustrates the advantages of SyD by describing a prototype calendar of meetings application. This application highlights some of the technical merits of SyD by exploiting the use of coordination links. Based on the underlying event-and-trigger mechanism, these links allow automatic updates as well as real-time enforcements of global constraints and interdependencies, not available with existing calendar applications. Additionally, the calendar application illustrates coordination among heterogeneous devices and databases, formation and maintenance of dynamic groups, mobility support through proxies, and performance group transactions across independent data stores.

Abstract — With rapidly decreasing cost of storage, even for mobile computing applications involving PDAs / mobile phones storage (using flash memory) is an inexpensive resource. Weintroduce a novel probabilistic key predistribution scheme (PKPS) I-HARPS which can make good use of this inexpensive resource to improve security. I-HARPS is a combination of random subset allocation schemes first proposed by Dyer et al [1] in 1995, and the escrowed master key based key distribution scheme proposed by Leighton and Micali in 1993 [2]. While PKPSs have received substantial attention recently in the context of highly resource constrained sensor networks, we argue that the fact that I-HARPS can resist coalitions of even millions of nodes with very low computational complexity, and very reasonable storage requirements, can significantly expand the scope of applications of PKPSs. I.

Abstract. We present a framework for certifying hardware designs generated through behavioral synthesis, by using formal verification to certify the associated synthesis transformations. We show how to decompose this certification into two components, which can be respectively handled by the complementary verification techniques, theorem proving and model checking. The approach produces a certified reference flow, composed of transformations distilled from production synthesis tools but represented as transformations on graphs with an associated formal semantics. This tool-independent abstraction disentangles our framework from the inner workings of specific synthesis tools while permitting certification of hardware designs generated from a broad class of behavioral descriptions. We provide experimental results suggesting the scalability on practical designs. 1

Abstract. We have designed three fast implementations of recently proposed family of hash functions Edon–R. They produce message digests of length 256, 384 and 512 bits. We have defined huge quasigroups of orders 2 256, 2 384 and 2 512 by using only bitwise operations on 32 bit values (additions modulo 2 32, XORs and left rotations) and achieved processing speeds of the Reference C code of 16.18 cycles/byte, 24.37 cycles/byte and 32.18 cycles/byte on x86 (Intel and AMD microprocessors). In this paper we give their full description, as well as an initial security analysis. Key words: hash function, Edon–R, quasigroup 1

Networks (WSNs) and the mechanisms to support the requirements, demand a critical examination. Therefore, the security protocols employed in WSNs should be so designed, as to yield the optimum performance. The efficiency of the block cipher is, one of the important factors in leveraging the performance of any security protocol. In this paper, therefore, we focus on the issue of optimizing the security vs. performance tradeoff in the security protocols in WSNs. As part of the exercise, we evaluate the storage requirements of the block ciphers viz. the Advanced Encryption Standard (AES) cipher Rijndael, the Corrected Block Tiny Encryption Algorithm (XXTEA) using the Output Codebook Block (OCB) mode. We compare our results with the Skipjack cipher in Cipher Block Chaining (CBC) mode. Our results clearly show the light-weight cipher XXTEA, as the optimal cipher and the Output Codebook Mode as the optimal mode of operation for the link layer security protocols. To the best of our knowledge, ours is the first experimental evaluation of the AES cipher Rijndael, the corrected block Tiny Encryption Algorithm (XXTEA) and the OCB mode in the link layer security architecture for WSNs. Index Terms—authentication, block ciphers, encryption, link layer security, wireless sensor networks I.