Information Theoretic Security 8th International Conference 1st Edition by Anja Lehmann, Stefan Wolf ISBN 331917469X 9783319174693

 Information Theoretic Security 8th International Conference 1st Edition by Anja Lehmann, Stefan Wolf – Ebook PDF Instant Download/Delivery: 331917469X, 978-3319174693
Full download Information Theoretic Security 8th International Conference 1st  Edition after payment

 

Product details:

ISBN 10:      331917469X
ISBN 13: 978-3319174693
Author:      Anja Lehmann, Stefan Wolf

This book constitutes the thoroughly refereed proceedings of the 8th International Conference on Information Theoretic Security, ICITS 2015, held in Lugano, Switzerland, in May 2015.

The 17 full papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers cover a variety of topics at the intersection of cryptography, information theory, and quantum physics.

Information Theoretic Security 8th International Conference 1st  Table of contents:

 

1. Generalizing Efficient Multiparty Computation

1.1 Introduction
1.2 Efficiency
2. Preliminaries
3. Generic Construction of Verifiable OT from Structure-Preserving OT
4. Generalized Oblivious Transfer
5. Batch Single-Choice Cut-and-Choose OT
6. Modified Cut-and-Choose from [Lin13]
7. Multi-Sender k-Out-of-n OT
References

---

2. Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity

1. Introduction
2. Our Contributions
   2.1 Complete Characterization of Networks
   2.2 Linear Communication Complexity
   2.3 Efficient Discriminant Algorithms
3. Network Model and Definitions
4. Communication Efficiency
5. Round Optimality
   5.1 Round Efficient Protocol
   5.2
   5.3 Polynomial Time Algorithm for Identifying the Optimal
   5.4 An Example of Round Optimal Protocol
6. Linear Communication Complexity
   6.1 Round Optimal Protocol with Linear Communication
7. Conclusions and Open Problems
   References

---

3. On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation

1. Introduction
2. A Eight-Round Statistically Zero-Knowledge Argument of Knowledge
   2.1 The Primitives in Use
3. Differing-Input Obfuscation of Next-Message Functions
4. The Six-Round Zero-Knowledge Argument of Knowledge
   4.1 Construction Idea
   4.2 The Protocol
   References

---

4. Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy

1. Introduction
2. Preliminaries
   2.1 Pseudoentropy
   2.2 Leakage Models
3. Simulatable Leakage
   3.1 Extending Simulatable Leakage to General Applications
4. Strongly Simulatable Leakage
   References

---

5. On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation

1. Introduction
2. Techniques and Ideas
3. Leakage-Resilient Two-Party Computation from Orthogonal Vectors
4. Leakage Resilient Computation from an Imperfect Source of Orthogonal Vectors
5. A Quantum Solution for the Orthogonal Vector Problem
   References

---

6. Metric Pseudoentropy: Characterizations, Transformations, and Applications

1. Introduction
   1.1 Computational Entropy
   1.2 Our Contribution
   1.3 Organization of the Paper
2. Preliminaries
3. Transformations
4. Characterizing Metric Pseudoentropy
   4.1 Connections to Separating Hyperplanes
5. Applications
   5.1 A Short Proof of the Efficient Dense Model Theorem
   5.2 The Optimal Efficient Dense Model Theorem
   5.3 Equivalence of HILL Entropy and Unpredictability Entropy
6. Conclusion
   References

---

7. Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications

1. Introduction
   1.1 Hardcore Lemmas and Their Applications
   1.2 Outline of the Paper
2. Preliminaries
3. Hardcore Lemmas
   3.1 Hardcore Lemma for Unpredictability
   3.2 Hardcore Lemma for Indistinguishability – Reduction to Unpredictability Case
4. Indistinguishability Hardcore Lemma for Pseudoentropy
5. Applications: Extracting from Metric Pseudoentropy of Poor Quality
6. Conclusion
   References

---

8. Gambling, Computational Information, and Encryption Security

