JavaScript Menu Courtesy of
Stevens Computer Science Engineering & Science Stevens Computer Science
Stevens Institute of Technology Stevens Computer Science Homepage Stevens Computer Science Homepage
Stevens CS
Mission Statement
News & Events
Success Stories

gray gray Share/Save/Bookmark
Stevens CS
Seminar List
Untitled Document

December 8, 2003

How Realistic is Photorealistic?

Hany Farid, Dartmouth

Computer graphics rendering software is capable of generating highly photorealistic images that are often impossible to differentiate from photographic images. I will describe a model based on first- and higher-order wavelet statistics that reveals subtle but significant differences between photorealistic and photographic images. I will also discuss applications of this model to digital forensics, intercepting covert communications, and art forensics. more

December 4, 2003

Software Security Monitors: Theory and Practice

David Walker, Princeton University

Modern systems for language-based security, such as the Java Virtual Machine or Common Language Runtime, combine run-time security monitoring with strong type systems to enforce end-to-end security policies on untrusted code. In this talk, we focus on the first component of these systems, the run-time security monitor.

First, we introduce a general abstract model for security monitors as automata that intercept the sequence of untrusted pr more

December 1, 2003

Software Copyrights/Patents and Free Software

Robert Dewar, New York University

This talk will discuss how copyrights and patents work in general in this country, and specifically how this applies to software. It will also discuss what Free Software and Open Source Software is about, and how the development of such software is affected by copyright and patent issues. Robert Dewar is a professor of Computer Science at New York University, where he specializes in programming languages and compilers. He is the author of a book on microproce more

November 24, 2003

Cone-Beam Helical CT Virtual Endoscopy: Reconstruction, Segmentation and Automatic Navigation

Bruno Carvalho, Stevens Institute of Technology 

Virtual Endoscopy (VE) is a technique in which three-dimensional (3D) data, acquired by an imaging technique such as Computerized Tomography (CT) or Magnetic Resonance Imaging (MRI), is segmented and presented in an animation so as to mimic an endoscopic examination, i.e., as if a camera were introduced into an anatomical structure. It has been shown that the detection rate of small abnormalities in VE is still below acceptable ra more

November 17, 2003

Domain Partitioning for Open Reactive Systems

Scott Stoller, SUNY at Stony Brook

Testing or model-checking an open reactive system often requires generating a model of the environment. We describe a static analysis for Java that computes a partition of a system's inputs: inputs in the same equivalence class lead to identical behavior. The partition provides a basis for generation of code for a most general environment of the system, i.e., one that exercises all possible behaviors of the system. The partition also helps the g more

November 13, 2003

Information Flow Analysis

Andrew Myers, Cornell

Noninterference is a property of sequential programs that is useful for expressing security policies for data confidentiality and integrity. However, extending noninterference to concurrent programs has proved problematic. This talk describes a relatively expressive secure concurrent language. This language, based on existing concurrent calculi, provides first-class channels, higher-order functions, and an unbounded number of threads. Well-typed programs obey a gen more

November 10, 2003

Computing Geodesics and Minimal Surfaces via Graph Cuts

Yuri Boykov, Siemens Corporate Research

Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding c more

November 6, 2003

A Certifying Compiler for Java

Christopher League, Long Island University

Although objects and classes are implemented as records of functions, that simplicity belies an expressive power beyond the sum of their parts. On their own, records and functions are eminently typable, but using them to model object-oriented mechanisms requires surprisingly complex type systems. This talk will provide an introduction to some of the issues in type-safe encodings of objects and classes, culminating with a look at a certifying more

November 3, 2003

An End-Point Solution to Zero-day Worms

Angelos Keromytis, Columbia University

I will present a reactive mechanism that protects software services against network worms and other similar malware for which no known fix is available at the time of infection. The system works by automatically patching the vulnerable software. Our preliminary results against worms such as Slammer and Blaster indicate an 80% success rate in automatically identifying and fixing the flaw in the source code. I will discuss the design, implementation, more

October 27, 2003

Private Matching and Information Retrieval via Homomorphic Encryption

Benny Pinkas, HP Labs

A homomorphic encryption system enables anyone, even parties who do not know the decryption key, to apply arithmetic operations to encrypted messages. We describe how this property can be used to design secure, privacy-preserving protocols for the following two tasks.

Private matching: Imagine two parties, Alice and Bob. Each party has an input which is a private list of K items. The output is the intersection of the two lists, and must be computed witho more

October 21, 2003

Secure Object Identification - How To Solve The Chess-Grandmaster-Problem

Ammar Alkassar, Universität des Saarlandes, Germany

Many applications of cryptographic identification protocols are vulnerable against physical adversaries who perform real time attacks. For instance, when identifying a physical object like an automated teller machine, common identification schemes can be bypassed by faithfully relaying all messages between the communicating participants. This attack is known as mafia fraud. In my talk I will give an overview over different approa more

October 20, 2003

Using Neighbor Graphs in Support of Fast and Secure WLAN Mobility

William Arbaugh, University of Maryland

