PUFs, or physical unclonable functions, are hardware security primitives that can offer lightweight solutions for constrained devices through challenge-response authentication protocols. However, the PUF-based have been presented often lack features such as mutual message encryption, which could be vital many applications. Other protocols suffer from vulnerabilities to denial of service attacks...

We propose a novel privacy-preserving, two-party computation of various distance metrics (e.g., Hamming distance, Scalar Product) followed by comparison with fixed threshold, which is known as one the most useful and popular building blocks for many different applications including machine learning, biometric matching, etc. Our solution builds upon recent advances in function secret sharing mak...

The Communication systems are typical data systems, which can be undetermined by unauthorized users who have illegal access to the systems. Main Problem created in attacking to malicious node and group of network, whole traffic by system break, data loss, data affecting and data failure system. Overcome node Proposed scheme uses a role-based access control frame work, MANET concept working algo...

Authenticated encryption schemes are important cryptographic primitives that received extensive attention recently. They can provide both confidentiality and authenticity services, simultaneously. Correlation power analysis (CPA) can be a thread for authenticated ciphers, similar to the any physical implementation of any other cryptographic scheme. In this paper, a three-step CPA attack against...

In smart grid, smart meters are deployed to collect power consumption data periodically, and the data are analyzed to improve the efficiency of power transmission and distribution. The collected consumption data may leak the usage patterns of domestic appliances, so that it may damage the behavior privacy of customers. Most related work to protect data privacy in smart grid relies on cryptograp...

In this paper, we study the behavior of the XOR count distributions under different bases of finite field. XOR count of a field element is a simplified metric to estimate the hardware implementation cost to compute the finite field multiplication of an element. It is an important criterion in the design of lightweight cryptographic primitives, typically to estimate the efficiency of the diffusi...

This paper focuses on a surprising class of cryptanalysis results for symmetric-key primitives: when the number of rounds of the primitive is increased, the complexity of the cryptanalysis result decreases. Our primary target will be primitives that consist of identical round functions, such as PBKDF1, the Unix password hashing algorithm, and the Chaskey MAC function. However, some of our resul...

The cryptographic community has developed many tools to incorporate distributed trust mechanisms into cryptographic primitives and protocols as well as primitives where parties are naturally distributed. Since the fastest growing paradigm in computing is distributed systems and communication networks, the importance of distributed mechanisms has been increasing, and will likely to be pervasive ...

In 2012, Aaronson and Christiano introduced the idea of hidden subspace states to build public-key quantum money [STOC ’12]. Since then, this has been applied realize several other cryptographic primitives which enjoy some form unclonability.

We revise a known attack on the PIN verification framework, based on a weakness of the underlying security API. We specify this flawed API in an imperative language with cryptographic primitives and we show why its type-based verification fails in the type system of Myers, Sabelfeld and Zdancewic. We propose an improved API, extend the type system with cryptographic primitives for assuring inte...