Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Theory of Cryptography Conference 2004: Preliminary Program ------------------------------------------------------------- The First Theory of Cryptography Conference MIT, Cambridge MA, USA February 19-21 2004 Program Committee Chair: Moni Naor, Weizmann Institute General Chair: Shafi Goldwasser, MIT and Weizmann Institute Web page of the conference: http://www.wisdom.weizmann.ac.il/~tcc/tcc04 TCC Preliminary Program ======================= Wednesday Feb. 18 2004 6:00-8:00 PM Reception at Radcliffe Thursday, Feb. 19 2004 ====================== 9:00am-10:00am Welcome and Registration SESSION 1: 10:00am-12:00pm Session Chair: Joe Kilian Notions of Reducibility between Cryptographic Primitives by Omer Reingold, Luca Trevisan and Salil Vadhan Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology by Ueli Maurer, Renato Renner and Clemens Holenstein On the random-oracle methodology as applied to length-restricted signature schemes by Ran Canetti, Oded Goldreich and Shai Halevi Universally Composable Commitments Using Random Oracles by Dennis Hofheinz and Joern Mueller-Quade LUNCH BREAK 12:00pm-2:00pm (catered lunch) SESSION 2 2:00pm-3:30pm Session Chair: Yuval Ishai Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes by Shafi Goldwasser and Erez Waisbard List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument by Cynthia Dwork, Ronen Shaltiel, Adam Smith and Luca Trevisan On the Possibility of One Message Weak Zero-Knowledge by Boaz Barak and Rafael Pass COFFEE BREAK 3:30pm-4:00pm SESSION 3 4:00pm-5:30pm Session Chair: Ronald Cramer Soundness of formal encryption in the presence of active adversaries by Daniele Micciancio and Bogdan Warinschi Rerandomizable and Replayable Adaptive Chosen Ciphertext Secure Cryptosystems by Jens Groth Alternatives to Non-Malleability: Definitions, Constructions and Applications by Philip MacKenzie, Michael K. Reiter and Ke Yang Evening program: Business Meeting/Rump session 8:00pm-10:00pm (at Hotel at MIT) Friday Feb. 20 2004 ==================== SESSION 4 9:00am-10:30am Session Chair: Birgit Pfitzmann A note on Constant-Round Zero-Knowledge Proofs for NP by Alon Rosen Lower Bounds for Concurrent Self Composition by Yehuda Lindell Secret-Key Zero-Knowledge and Non-Interactive Verifiable Exponentiation by Ronald Cramer and Ivan Damgard COFFEE BREAK 10:30am-11:00am SESSION 5 11:00am-12:30pm Session Chair: Ran Canetti A Quantitative Approach to Reductions in Secure Computation by Amos Beimel and Tal Malkin Tamper Proof Security: Theoretical Foundations for Security Against Hardware Tampering by Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali and Tal Rabin Physically Observable Cryptography by Silvio Micali and Leonid Reyzin LUNCH BREAK 12:30pm-2:00pm (lunch NOT provided) SESSION 6 14:00pm-15:30pm Session Chair: Salil Vadhan Efficient and Universally Composable Committed Oblivious Transfer and Applications by Juan A. Garay, Philip MacKenzie and Ke Yang A Universally Composable Mix-Net by Douglas Wikström A General Composition Theorem for Secure Reactive Systems by Michael Backes, Birgit Pfitzmann and Michael Waidner COFFEE BREAK 3:30pm-4:00pm PANEL 4:00pm-5:30pm Moderator: Cynthia Dwork Subject: Cryptography and Formal Methods Saturday Feb. 21 2004 ===================== SESSION 7 9:00am-10:30am Session Chair: Omer Reingold Unfair Noisy Channels and Oblivious Transfer by Ivan Damgaard, Serge Fehr, Kirill Morozov and Louis Salvail Computational Collapse of Quantum State and Its Application to Oblivious Transfer by Claude Crepeau, Paul Dumais, Dominic Mayers and Louis Salvail Implementing Oblivious Transfer using collection of dense trapdoor permutations by Iftach Haitner COFFEE BREAK 10:30am-11:00am SESSION 8 11:00am-12:30pm Session Chair: Philip MacKenzie Composition of Random Systems: Sometimes Two Weak Make One Strong by Ueli Maurer and Krzysztof Pietrzak Simpler session-key generation from short random passwords by Minh-Huyen Nguyen and Salil Vadhan Constant-Round Oblivious Transfer in the Bounded Storage Model by Yan Zong Ding, Danny Harnik, Alon Rosen and Ronen Shaltiel LUNCH BREAK 12:30pm-2:00pm (catered lunch) SESSION 9 2:00pm-3:30pm Session Chair: Daniele Micciancio Hierarchical Threshold Secret Sharing by Tamir Tassa On Compressing Encrypted Data Without the Encryption Key by Mark Johnson, David Wagner and Kannan Ramchandran On the Notion of Pseudo-Free Groups by Ronald L. Rivest Farewell