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 13, 2004

Failure and Fault-Tolerance in a Distributed Pi-calculus

Adrian Francalanza, University of Sussex

In this talk I present the behavioural study of distributed programs in the presence of location failure. I develop a distributed pi-calculus called DpiF, where the terms are configurations with network state information. Two novel constructs in this language are a kill constuct that changes the state of a location during reduction and a synchronous move between locations that can be used as a "ping" to determine the current state of more

December 6, 2004

Illumination and Human Faces

Dimitris Samaras, SUNY Stony Brook

Illumination effects in images complicate greatly main Computer Vision tasks such as, 3D Shape Reconstruction or Face Recognition. They are also both a cause of unwanted artifacts and a source of realism in Image Based Rendering. Another area of interest both in Graphics and in Vision is modeling and analysis of human faces. We will discuss recent results in the intersection of these two areas. We will discuss a new approach for face recognition unde more

November 29, 2004

Secure Hashed Diffie-Hellman over Non-DDH Groups

Tal Rabin, IBM T.J. Watson

It is generally accepted that for securing common applications of Diffie-Hellman (DH), such as key exchange and encryption, one needs to ensure that the group over which the DH is computed satisfies the Decisional Diffie-Hellman (DDH) assumption. Motivated by practical considerations, we study a relaxation of this basic premise.

We show that the requirement to work over DDH groups (that is, groups that satisfy the DDH assumption) can be relaxed to th more

November 22, 2004

Suggestive Contours for Conveying Shape in Computer-Generated Line Drawings

Szymon Rusinkiewicz, Princeton University

The artform of line drawings is a dramatically efficient mechanism for conveying an idea of shape with minimal visual input. This talk describes a nonphotorealistic rendering system that generates line drawings automatically from 3D models. We introduce the suggestive contour, a new type of line that is drawn at certain types of view-dependent inflections of the surface. Suggestive contours have several provably equivalent definitions, including one th more

November 15, 2004

Performance Management of 802.11 Wireless LANs

Yigal Bejerano, Lucent Technologies - Bell Labs

In recent years, IEEE 802.11 wireless LANs (WLANs) have been rapidly deployed all over the world. In the U.S. alone, several companies, such as SBC and T-mobile, plan to build nationwide WLAN networks. Recently, Philadelphia, San Francisco as well as other cites announced their intention to deploy citywide WLANs with thousands of access-points. Additionally, equipment vendors such as Cisco and SpectraLink have introduced 802.11 phones ai more

November 1, 2004

Digital Rights Management

Tomas Sander, HP Labs

This talk will explore technical aspects of the design of digital rights management (DRM) systems, mixing two points of view. First, viewing the task top-down, we will consider the overall architecture of a DRM system, emphasizing clear statements of the aims of the particular system. We will particularly pay attention to the security aspects of DRM systems. Second, bottom-up, we will consider many of the technical tools that can be used in building a DRM system, in more

October 25, 2004

First-order Verification of Cryptographic Protocols

Ernie Cohen, Microsoft

I'll describe a verification method for cryptographic protocols, based on first-order invariants. For typical protocols, a suitable invariant can be generated automatically from the protocol text, allowing safety properties to be established with ordinary first-order reasoning.

The method has been implemented in an automatic verifier, TAPS, that has verified properties of over 100 protocols; typical toy protocols require less than a second of CPU time and more

October 18, 2004

A Bit of Butter (What Could Be Better Than Sliced Bread?): The Spec# Programming System

Michael Barnett, Microsoft

Spec# is the latest in a long line of work on programming languages and systems aimed at improving the development of correct software. The Spec# programming system consists of the object-oriented Spec# programming language, the Spec# compiler, and the Boogie static program verifier. The language includes constructs for writing specifications that capture programmer intentions about how methods and data are to be used, the compiler emits run-time checks to enforc more

October 13, 2004

Defending Against Online Identity Theft and Phishing

Dan Boneh, Stanford University

Web spoofing (a.k.a phishing) is a significant problem involving fraudulent email and web sites that trick unsuspecting users into revealing private information. In this talk we will describe several browser plug-ins that help protect users from such attacks. One such plug-in, SpoofGuard, examines web pages and warns the user when form data may be part of a spoof attack. Another plug-in helps protect user passwords.

Joint work with John Mitche more

October 4, 2004

Non-Linear Issues in Computational Geometry

Thorsten Theobald, Yale University

The aim of this talk is to exhibit some classes of natural problems from computational geometry whose algorithmic treatment leads to fundamental polynomial problems of high degree. The initial problems include visibility computations with moving viewpoints in 3-space or the computation of smallest enclosing cylinders of polytopes. These problems lead to enumerative questions concerning the lines simultaneously tangent to given bodies. In particular, w more

September 24, 2004

Functional Reactivity: Eschewing the Imperative

Henrik Nilsson University of Nottingham

Functional Reactive Programming (FRP) is a paradigm for reactive programming in a pure functional setting. FRP originated in work on Functional Reactive Animation (Fran), and has since evolved in a number of different directions and into a number of different concrete implementations. FRP share many features with, on the one hand, synchronous languages, like Esterel and Lucid Synchrone, and, on the other, languages for modelling and simulation, like Simulink more