IEEE 802.11 based wireless networks have seen rapid growth and deployment in recent years. Critical to the 802.11 MAC operation is the hand-off function that occurs when a mobile node moves its association from one access point (or base station) to another. In this talk I will present an empirical study of the 802.11 handoff process at the link layer which will include a detailed breakup of the contributing factors of the latency. In particular, I more

October 16, 2003


Trevor Jim, AT&T Labs - Research

Cyclone is a dialect of C that is designed to be safe: free of buffer overflows, format string attacks, memory management errors, and other such bugs that are often the cause of security breaches.

Cyclone retains C's syntax, types, and low-level control over data representations and memory management, while ensuring safety through a combination of compile-time analysis and link- and run-time checks. The combination of safety and C com more

October 6, 2003

Origin Authentication in Interdomain Routing

Patrick McDaniel, AT&T Labs - Research

Attacks against Internet routing are increasing in number and severity. Contributing greatly to these attacks is the absence of origin authentication: there is no way to validate claims of address ownership or location. The lack of such services enables not only attacks by malicious entities, but indirectly allow seemingly inconsequential miconfigurations to disrupt large portions of the Internet. This paper considers the semantics, desig more

September 29, 2003

Timed-Release Cryptography: New Constructions and Assumptions

Juan Garay, Bell Labs - Lucent Technologies

