: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
The lecture notes cover the following topics,
Fundamentals (OSI Reference Model, Coding, Ethernet), Data Link Control (Flow Control, Error Control, HDLC, PPP), Internet Protocol ...
This paper presents a novel Mod-4 steganographic method in discrete cosine transform (DCT) domain. A group of 2?2 quantized DCT coefficients (GQC) is selected as the valid embeddi...
A profiling adversary is an adversary whose goal is to classify a population of users into categories according to messages they exchange. This adversary models the most common pr...
Aleksandra Korolova, Ayman Farahat, Philippe Golle