September 21, 2004

Verifiable Distributed Oblivous Transfer and Mobile Agent Security

Sheng Zhong, Stevens Institute of Technology

In mobile agent computation, we consider how to protect the privacy of the agent originator against the hosts, and the privacy of each host against the originator and all other hosts. We also want to ensure that the computation task is completed correctly. Based on a previously proposed solution framework in [ACCK01], we can achieve the above goals under a threshold trust assumption. The key component of our solution is a new cryptographic pr more

September 20, 2004

The Real-World Process of Creating Visual Effects

Dennis Skotak, Freelance Visual Effects Supervisor

Visual effects has been used in the film industry long before computer graphics became prevalent. The process of creating a believable visual effect entails much more than the latest research and technology. In this talk, I will describe the issues and problems encountered in creating visual effects for movies from the perspective of a visual effects supervisor. Factors that affect the process include issues of technology trans more

September 17, 2004

Fine-Grained Access Control for Mobile Computing

Nobuko Yoshida, Imperial College London

In wide area distributed systems it is now common for higher-order code to be transferred from one domain to another; the receiving host may initialise parameters and then execute the code in its local environment. This talks gives an overview of our studies on a fine-grained typing system for a higher-order pi-calculus [LICS00,I&C02,POPL04] which can be used to control the effect of such migrating code on local environments. Processes may be more

September 17, 2004

From Process Logics to Program Logics

Kohei Honda, Queen Mary University of London

This talk discusses how one can derive a compositional program logic for higher-order programming languages from a compositional logic for typed pi-calculi.

Built on the preceding studies on logics for programs and processes, simple systems of assertions are developed, capturing the classes of behaviours ranging from pure higher-order functions to those with destructive update, local state and polymorphism.

A ce more

September 13, 2004

ForNet: A Network Forensics System

Nasir Memon, Polytechnic University

In this talk we introduce ForNet, a distributed network logging mechanism to aid digital forensics over wide area networks. We describe the need for such a system, review related work, present the architecture of the system, and discuss key research issues. We then describe the design and implementation of a prototype system that processes packets in a network and is able to attribute query payloads to source and destination hosts in the local network. I more

May 5, 2004

Level Set Models for Computer Graphics

David Breen, Drexel University

A level set model is a deformable implicit surface that has a volumetric representation. It is defined as an iso-surface, i.e. a level set, of some implicit function \phi. The surface is deformed by solving a partial differential equation on a regular sampling of \phi, a volume dataset. Level set methods provide the techniques needed to change the voxel values of the volume in a way that evolves the embedded iso-surface to meet a user-defined goal. Deforming more

May 3, 2004

Synthesis of Generalized Ring Protocols Using Concepts of Special Relativity Theory

Mark-Oliver Stehr, University of Illinois at Urbana-Champaign

The design of reliable multicasting protocols that are scalable with respect to the number of participants and make efficient use of the available communication resources is a challenge that has been raised especially by the progress in wireless network technology and the increasing importance of collaborative computing applications.

In this talk we explore a dimension in the design space of protocols for reliable gro more

April 26, 2004

The C-word: How social pressure is compromising our software systems' security and reliability

Andrew Koenig

Because programming languages are a major part of the intellectual interface between programmers and the systems they create, there is strong social pressure on programming-language designers to stay compatible with past usage. This pressure for compatibility results in systems that are much less reliable and secure than they need to be.

This talk will show some examples of such problems more

April 19, 2004

Theoretical Cryptography in the Real World

Phil Mackenzie, Lucent Bell Laboratories

This talk is actually a combination of two talks, both with the same title! The "first" talk shows how to construct real world physical examples of basic concepts in theoretical cryptography, such as commitments and zero-knowledge proofs. These involve easily constructed props and interaction with the audience, and would be suitable for teaching those with no prior background in cryptography. The "second" talk takes the basic conc more

April 12, 2004

R&D of Powdery-type Foundation: Creating a Natural and Beautiful Complexion

Takanori Igarashi, Kao Corporation and Columbia University

The purpose of this study is to create a natural and beautiful complexion with "foundation (cosmetic products)". We have been researching and developing foundation in order to satisfy the aesthetic demands of Japanese women. Foundation is extensively used to conceal flaws and imperfections in the skin. However, recently a greater demand in the cosmetic industry has been for foundation that additionally gives "natu more

April 7, 2004

Fairplay -- A Secure Two-Party Computation System

Yaron Sella, Hebrew University of Jerusalem

Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure two-party computation a realistic paradigm. Yet, thus far, interest in this paradigm has remained mostly theoretical.

In this talk, I will present Fairplay, a full-fledged system that implements generic secure function evaluation (SFE). Fairplay comprises a high level procedural definition language called SFDL tailored to the more

April 7, 2004

Voxel-Based Carving Algorithms: Using Silhouettes, Color, and Motion to Reconstruct Visual Scenes

