The internet of things (IoT) revolution has been sparked by the exponential increase in connected devices caused recent advances wireless technology. These embedded gather, analyze, and send vast data via network. Data transmission security is a primary problem IoT networks. Several lightweight encryption/decryption algorithms have developed for such resource-constraint devices. One most effect...

The edge of the smart grid has a massive number power and resource-constrained interconnected devices. Mainly, meters report consumption data from consumer homes, industrial buildings, other connected infrastructures. Multiple approaches were proposed in literature to preserve privacy consumers by altering via additive noise, masking, or obfuscation techniques. A significant body work employs d...

Emerging applications in electronic commerce of ten involve very low cost transactions which ex ecute in the context of ongoing extended client server relationships For example consider a web site server which o ers repeated authenticated personalized stock quotes to each of its subscribers clients The value of a single transaction e g de livery of a web page with a customized set of quotes doe...

As the next evolutionary step in digital communication systems, mobile ad hoc networks (MANETs) and their specialization like wireless sensor networks (WSNs) have been attracting much interest in both research and industry communities. In MANETs, network nodes can come together and form a network without depending on any pre-existing infrastructure and human intervention. Unfortunately, the sal...

Successful attacks against industrial control systems (ICS) often exploit insufficient checking mechanisms. While firewalls, intrusion detection systems, and similar appliances introduce essential checks, their efficacy depends on the attackers’ ability to bypass such middleboxes. We propose a provenance solution enable verification of end-to-end message delivery path actions performed message....

The ultimate goal of designing a symmetric-key cryptographic primitive often can be formulated as an optimization problem. So far, these problems mainly have been solved with trivial algorithms such as brute force or random search. We show that a more advanced and equally versatile class of search algorithms, called metaheuristics, can help to tackle optimization problems related to design of s...

Complex cryptographic protocols are often constructed in a modular way from primitives such as signatures, commitments, and encryption schemes, verifiable random functions, etc. together with zero-knowledge proofs ensuring that these primitives are properly orchestrated by the protocol participants. Over the past decades a whole framework of discrete logarithm based primitives has evolved. This...

Maximum length CA has wide range of applications in design of linear block code, cryptographic primitives and VLSI testing particularly in Built-In-Self-Test. In this paper, an algorithm to compute all n-cell maximum length CA-rule vectors is proposed. Also rule vectors for each primitive polynomial in GF (2) to GF (2) have been computed by simulation and they have been listed.Programmable rule...

We prove the existence of an oracle relative to which there exist seveial well-known cryptographic primitives, including one-way permutations, but excluding (for a suitably strong definition) collision-intractible hash functions. Thus any proof that such functions can be derived from these weaker primitives is necessarily non-relativizing; in particular, no provable construction of a collision-...