3. ICITS 2008: Calgary, Canada

Secure and Reliable Communication I

• Juan A. Garay:
  Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk). 1
  
• Toshinori Araki:
  Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption. 2-13
  

Quantum Information and Communication

• Claude Crépeau, Joe Kilian, George Savvides:
  Interactive Hashing: An Information Theoretic Tool (Invited Talk). 14-28
  
• Travis R. Beals, Barry C. Sanders:
  Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network. 29-39
  

Networks and Devices

• João Barros, Matthieu Bloch:
  Strong Secrecy for Wireless Channels (Invited Talk). 40-53
  
• Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
  Efficient Key Predistribution for Grid-Based Wireless Sensor Networks. 54-69
  
• François-Xavier Standaert, Tal Malkin, Moti Yung:
  Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk). 70
  

Mulitparty Computation

• Hugue Blier, Alain Tapp:
  A Single Initialization Server for Multi-party Cryptography. 71-85
  
• Claude Crépeau, Jürg Wullschleger:
  Statistical Security Conditions for Two-Party Secure Function Evaluation. 86-99
  

Information Hiding and Tracing

• Michael J. Collins:
  Upper Bounds for Set Systems with the Identifiable Parent Property. 100-106
  

Coding Theory and Security

• Rafael Dowsley, Jeroen van de Graaf, Jörn Müller-Quade, Anderson C. A. Nascimento:
  Oblivious Transfer Based on the McEliece Assumptions. 107-117
  
• Venkatesan Guruswami:
  List Error-Correction with Optimal Information Rate (Invited Talk). 118-119
  

Quantum Computation

• Norbert Lütkenhaus:
  Theory of Quantum Key Distribution: The Road Ahead (Invited Talk). 120
  
• Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
  Susceptible Two-Party Quantum Computations. 121-136
  

Secure and Reliable Communication II

• Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan:
  Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. 137-155
  
• Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
  Key Refreshing in Wireless Sensor Networks. 156-170
  
• Olivier Billet, Duong Hieu Phan:
  Efficient Traitor Tracing from Collusion Secure Codes. 171-182
  

Foundation

• Yvo Desmedt, Brian King, Berry Schoenmakers:
  Revisiting the Karnin, Greene and Hellman Bounds. 183-198
  
• Kaoru Kurosawa, Takeshi Koshiba:
  Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification. 199-209
  
• Thomas Baignères, Serge Vaudenay:
  The Complexity of Distinguishing Distributions (Invited Talk). 210-222
  

Encryption

• Goichiro Hanaoka:
  Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk). 223-231
  
• Jacques Patarin:
  A Proof of Security in O(2n) for the Xor of Two Random Permutations. 232-248