Information Theoretic Security: 10th International Conference, ICITS 2017, Hong Kong, China, November 29 – December 2, 2017, Proceedings (Lecture Notes in Computer Science (10681))

Annotation This book constitutes the refereed proceedings of the 10th International Conference on Information Theoretic Security, ICITS 2017, held in Hong Kong, China, in November/December 2017. The 12 full papers were carefully reviewed and selected from 42 submissions. They are organized around the following topics: quantum cryptography; quantum information theory; post-quantum cryptography (e.g. lattices and cryptography); physical layer security; wiretap channels; adversarial channel models; cryptography from noisy channels; bounded storage models; network coding security; biometric security; randomness extraction; key and message rates; secret sharing; authentication codes; multiparty computations; information theoretic reductions; and implementation challenges Preface 6 ICITS 2017 The 10th International Conference on Information Theoretic Security Hong Kong, China, November 29 – December 2, 2017 8 Workshop Track Presentations 10 Contents 11 Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model 13 1 Introduction 13 2 Preliminaries 18 2.1 Tamper-Detection and Non-Malleability 19 2.2 Secret-Sharing 20 3 Constant-Rate and Linear-Time NM Codes 21 3.1 Building Blocks for Construction 1 22 3.2 Construction 1 24 4 Optimal-Rate and Linear-Time NM Codes 27 4.1 Building Blocks for Construction 2 27 4.2 Construction 2 30 A Appendix 33 A.1 Tellegen's Principle 33 References 34 Disproving the Conjectures from ``On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model'' 38 1 Introduction 38 1.1 Introduction to 1 39 1.2 Our Results 42 1.3 Related Work 42 2 Preliminaries 43 3 Our Results 46 3.1 Disproving Conjecture 1 46 3.2 Disproving Conjecture 2 49 References 50 Broadcast Encryption with Guessing Secrecy 51 1 Introduction 51 2 Preliminaries 52 2.1 Information Theoretic Tools 53 2.2 Symmetric-Key Encryption 53 2.3 Broadcast Encryption 53 3 Security Definition Based on Guessing Secrecy 55 4 Lower Bounds on Sizes of Ciphertexts and Secret Keys 57 5 Construction 60 6 Concluding Remarks 65 A Lower Bounds for Perfectly Secure BE Schemes 66 B The Fiat-Naor Construction with Various Biased Randomness 66 References 67 Contrast Optimal XOR Based Visual Cryptographic Schemes 70 1 Introduction 70 1.1 ``XOR'' Based VCS: An Alternative for ``OR'' Based VCS 71 1.2 Our Contribution 72 2 Prerequisites 73 2.1 The Model for Non-monotone XOR-VCS 73 2.2 Equivalent Parties and Simplification of Access Structures 75 2.3 Cumulative Array for an Access Structure 76 3 Main Results 77 References 83 Verifiably Multiplicative Secret Sharing 85 1 Introduction 85 2 Preliminaries 87 2.1 Notations and Definitions 87 2.2 A Motivated Application 88 3 Verifiably Multiplicative Secret Sharing 89 4 Feasibilities 90 5 Conclusion 93 References 93 Round and Communication Efficient Unconditionally-Secure MPC with t