The applicability of techniques in coding theory to problems in cryptography is illustrated by examples concerning secret-sharing schemes with tailored access priveleges, the design of perfect local randomizers, the construction of t-resilient functions, and the quantization of the nonlinearity of boolean functions. Some novel coding concepts, in particular the notions of minimal codewords in l...

Vehicle in vehicular ad hoc networks (VANETs) broadcasts beacons about their traffic status wirelessly for improving safety and efficiency. Before deployment of the VANET system, problems related to security privacy should be carefully addressed. In this article, we propose a lightweight authentication with conditional privacy-preserving scheme guaranteeing secure communication VANET. The propo...

A recent trend in cryptography is to formally prove the leakage resilience of cryptographic implementations – that is, one formally shows that a scheme remains provably secure even in the presence of side channel leakage. Although many of the proposed schemes are secure in a surprisingly strong model, most of them are unfortunately rather inefficient and come without practical security evaluati...

This paper examines Vaudenay’s privacy model, which is one of the first and most complete privacy models that featured the notion of different privacy classes. We enhance this model by introducing two new generic adversary classes, k-strong and k-forward adversaries where the adversary is allowed to corrupt a tag at most k times. Moreover, we introduce an extended privacy definition that also c...

In utility computing, customer requests varying services from software to infrastructure as and when needed. As a result, there are many mobile cloud providers provide this services on demand basis as per current market needs. To ensure compliance and security, these providers establish a contract popularly known as Service Level Agreement (SLA) which states the services and management aspects....

Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensuring privacy. A current trend is to design such protocols upon the Learning Parity from Noise (LPN) problem. The first who introduced this solution were Hopper and Blum in 2001. Since then, many protocols have been de...

Non-Malleable Codes for the split state model allow to encode a message into two parts such that arbitrary independent tampering on the parts either destroys completely the content or maintains the message untouched. If the code is also leakage resilient it allows limited independent leakage from the two parts. We propose a model where the two parts can be refreshed independently. We give an ab...

Opaque constructs have developed into a commonly used primitive in obfuscation, watermarking, and tamper-proofing schemes. However, most prior work has based the resilience of these primitives on a poorly defined reduction to a known N P -complete problem. There has been little scrutiny of the adversarial model and little discussion of how to generate instances that are always hard. In this pap...

We propose the notion of tamper-evident stabilization –that combines stabilization with the concept of tamper evidence– for computing systems. On the first glance, these notions are contradictory; stabilization requires that eventually the system functionality is fully restored whereas tamper evidence requires that the system functionality is permanently degraded in the event of tampering. Tamp...

The widespread of Internet usage has resulted in a greater number and variety of applications involving different types of private information. In order to diminish privacy concerns and strengthen user trust, security improvements in terms of authentication are necessary. The solutions need to be convenient, entailing ease of use and higher mobility. The suggested approach is to make use of the...