Data theft is a major threat for modern organizations with potentially large economic consequences. Although these attacks may well originate outside an organization’s information systems, the attacker—or else an insider—must eventually make contact with the system where the information resides and extract it. In this work, we propose a scheme that hinders unauthorized data extraction by modify...

Group communication security is needed to protect sensitive information. A group key is shared by all users under secure group communication model. The group key is used to encrypt data transmitted to the group. The group membership is dynamic and requires new key for membership changes. Secure multicast transmission schemes are used to transfer data to a set of nodes. Membership in secure mult...

Proving bounds on the expected differential probability (EDP) of a characteristic over all keys has been a popular technique of arguing security for both block ciphers and hash functions. In fact, to a large extent, it was the clear formulation and elegant deployment of this very principle that helped Rijndael win the AES competition. Moreover, most SHA-3 finalists have come with explicit upper...

A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. to secure the communication as the data are sensitive or it requires the users to pay for it. In the algorithms for secure communication a key is shared by H with V and V with users. The key is used to encrypt data transmitted to the servers or users. In privacy based aut...

It has been brought to our attention by a reader of Sensors that substantial portions of this article [1] have been copied from an earlier publication [2] without credit. After confirming this case with the authors, we have determined that indeed this manuscript clearly violates our policy on originality of all material submitted for publication and the generally accepted ethics of scientific p...

Based on Stanek’s results [1] we know that in model with integer rate PGV like compression functions no high speed collision resistant compression functions exist. Thus we try to study more general multiple block ciphers based model of compression functions with rational rate, like 6/5. We show a new upper bound of the rate of collision resistant compression functions in this model. 1 Motivatio...

NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto’96], who proved it t...

A number of key management challenges are encountered when operating tactical communication systems using a group-wide shared key. A large portion of such communications occurs over low bit-rate channels, and all communication channels must be available at any moment for mission action. Current over-the-air rekeying protocols consume too much channel bit-rate to be practical for large tactical ...

SPECIAL FOCUS ON: ARCHITECTURE/OS SUPPORT FOR EMBEDDED MULTI-CORE SYSTEMS 883 Resource Sharing Problem of Timing Variation-Aware Task Scheduling and Binding in MPSoC Haneul Chon and Taewhan Kim 895 Implementing a Thermal-Aware Scheduler in Linux Kernel on a Multi-Core Processor Liang Xia, Yongxin Zhu, Jun Yang, Jingwei Ye and Zonghua Gu 904 Design of On-Chip Crossbar Network Topology Using Chai...

Security of networks depends on reliable key management systems which generate and distribute symmetrical/asymmetrical encryption/decryption keys between communicating parties. Traditionally, in wired networks, a central server is responsible to generate and distribute the keys securely. But because of no central server or fixed infrastructure exists in mobile ad hoc networks, there are many di...