The goal of timed-release crypto is to "send information into the future," i.e., to apply a cryptographic transformation (e.g., encryption, signature) to a message so that it cannot be retrieved or verified by anyone until a pre-determined amount of time has passed. Although this problem was formulated in the early nineties, constructions that are efficient and at the same time satisfy strong verifiability properties (such as right c more

September 15, 2003

A New Two-Server Approach for Authentication with Short Secrets

Michael Szydlo, RSA Laboratories

Passwords and PINs continue to remain the most widespread forms of user authentication, despite growing awareness of their security limitations. This is because short secrets are convenient, particularly for an increasingly mobile user population. Many users are interested in employing a variety of computing devices with different forms of connectivity and different software platforms. Such users often find it convenient to authenticate by means of pass more

September 8, 2003

Exposure-Resilient Cryptography (Survey)

Yevgeniy Dodis, New York University

Much successful research has focused on developing cryptographic protocols and algorithms which are secure (in some appropriate and well-defined sense) under the assumption that "secret" information is kept hidden from the adversary. However, as cryptographic algorithms are increasingly deployed on inexpensive, lightweight, mobile, and/or unprotected devices, the risk of key exposure is becoming a serious threat to the security of many r more

May 5, 2003

Boxes Go Bananas: Parametric Higher-Order Abstract Syntax in System F

Stephanie Weirich, University of Pennsylvania

Higher-order abstract syntax is a simple technique for implementing languages with functional programming. Object variables and binders are implemented by abstractions and variables in the host language. Consequently, one can avoid implementing common and tricky routines dealing with variables, such as capture-avoiding substitution. Despite the advantages this technique provides, it is not commonly used because it is difficult to write sound e more

April 28, 2003

2nd Annual NJITES Cybersecurity Symposium

8:30-9:15 Registration and breakfast

9:15 Opening remarks  

9:30-10:30 Keynote talk: Living With Personal Surveillance. Ed Felten, Princeton University.

10:30-11:00 Coffee break.  

11:00-11:30 Cryptology and non-computer security. Matt Blaze more

April 23, 2003

On Quasi 4-Connected Graphs with Applications

Node connectivity plays a central role in graph theory. We review a recently introduced graph connectivity measure, known as "quasi 4-connectivity" and the structure of quasi 4-connected graphs. We show that several well-known results concerning graph minors easily follow from the structure of quasi 4-connected graphs. We also present some new results on planar quasi 4-connected graphs.


For more information please contact:

A Satyanarayana
Emeritus Professor
Room 306
Phone: 201.216.5614
Fax: 201.216.8249

April 21, 2003

Efficient Model Checking for Timing Diagrams

Nina Amla, Cadence Design Systems

Model checking is a fully automated procedure to decide if an implementation satisfies its specification. There are, however, two key issues that limit the effectiveness of model checking in practice. First, the state explosion problem - the global state transition graph of a system, composed of n sub-components acting in parallel, may be exponential in n - places severe limitations on the size of the systems that can be verified automatically. The second issu more

April 14, 2003

A Calculus of Untyped Aspect-Oriented Programs

James Riely, DePaul University

Aspects have emerged as a powerful tool in the design and development of systems. Currently, the dynamic semantics of aspects is described by a compilation (weaving) to an underlying object-oriented paradigm. This treatment is unsatisfactory for several reasons. Firstly, this semantics violates basic modularity principles of object-oriented programming. Secondly, the converse translation from object-oriented programs into an aspect framework has a more

April 10, 2003

Programming Languages for Information Security

Steve Zdancewic, University of Pennsylvania

Our society's widespread dependence on networked information systems for everything from personal finance to military communications makes it essential to improve the reliability and security of software. Recently, programming-languages research has demonstrated that security concerns can be addressed by using both program analysis and program rewriting as powerful and flexible enforcement mechanisms.

I will describe how to use progr more

April 4, 2003

An Overview of Data Warehousing and Data Mining Technology

Anoop Singhal, Monmouth University

Data warehousing (DW) encompasses algorithms and tools for bringing together data from distributed information repositories into a single repository that can be suitable for data analysis. Recent progress in scientific and engineering applications has accumulated huge volumes of data. The fast growing, tremendous amount of data, collected and stored in large databases has far exceeded our human ability to comprehend it without proper tools. D more

April 3, 2003

Adventures at Google

Martin Farach-Colton, Rutgers University

Google has changed the way some parts of a search engine are built. I'll discuss some of the changes, as well as some experiences from my two years in the Google Research Department and the nature of research at a startup.

March 31, 2003

Canonical Representation and Three View Geometry of Cylinders: Application to As-built Reconstruction and Industrial Augmented Reality

Nassir Navab Siemens Corporate Research

This talk will start with an overview of the Augmented Reality activities at Siemens Corporate Research. We will then focus on camera calibration, as-built reconstruction and augmented reality for industrial applications. We study cylinders, which are the main components in a large number of industrial sites. Oil platforms, refineries and off-shore installations are almost all made of pipes and pipelines. Chemical factories, water treatment plants more

March 17, 2003

Multimedia Semantic Analysis for Video Personalization and Summarization

Belle L. Tseng, IBM T.J. Watson Research Center

With the growing amount of multimedia content and increasing popularity of pervasive devices, people are more enthusiastic about viewing personalized videos specifically catered to the users. These devices vary widely and are limited in terms of power consumption, processing speed, display constraint, and video capabilities. When people use their pervasive devices, they generally restrict their viewing time on the limited displays and min more

March 5, 2003

Massive Graph Mining

James Abello, DIMACS / Rutgers University

A variety of massive data sets exhibit an underlying structure that can be modeled as dynamic weighted multi-digraphs. Their sizes range from tens of gigabytes to petabytes. These include the World Wide Web, Internet Traffic and Telephone Call Detail. These data sets sheer volume brings with it a series of computational and visualization challenges due mainly to the I/O and Screen Bottlenecks.

We present external more

February 24, 2003

Full Abstraction for Object-Based Languages

Alan Jeffrey, DePaul University

Co-Sponsored by Laboratory for Secure Systems and New Jersey Institute for Trustworthy Enterprise Software.

February 20, 2003

Multiset Rewriting and Security Protocol Analysis

Andre Scedrov, University of Pennsylvania

The Dolev-Yao model of security protocol analysis may be formalized using a notation based on multiset rewriting with existential quantification. In this setting protocol execution is carried out symbolically as a form of rewriting. Basic assumptions of this formalization, perfect cryptography coupled with nondeterministic computation on the part of the adversary, provide an idealized setting in which protocol analysis becomes relatively tract more

February 19, 2003

Axiomatizing Regular Words

Fixed point equations in words have been used to express the behavior of hardware and software. For example, the equation   x = a b x (1) describes the behavior of a device capable of performing the 'action' a, followed by the action b, forever.

In 1978, Courcelle showed that (initial) solutions certain systems of finite fixed point equations in words could be expressed by regular expressions formed from letters in a fixed alphabet using word operations of concatena more

For more information please contact:

Stephen Bloom
Room 301
Phone: 201.216.5439
Fax: 201.216.8249

February 3, 2003

Authenticated Traversal

Carl Gunter, University of Pennsylvania

In establishing a connection between a client and server it is common for one or more elements on the communication path to review and approve or reject the connection request. Firewalls, routing gateways, access points, and proxies often act as such security gateways. When it is necessary to establish an encrypted channel, it is often desirable to obtain authorization for the communication request at security gateways without breaking end-to-end confi more

January 27, 2003

Forces, Points, and Surfaces

This talk is focused on two basic computer vision problems: to what extent can we determine a surface and its properties from the surface normals (the Gauss map) and how to deal with the noise and lack of precision which seem to be inherently present in all current computer vision methods for extracting data about the Gauss map.

We will present a new theoretical method and experimental results for direct recovery of the principal shape descriptors (the curvatures and the principal curvature more

For more information please contact:

George Kamberov
Associate Research Professor
Room 613
Phone: 201.216.5486
Fax: 201.216.8249

My last

January 13, 2003

The Universal Automaton of a Language

Jacques Sakarovitch, CNRS/ENST, Paris, France

It is common knowledge that to every (formal) language L, that is to any subset of a free monoid, is canonically associated a minimal (deterministic) automaton, which is, as its name indicates, the smallest deterministic automaton that recognizes L and has also the property that any deterministic automaton recognizing L is homomorphically mapped onto it. The minimal automaton of L is finite iff L is regular, its transition monoid is the sy more

Stevens CS

gray gray Share/Save/Bookmark

Daniel Duchamp
Research Professor & Department Director
Room 313
Phone: 201.216.5390
Fax: 201.216.8249

Dawn Garcia
Administrative Assistant
Room 317
Phone: 201.216.5578
Fax: 201.216.8249

Sherry Dorso
Assistant to the Director
Lieb 317
Phone: 201.216.5328
Fax: 201.216.8249

Stevens CS
Stevens CS Stevens CS Stevens CS
View my Iframe Content