We survey some results in quantum cryptography. After a brief introduction toclassical cryptography, we provide the quantum-mechanical background needed to present somefundamental protocols from quantum cryptography. (more…)
In this article, we review the algorithms for rotation, scaling andtranslation (RST) invariant image watermarking. There are mainly two categories of RST invariantimage watermarking algorithms. One is to rectify the RST transformed image before conductingwatermark detection. Another is to embed and detect watermark in an RST invariant or semi-invariantdomain. (more…)
In 1990, Manber and Myers proposed suffix arrays as a space-savingalternative to suffix trees and described the first algorithms for suffix array construction anduse. Since that time, and especially in the last few years, suffix array construction algorithmshave proliferated in bewildering abundance. (more…)
This article presents a survey of denial of service attacks and the methodsthat have been proposed for defense against these attacks. In this survey, we analyze the designdecisions in the Internet that have created the potential for denial of service attacks. (more…)
Full-text indexes provide fast substring search over large text collections.A serious problem of these indexes has traditionally been their space consumption. A recent trend isto develop indexes that exploit the compressibility of the text, so that their size is a functionof the compressed text length. This concept has evolved into self-indexes, which in addition containenough information to reproduce any text portion, so they replace the text. The excitingpossibility of an index that takes space close to that of the compressed text, replaces it, and inaddition provides fast search over it, (more…)
The article reviews the most popular peer-to-peer key management protocolsfor mobile ad hoc networks (MANETs). The protocols are subdivided into groups based on their designstrategy or main characteristic. (more…)
