↓ Skip to main content

Information Theoretic Security

Overview of attention for book
Cover of 'Information Theoretic Security'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk)
  3. Altmetric Badge
    Chapter 2 Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
  4. Altmetric Badge
    Chapter 3 Interactive Hashing: An Information Theoretic Tool (Invited Talk)
  5. Altmetric Badge
    Chapter 4 Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network
  6. Altmetric Badge
    Chapter 5 Strong Secrecy for Wireless Channels (Invited Talk)
  7. Altmetric Badge
    Chapter 6 Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
  8. Altmetric Badge
    Chapter 7 Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk)
  9. Altmetric Badge
    Chapter 8 A Single Initialization Server for Multi-party Cryptography
  10. Altmetric Badge
    Chapter 9 Statistical Security Conditions for Two-Party Secure Function Evaluation
  11. Altmetric Badge
    Chapter 10 Upper Bounds for Set Systems with the Identifiable Parent Property
  12. Altmetric Badge
    Chapter 11 Oblivious Transfer Based on the McEliece Assumptions
  13. Altmetric Badge
    Chapter 12 List Error-Correction with Optimal Information Rate (Invited Talk)
  14. Altmetric Badge
    Chapter 13 Theory of Quantum Key Distribution: The Road Ahead (Invited Talk)
  15. Altmetric Badge
    Chapter 14 Susceptible Two-Party Quantum Computations
  16. Altmetric Badge
    Chapter 15 Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
  17. Altmetric Badge
    Chapter 16 Key Refreshing in Wireless Sensor Networks
  18. Altmetric Badge
    Chapter 17 Efficient Traitor Tracing from Collusion Secure Codes
  19. Altmetric Badge
    Chapter 18 Revisiting the Karnin, Greene and Hellman Bounds
  20. Altmetric Badge
    Chapter 19 Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
  21. Altmetric Badge
    Chapter 20 The Complexity of Distinguishing Distributions (Invited Talk)
  22. Altmetric Badge
    Chapter 21 Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
  23. Altmetric Badge
    Chapter 22 A Proof of Security in O (2 n ) for the Xor of Two Random Permutations
Attention for Chapter 18: Revisiting the Karnin, Greene and Hellman Bounds
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
20 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Revisiting the Karnin, Greene and Hellman Bounds
Chapter number 18
Book title
Information Theoretic Security
Published by
Springer, Berlin, Heidelberg, August 2008
DOI 10.1007/978-3-540-85093-9_18
Book ISBNs
978-3-54-085092-2, 978-3-54-085093-9
Authors

Yvo Desmedt, Brian King, Berry Schoenmakers, Desmedt, Yvo, King, Brian, Schoenmakers, Berry

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 20 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 5%
Unknown 19 95%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 30%
Student > Master 3 15%
Researcher 3 15%
Professor > Associate Professor 2 10%
Professor 1 5%
Other 3 15%
Unknown 2 10%
Readers by discipline Count As %
Computer Science 16 80%
Mathematics 1 5%
Physics and Astronomy 1 5%
Unknown 2 10%