Juan A. Garay (auth.), Reihaneh Safavi-Naini (eds.)3540850929, 9783540850922
This book constitutes the proceedings of the Third International Conference on Information Theoretic Security, held in Calgary, Canada, in August 2008.
The 14 papers presented in this volume were carefully reviewed and selected from 43 submissions. There were nine invited speeches to the conference. The topics covered are secure and reliable communication; quantum information and communication; networks and devices; multiparty computation; information hiding and tracing; coding theory and security; quantum computation; foundation; and encryption.
Table of contents :
Front Matter….Pages –
Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk)….Pages 1-1
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption….Pages 2-13
Interactive Hashing: An Information Theoretic Tool (Invited Talk)….Pages 14-28
Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network….Pages 29-39
Strong Secrecy for Wireless Channels (Invited Talk)….Pages 40-53
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks….Pages 54-69
Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk)….Pages 70-70
A Single Initialization Server for Multi-party Cryptography….Pages 71-85
Statistical Security Conditions for Two-Party Secure Function Evaluation….Pages 86-99
Upper Bounds for Set Systems with the Identifiable Parent Property….Pages 100-106
Oblivious Transfer Based on the McEliece Assumptions….Pages 107-117
List Error-Correction with Optimal Information Rate (Invited Talk)….Pages 118-119
Theory of Quantum Key Distribution: The Road Ahead (Invited Talk)….Pages 120-120
Susceptible Two-Party Quantum Computations….Pages 121-136
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary….Pages 137-155
Key Refreshing in Wireless Sensor Networks….Pages 156-170
Efficient Traitor Tracing from Collusion Secure Codes….Pages 171-182
Revisiting the Karnin, Greene and Hellman Bounds….Pages 183-198
Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification….Pages 199-209
The Complexity of Distinguishing Distributions (Invited Talk)….Pages 210-222
Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)….Pages 223-231
A Proof of Security in O (2 n ) for the Xor of Two Random Permutations….Pages 232-248
Back Matter….Pages –
Reviews
There are no reviews yet.