1 / 1

教育部提昇大學國際競爭力計畫專題演講

教育部提昇大學國際競爭力計畫專題演講. Dr. Doug Tygar (Professor of Computer Science and Information Management, University of California, Berkeley). 第一場專題演講: First technical talk-- “Distillation codes, Multicast, and Denial of Service”. 時間:12月23日(二) PM1:30~3:00 工程三館427室 EC427 參加對象:全體師生

chakra
Download Presentation

教育部提昇大學國際競爭力計畫專題演講

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 教育部提昇大學國際競爭力計畫專題演講 Dr. Doug Tygar (Professor of Computer Science and Information Management, University of California, Berkeley) 第一場專題演講:First technical talk-- “Distillation codes, Multicast, and Denial of Service” 時間:12月23日(二) PM1:30~3:00 工程三館427室EC427 參加對象:全體師生 摘要:I introduce distillation codes, a method for streaming and storing data. Like erasure codes, distillation codes allow information to be decoded from a sufficiently large quorum of symbols. In contrast to erasure codes, distillation codes are robust against pollution attacks, a powerful class of denial of service (DoS) attacks in which adversaries inject invalid symbols during the decoding process. I examine applications of distillation codes to multicast authentication. Previous applications of erasure codes to multicast authentication are vulnerable to low bandwidth pollution attacks. W demonstrate pollution attacks against previous approaches which prevent receivers from verifying any authentic packets. To resist pollution attacks, we introduce Pollution Resistant Authenticated Block Streams, which have low overhead and can tolerate arbitrary patterns of packet loss within a block up to a predetermined number of packets. In the face of 40Mb/s of attack traffic, PRABS receivers successfully authenticate the stream and consume only 10% of their CPU.  More information on distillation codes can be found at http://www.cs.berkeley.edu/~nks/edec/ .  This is joint work with Chris Karloff, Yaping Li, Adrian Perrig, and Naveen Sastry. 時間:12月25日(四) AM10:10~12:00 電資中心國際會議廳 參加對象:全體師生 摘要:Two organizations want to share common members of their database, without revealing any of their private members.  I introduce private matching and discuss a powerful set of techniques for performing these operations.  I also analyze previous approaches to this problem and discuss their shortcomings.  This is joint work with Joe Hellerstein and Yaping Li. 時間:12月25日(四) PM2:00 工程三館427室EC427 參加對象:教授 聯絡人:謝續平教授 Prof. Shiuhpyng Shieh 分機31876、54705 第二場專題演講:(1) Second technical talk-- “Private matching” (2) Introduction to graduate study at UC Berkeley audience 第三場專題演講:Introduction to current research at EECS, UC Berkeley

More Related