Information Theoretic Security

Chapter 1 Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk)

Chapter 2 Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption

Chapter 3 Interactive Hashing: An Information Theoretic Tool (Invited Talk)

Chapter 4 Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network

Chapter 5 Strong Secrecy for Wireless Channels (Invited Talk)

Chapter 6 Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

Chapter 7 Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk)

Chapter 8 A Single Initialization Server for Multi-party Cryptography

Chapter 9 Statistical Security Conditions for Two-Party Secure Function Evaluation

Chapter 10 Upper Bounds for Set Systems with the Identifiable Parent Property

Chapter 11 Oblivious Transfer Based on the McEliece Assumptions

Chapter 12 List Error-Correction with Optimal Information Rate (Invited Talk)

Chapter 13 Theory of Quantum Key Distribution: The Road Ahead (Invited Talk)

Chapter 14 Susceptible Two-Party Quantum Computations

Chapter 15 Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Chapter 16 Key Refreshing in Wireless Sensor Networks

Chapter 17 Efficient Traitor Tracing from Collusion Secure Codes

Chapter 18 Revisiting the Karnin, Greene and Hellman Bounds

Chapter 19 Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

Chapter 20 The Complexity of Distinguishing Distributions (Invited Talk)

Chapter 21 Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)

Chapter 22 A Proof of Security in O (2 n ) for the Xor of Two Random Permutations