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 study a problem of dissecting a rectangle into a minimum number of pieces which may be reassembled into a square. The dissection is made using only rectilinear glass-cuts, i.e., vertical or horizontal straight-line cuts separating pieces into two.

/pdf/rectilinear-glass-cut-dissections-of-rectangles-to-squares-1z8eftmwbn.pdf

Rectilinear Glass-Cut Dissections of Rectangles to Squares

Fast spreading network worms have become one of the most service-impacting threats in enterprise and ISP networks. We identify core requirements for effective detection and containment of such worms and propose a technique that uses a combination of distributed anomaly-based host intrusion detection and statistical analysis of network heuristics to detect malicious worm activity. Our proposal employs an automated collaborative network-centric worm containment approach. We experiment on a live test-bed with fast spreading worms and evaluate the effectiveness ofour method in detecting and containing such worms. We also evaluate the system's performance when malicious worm traffic blends with benign network scanning traffic.

/pdf/endpoint-driven-intrusion-detection-and-containment-of-fast-2l9oay8cfp.pdf

Endpoint-Driven Intrusion Detection and Containment of Fast Spreading Worms in Enterprise Networks

In many distributed computing environments, processes are concurrently executed by nodes in a store-and-forward network. Distributed control issues as diverse as name-server, mutual exclusion and replicated data management, involve making matches between processes. The generic paradigm is a formal problem called “distributed match-making”. The applications require solutions to weighted versions of the problem. We define new multi-dimensional and weighted versions, and the relations between the two, and develop a very general method to prove lower bounds on the complexity as a trade-off between number of messages and “distributedness”. The resulting lower bounds are tight in all cases we have examined.

Weighted Distributed Match-Making

We study set systems over the vertex set (or edge set) of some graph that are induced by special graph properties like clique, connectedness, path, star, tree, etc. We derive a variety of combinatorial and computational results on the VC (Vapnik-Chervonenkis) dimension of these set systems.

VC-Dimensions for Graphs (Extended Abstract)

We revisit the linear search problem where a robot, initially placed at the origin on an infinite line, tries to locate a stationary target placed at an unknown position on the line. Unlike previous studies, in which the robot travels along the line at a constant speed, we consider settings where the robot's speed can depend on the direction of travel along the line, or on the profile of the terrain, e.g. when the line is inclined, and the robot can accelerate. Our objective is to design search algorithms that achieve good competitive ratios for the time spent by the robot to complete its search versus the time spent by an omniscient robot that knows the location of the target. We consider several new robot mobility models in which the speed of the robot depends on the terrain.These include 1) different constant speeds for different directions, 2) speed with constant acceleration and/or variability depending on whether a certain segment has already been searched, 3) speed dependent on the incline of the terrain. We provide both upper and lower bounds on the competitive ratios of search algorithms for these models, and in many cases, we derive optimal algorithms for the search time.

Evangelos Kranakis

Papers

Rectilinear Glass-Cut Dissections of Rectangles to Squares

Endpoint-Driven Intrusion Detection and Containment of Fast Spreading Worms in Enterprise Networks

Weighted Distributed Match-Making

VC-Dimensions for Graphs (Extended Abstract)

Linear Search with Terrain-Dependent Speeds