RSA Conference 2006, Cryptographers' Track

February 13 - 17, 2006, McEnery Convention Center, San Jose, USA

Final Program

Call for Papers

	Tuesday February 14
2:00-2:10	Opening	David Pointcheval
2:10-3:10	Attacks on AES	David Pointcheval
2:10	Cache Attacks and Countermeasures: the Case of AES	Eran Tromer
2:40	Related-Key Impossible Differential Attacks on 8-Round AES-192	Orr Dunkelman
3:25-4:15	Identification	Anand Desai
3:25	Session Corruption Attack and Improvements on Encryption Based MT-Authenticators	Duncan S. Wong
3:50	Fair Identification	Omkant Pandey
4:30-5:20	Invited Speaker	Burt Kaliski
4:30-5:20	Cryptanalysis of Hash functions and Potential Dangers	Xiaoyun Wang
5:35-6:00	Algebra	Arjen Lenstra
5:35	Another Look at Small RSA Exponents	Jason Hinek
	Wednesday February 15
2:00-3:10	Integrity	Ron Rivest
2:00	Collision-Resistant usage of MD5 and SHA-1 via Message Preprocessing	Michael Szydlo
2:35	RFID-Tags for Anti-Counterfeiting	Pim Tuyls
3:25-4:35	Public Key Encryption	Daniel Bailey
3:25	A "Medium-Field" Multivariate Public-Key Encryption Scheme	Bo-Yin Yang
4:00	A New Security Proof for Damgård's ElGamal	Kristian Gjøsteen
4:50-6:00	Signatures	Pil Joong Lee
4:50	Stand-alone and Setup-free Verifiably Committed Signatures	Huafei Zhu
5:25	Toward the Fair Anonymous Signatures: Deniable Ring Signatures	Yuichi Komano
	Thursday February 16
2:00-3:10	Side-Channel Attacks	Adi Shamir
2:00	Practical Second-Order DPA Attacks for Masked Smart Card Implementations	Elisabeth Oswald
2:35	Higher Order Masking of the AES	Kai Schramm
3:25-4:35	CCA Encryption	Kazue Sako
3:25	Chosen Ciphertext Secure Public Key Threshold Encryption w/o Random Oracles	Xavier Boyen
4:00	How to Construct Multicast Cryptosystems Provably IND-CCA2 Secure	Yitao Duan
4:50-5:40	Message Authentication	Xavier Boyen
4:50	On the (Im)possibility of Blind Message Authentication Codes	Gregory Neven
5:15	An Optimal Non-Interactive Message Authentication Protocol	Sylvain Pasini
	Friday February 17
9:00-9:50	Invited Speaker	David Pointcheval
9:00-9:50	Passwords Will Not Die: How Cryptography Can Help Deal with Them	Philip MacKenzie
10:05-10:55	Block Ciphers	Masayuki Abe
10:05	A New Criterion for Nonlinearity of Block Ciphers	Orr Dunkelman
10:30	Block ciphers sensitive to Groebner Basis Attacks	Ralf-Philipp Weinmann
11:10-12:00	Multi-Party Computation	Jean-Jacques Quisquater
11:10	Universally Composable Oblivious Transfer in the Multi-Party Setting	Marc Fischlin
11:35	A Round and Communication Efficient Secure Ranking Protocol	Shaoquan Jiang