RSA Conference Brochure 2008

cryptographErs tuEsday, april 8 1:30 p.m. – 2:40 p.m. CrYP-105 WEdnEsday, april 9 8:00 a.m. – 8:50 a.m. CrYP-201 (M) Program Obfuscation Shafi Goldwasser | RSA Professor of Computer Science, Massachusetts Institute of Technology, and Professor of Computer Science and Applied Mathematics, Weizmann Institute of Science (T2) improved AES implementations Robert Koenighofer | Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology Stefan Tillich | Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology Program obfuscation is the process of taking a program as an input and modifying it so the resulting program has the same input/output behavior as the input program but otherwise looks ‘garbled’ to the entity that runs it — even if this entity is adversarial and has full access to the program. This session will examine the results of program obfuscation in various models and for different applications. 3:00 p.m. – 3:50 p.m. CrYP-106 This session presents improved AES implementations. The first talk presents an extension allowing to boost AES performance on an 8-bit microprocessor architecture. The second talk presents a bitslice AES implementation that is resistant to cache-based side-channel attacks. TOPIC 1: Boosting AES Performance on a Tiny Processor Core TOPIC 2: A Fast and Cache-Timing Resistant Implementation of the AES (M) Cryptographic Building Blocks Dr. Emmanuel Bresson | Senior Expert, DCSSI Crypto Lab Andrew Y. Lindell | Chief Cryptographer and Assistant Professor, Aladdin Knowledge Systems and Bar-Ilan University 9:10 a.m. – 10:20 a.m. CrYP-202 (M) Fairness in Secure Computation Qiong Huang | City University of Hong Kong Mehmet S. Kiraz | Technical University of Eindhoven Andrew Y. Lindell | Chief Cryptographer and Assistant Professor, Aladdin Knowledge Systems and Bar-Ilan University This session will present results on the theoretical foundations for cryptographic primitives and assumptions. The first talk presents an efficient and secure oblivious transfer protocol, while the second talk studies the computational hierarchy of a large class of algebraic problems. TOPIC 1: Efficient Fully-Simulatable Oblivious Transfer TOPIC 2: Separation Results on the “One-More’’ Computational Problems 4:10 p.m. – 5:20 p.m. CrYP-107 This session presents results regarding fairness in two-party and multi-party secure computation and signature scheme exchange. This panel will provide better protocols with stronger security proofs, as well as techniques for using existing signature-based legal infrastructure to enforce fairness in general computations. TOPIC 1: An Efficient Protocol for Fair Secure Two-Party Computation TOPIC 2: Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-key Model without Random Oracles TOPIC 3: Legally Enforceable Fairness in Secure Multiparty Computation (M) Hash Function Cryptanalysis Praveen Gauravaram | Post-doctoral Research Fellow, Department of Mathematics (MAT), Technical University of Denmark (DTU) Gaëtan Leurent | École Normale Supérieure Yu Sasaki | NTT Information Sharing Platform Laboratories, NTT Corporation This session will present new cryptanalytic techniques for attacking several types of commonly used hash functions. TOPIC 1: Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack TOPIC 2: Cryptanalysis of a Hash Function Based on Quasi-Cyclic Codes TOPIC 3: Cryptanalysis of a Class of Cryptographic Hash Functions 5:40 p.m. – 6:30 p.m. CRYp-108 (M) Message Authentication Codes Marc Fischlin | Head of Emmy Noether Research Group “Minicrypt,” Darmstadt University of Technology Andrew Y. Lindell | Chief Cryptographer and Assistant Professor, Aladdin Knowledge Systems and Bar-Ilan University This session studies provable secure message authentication codes, including a new proof of security for NMAC and HMAC, and a new simple method to aggregate multiple MAC tags into one. TOPIC 1: Security of NMAC and HMAC based on Non-Malleability TOPIC 2: Aggregate Message Authentication Codes 20 sEssion classification (M) Mathematic Concepts & Principles (T2) Intermediate Technical See page 5 for complete level descriptions.

Table of Contents Feed for the Digital Edition of RSA Conference Brochure 2008

Table of Contents Who Should Attend & Why Keynote Speakers Agenda At-A-Glance Session Classification Special Events & Activities Connect & Network Highlights 1-Day Pre-Conference Tutorials 2-Day Pre-Conference Tutorials Tracks & Sessions Authentication Consumer Protection Business Trends & Impact Case Studies Cryptographers Deployment Strategies Developing with Security Enterprise Defense Hackers & Threats 1 Hackers & Threats 2 Identity & Access Management Industry Experts Law & Liability Policy & Government Professional Development Security-Oriented Architecture Standards Wireless Sponsor Sessions List of Exhibitors Registration Information Sponsors

For optimal viewing of this digital publication, please enable JavaScript and then refresh the page. If you would like to try to load the digital publication without using Flash Player detection, please click here.