1. Introduction
2. Preliminaries
3. Proportional Betting with Noisy Inside Information
4. Computational Setting
5. A Characterization Based on Pseudoentropy
6. Risk-Neutral Adversaries
7. Conclusions and Future Work
   References

---

9. Query-Complexity Amplification for Random Oracles

1. Introduction
   1.1 Motivation of This Work
   1.2 Contributions of This Paper
2. Preliminaries
   2.1 Basic Notation
   2.2 Random Systems
   2.3 Two-Interface Systems and Converters
3. Parameterized Constructions and QCA
4. The Caveats of Plain Iterated Hashing
5. Complexity Amplification via Collision-Free Iteration
   5.1 The Protocol and the Simulator
   5.2 Indistinguishability Proof
   References

---

10. The Chaining Lemma and Its Application

1. Introduction
2. Preliminaries
   2.1 Notation
   2.2 Information Theory Basics
3. The Chaining Lemma
4. Application to Tamper-Resilient Cryptography
   References

---

11. Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens

1. Introduction
2. Preliminaries
   2.1 Notation
   2.2 Model
3. The Case of Incoming Communication
   3.1 Unconditionally Secure OTM with Two Tokens
   3.2 Impossibility of Unconditionally Secure OTM from a Single Token
   3.3 Unconditionally Secure OT with a Single Token
   3.4 Computationally Secure OTM from a Single Token
4. The Case of Outgoing Communication
   4.1 Impossibility of Information-Theoretically Secure OT(M)
   4.2 Unconditionally Secure Commitment with a Single Token
   4.3 Computationally Secure OTM with a Single Token
5. Conclusion
   References

---

12. Limited View Adversary Codes: Bounds, Constructions, and Applications

1. Introduction
   1.1 Motivations for This Work and Previous Results
   1.2 Our Results
   1.3 Related Work
   1.4 Organization
2. Preliminaries
   2.1 List Decodable Codes
   2.2 Adversarial Wiretap Code (AWTP Code)
   2.3 Message Authentication Code (MAC)
3. Model and Definitions
   3.1 Limited View Adversarial Channels
   3.2 Limited View Adversary Code
4. An Upper Bound on the Rate of LV Codes
5. An LV Code Family that Achieves the Bound
6. Reliable Message Transmission and LV Codes
   6.1 Reliable Message Transmission (RMT)
   6.2 Comparing RMT Constructions
7. Conclusions
   References

---

13. Locally Decodable Codes for Edit Distance

1. Introduction
   1.1 Our Technique in More Detail
2. Searching Sorted Lists with Corruptions
   2.1 Our Approach
3. Transforming Standard LDC into LDC for Edit Distance
   References

---

14. The Multivariate Hidden Number Problem

1. Introduction
2. Preliminaries
   2.1 Fourier Analysis on Finite Groups
   2.2 Finite Field Representations
   2.3 Hidden Number Problem
3. Multivariate Hidden Number Problem
4. Main Results
5. Applications
   5.1 Solving the Hidden Number Problem
   5.2 Hardness of Every Single Bit of CDH by Changing
   References

---

15. Lattice Point Enumeration on Block Reduced Bases

1. Introduction
2. Preliminaries
3. Worst-Case Analysis of Enumeration After Block Reduction
   3.1 A Naive Attempt
4. Performance in Practice
   4.1 Experiments
   4.2 Simulation
   References

---

16. Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes

1. Introduction
   1.1 Notation
   1.2 Paper Organization
2. Fundamentals and Security Model
3. Previous Constructions
4. NTRU-Based Somewhat Homomorphic Encryption
5. Adaptive Key Recovery Attacks
   5.1 Attacking the BLLN Scheme for
   5.2 Attacking the BLLN Scheme for General
   5.3 Attacking the LTV Scheme
6. Concluding Remarks

People also search for Information Theoretic Security 8th International Conference 1st :

international conference on information theoretic security
universal hashing for information theoretic security
perfect secrecy and information theoretic security
information-theoretic security and cryptography
5 principles of information security

Tags:

Anja Lehmann,Stefan Wolf,Information,Theoretic,Security 8th,International,Conference 1st