Greg Slabaugh Siemens Corporate Research

Given a set of photographs/videos of a visual scene taken by calibrated cameras positioned at arbitrary viewpoints, how can one reconstruct the geometry of the scene? If objects in the scene move, how can their 3D motion be reconstructed as well?

This presentation reviews several voxel-based carving algorithms designed to solve these problems. Similar to how a sculptor would chip away at a block of marble to produce a 3D shape, a vo more

April 5, 2004

Algorithmic Tamper-Proof Security

Tal Malkin, Columbia University

Traditionally, secure cryptographic algorithms provide security against an adversary who has only black-box access to the secret information of honest parties. However, such models are not always adequate. In particular, the security of these algorithms may completely break under (feasible) attacks that tamper with the secret key.

We propose a theoretical framework to investigate the algorithmic aspects related to tamper-proof security. In pa more

March 29, 2004

A Proposal for Re-Envigorating the Use of Formal Methods in Industry

Edward Amoroso, AT&T

This presentation will outline a proposed strategy for re-invigorating the use of formal methods for large-scale software development efforts. Specifically, management steps are outlined for how formal methods might be used to address the growing problem of software bugs, security vulnerabilities, and the myriad of uncertainties that result from outsourced code development efforts.

Co-sponsored by Laboratory for Secure Syste more

March 26, 2004

3rd Annual Stevens Cybersecurity Symposium

8:30-9:15 Registration and breakfast  

9:15 Opening remarks 9:30-10:30 Keynote talk: Cybersecurity and Its Limitations. Andrew Odlyzko, University of Minnesota Digital Technology Center.

Abstract: Network security is terrible, and we are constantly threatened with the prospect of imminent doom. Yet such warnings have been common for the last two decades. In spite of that, t more

March 22, 2004

Nonrigid Motion Analysis Research and Applications

Chandra Kambhamettu, University of Delaware

This talk will concentrate on our nonrigid motion analysis research with emphasis on medical, bioinformatics and remote sensing applications.

We first present two novel frameworks for the deformable contour formulation: spatiotemporal analysis formulation, and multiple snakes formulation. Our spatiotemporal formulation has been successfully applied to track tongue and heart wall boundaries from ultrasound imagery. Multiple snake f more

March 8, 2004

Secure Handover Procedures in Heterogeneous Wireless Networks

Ulrike Meyer, Technische Universität Darmstadt, Germany

In wireless networks like UMTS or WLAN a mobile station is connected to a point of network access over a radio link. A handover is a mechanism by which an ongoing connection between a mobile station and a correspondent node is transfered from one point of network access to an other. If the two points of access use different networking technologies, the hanodver is called vertical or heterogeneous, else horizontal or homogeneous. more

March 1, 2004

Finding Unusual Activity in Video

Jianbo Shi, University of Pennsylvania

Imagine you are given a long video, possibly thousands of hours long, and you are asked to analyze the video to detect unusual events. This situation arises in applications such as video surveillance, health care monitoring, and biometric human identification. Humans can extract essential characteristics of video events relatively quickly and easily. How to quantify this process in a computable form is an open problem, and at the first glance is more

February 27, 2004

NJ Programming Languages and Systems Seminar

February 23, 2004

The Robustness of the Sum-of-Squares Algorithm for Bin Packing

Geetha Jagannathan, Stevens Institute of Technology

Csirik et al., introduced the sum-of-squares algorithm (SS) for online bin packing of integral-sized items into integral-sized bins. They showed that for discrete distributions, whenever the expected waste of optimal is sublinear, the expected waste of SS is also sublinear. This algorithm SS has a time complexity of O(nB) to pack n items into bins of size B.

I will present results that demonstrate the robustness of the sum-of-sq more

February 19, 2004

Managing Resources in Extensible Networks

Sumi Choi, Washington University

Programmable networks allow easy configuration of resources for applications in a networked environment. Using programmable networks, an application can be designed to install and run its customized program module on remote network nodes such as routers. For example, programmable networks would enable easy design of a secure transmission application that allows data coming from an end device to be encrypted before it leaves the sender's domain and decry more

February 2, 2004

Group Signatures Mean Privacy

Breno de Medeiros, Johns Hopkins University

The potential harm to privacy stemming from the use of data processing systems has been understood since computers were first applied to organize personal information. David Chaum's seminal paper demonstrated the potential of cryptographic protocols to provide services such as user authentication and resource control while maintaining anonymity, reducing the need to distribute personal information or user passwords to remote servers. In 199 more

January 26, 2004

Multi-trapdoor Commitments and their Applications to Proofs of Knowledge Secure under Concurrent Man-in-the-middle Attacks

Rosario Gennaro, IBM T. J. Watson Research Center

We introduce the notion of multi-trapdoor commitments which is a stronger form of trapdoor commitment schemes. We then construct a very efficient instantiation of a multi-trapdoor commitment scheme, based on the Strong RSA Assumption.

The main application of our result is the construction of a compiler that takes any proof of knowledge and transforms it into one which is secure against a concurrent man-in-the-middle attack. 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