From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

Handbook of Applied Cryptography

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

BIOE 402. Medical Technology Assessment. 2 or 3 hours. Bioentrepreneur course. Assessment of medical technology in the context of commercialization. Objectives, competition, market share, funding, pricing, manufacturing, growth, and intellectual property; many issues unique to biomedical products. Course Information: 2 undergraduate hours. 3 graduate hours. Prerequisite(s): Junior standing or above and consent of the instructor.

“Bioinformatics” 특집을 내면서

An Introduction to MultiAgent Systems.

Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or 'prefixes' which designate network reachability among autonomous systems (AS). Point of concern in BGP is its lack of effective security measures which makes Internet vulnerable to different forms of attacks. Many solutions have been proposed till date to combat BGP security issues but not a single one is deployable in practical scenario. Any security proposal with optimal solution should offer adequate security functions, performance overhead and deployment cost. This paper critically analyzes the deployment issues of best three proposals considering trade-off between security functions and performance overhead.

Comparative analysis of

We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such that any straight line segment crossing the polygon intersects at least one of the edges in S. We observe that this problem is equivalent to a new hiding problem, the Max-Hidden-Edge-Set problem. We prove the APX-hardness of the Max-Hidden-EdgeSet problem for polygons without holes and rectilinear polygons without holes, by providing gap-preserving reductions from the Max-5-Occurrence-2-Sat problem.

/pdf/inapproximability-of-the-perimeter-defense-problem-29h5l3kr7g.pdf

Inapproximability of the Perimeter Defense Problem

Deterministic symmetric rendezvous with tokens in a synchronous torus

http://clavius.bc.edu/~clote/pub/shapes.pdf

On realizing shapes in the theory of RNA neutral networks.

The design and implementation of security threat mitigation mechanisms in RFID systems, specially in low-cost RFID tags, are gaining great attention in both industry and academia. One main focus of research interests is the authentication and privacy techniques to prevent attacks targeting the insecure wireless channel of these systems. Cryptography is a key tool to address these threats. Nevertheless, strong hardware constraints, such as production costs, power consumption, time of response, and regulations compliance, makes the use of traditional cryptography in these systems a very challenging problem. The use of low-overhead procedures becomes the main approach to solve these challenging problems where traditional cryptography cannot fit. Recent results and trends, with an emphasis on lightweight techniques for addressing critical threats against low-cost RFID systems, are surveyed.

/pdf/security-threat-mitigation-trends-in-low-cost-rfid-systems-344kt5deo6.pdf

Security threat mitigation trends in low-cost RFID systems

We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio stations with the same communication range, distributed in a random uniform way on a unit square region. In order to capture fault dependencies, we introduce the ranged spotmodel in which damaging events, called spots, occur randomly and independentlyon the region, causing faults in all nodes located within distance sfrom them. Node faults within distance 2sbecome dependent in this model and are positively correlated. We investigate the impact of the spot arrival rate on the feasibility and the time of communication in the fault-free part of the network. We provide an algorithm which broadcasts correctly with probability 1 ? ?in faulty random geometric radio networks of diameter Din time O(D+ log1/?).

/pdf/communication-in-random-geometric-radio-networks-with-2dyqslcpxp.pdf

Evangelos Kranakis

Papers

Inapproximability of the Perimeter Defense Problem

Deterministic symmetric rendezvous with tokens in a synchronous torus

On realizing shapes in the theory of RNA neutral networks.

Security threat mitigation trends in low-cost RFID systems

Communication in Random Geometric Radio Networks with Positively Correlated Random Faults