Select a calendar:

Filter April Events by Event Type:

• Conferences, Lectures, & Seminars (51)
• Student Activity (8)
• Workshops & Infosessions (23)
• University Calendar (10)
• Receptions & Special Events (2)

Events for April 22, 2008

• Apr

  22

  East Los Angeles College

  Tue, Apr 22, 2008 @ 10:00 AM - 01:00 PM

  Viterbi School of Engineering Undergraduate Admission

  Receptions & Special Events

  
  

  Students interested in transferring to USC's Viterbi School of Engineering can explore Viterbi's programs and majors, learn about the application process, and speak directly with a Viterbi transfer advisor at ELAC's Transfer Fair.

  Location: East Los Angeles

  Audiences: Prospective Transfer Students

  Contact: Christine Hsieh

  

• Apr

  22

  CS Colloq: Simple Encryption Schemes Against Sophisticated Attacks

  Tue, Apr 22, 2008 @ 03:30 PM - 05:00 PM

  Thomas Lord Department of Computer Science

  Conferences, Lectures, & Seminars

  
  

  Title: Simple Encryption Schemes Against Sophisticated AttacksSpeaker: Dr. Hoeteck Wee (Columbia)Abstract:
  Along with the increasing reliance on computers and the Internet for myriad tasks from voting to auctions evolves a pressing need to develop cryptographic tools and protocols with stronger guarantees. Traditional cryptographic guarantees such as data privacy amidst wiretapping and security against a static collection of malicious network entities do not meet the security requirements for many of these tasks: -- An adversary may be unable to learn your bid in an online auction if the bid is encrypted; however, it could potentially modify the ciphertext to obtain one corresponding to a bid that is a dollar higher than yours. -- An adversary that adaptively determines which electronic voting machines to break into during the course of an election has a better chance at influencing the outcome of an election than one that makes its choices before the election commences. I will present new constructions of encryption schemes addressing each of these attacks. The first scheme guarantees that given an encryption of a message, it is infeasible to generate an encryption of a related message. The second improves upon an important building block used in constructing protocols for general multi-party computation that are secure against an adversary that adaptively corrupts up to one third of the parties. Compared to most previous constructions, our schemes are simpler, more efficient, and can be realized under a larger class of cryptographic assumptions.Biography:
  Hoeteck Wee is a postdoctoral researcher at Columbia University. He completed his undergraduate studies at MIT and his PhD at UC Berkeley under the supervision of Luca Trevisan. He was a visiting student at Tsinghua University (Beijing) from Aug 2005 till Jun 2006, a core participant in the program on Securing Cyberspace at IPAM (UCLA) in Fall 2006, and a (one-time photographic) contributor to the Schmap Amsterdam Guide.

  Location: Seaver Science Library (SSL) - 150

  Audiences: Everyone Is Invited

  Contact: CS Colloquia