Information Theoretic Security.pdf

发布时间：2022-06-26 发布人：admin 分类：说明书资料大小：6.54M 资料格式：pdf 举报版权申诉

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第1页.png

第1页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第2页.png

第2页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第3页.png

第3页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第4页.png

第4页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第5页.png

第5页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第6页.png

第6页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第7页.png

第7页 / 共300页

47257dfe-af05-4e2b-986a-12fc5aeff997.pdf-第8页.png

第8页 / 共300页

Preface

Organization

Contents

Secret Sharing

Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters

1 Introduction

1.1 State of the Art and Our Results

2 Preliminaries

2.1 Secret Sharing Schemes

2.2 Cheating Detectable Secret Sharing Against Rushing Cheaters

2.3 Cheater Identifiable Secret Sharing Against Rushing Cheaters

2.4 Building Blocks of Proposed Schemes

3 A Scheme Capable of Detecting (k-1)/3 Rushing Cheaters

4 A Scheme Capable of Detecting n-1 Rushing Cheaters

5 A Scheme Capable of Identifying (k-1)/3 Rushing Cheaters

6 A Scheme Capable of Identifying (k-1)/2 Rushing Cheaters

7 Concluding Remarks

References

Dynamic and Verifiable Hierarchical Secret Sharing

1 Introduction

1.1 Motivation and Contribution

1.2 Related Work

2 Preliminaries

3 Dynamic Secret Sharing

4 Secret Sharing Based on Birkhoff Interpolation

5 Providing a Dynamic and Verifiable Hierarchical Secret Sharing Scheme

5.1 Distributed Computation of Determinants

5.2 Verifiable Algorithms for Dynamic Hierarchical Secret Sharing

5.3 Security and Efficiency

6 Conclusion and Future Work

A Requirements for Birkhoff Interpolation Matrices Interpolation

B Security Analysis

C Example of Tassa's Hierarchical Secret Sharing

References

Quantum Cryptography

Computational Security of Quantum Encryption

1 Introduction

1.1 Summary of Contributions and Techniques

1.2 Related Work

2 Preliminaries

2.1 Classical States, Maps, and the One-Time Pad

2.2 Quantum States, Maps, and the One-Time Pad

2.3 Efficient Classical and Quantum Computations

2.4 Oracles

3 Quantum Encryption and Indistinguishability

3.1 Quantum Encryption Schemes

3.2 Indistinguishability of Encryptions

4 Quantum Semantic Security

4.1 Difficulties in the Quantum Setting

4.2 Definition of Semantic Security

4.3 Semantic Security Is Equivalent to Indistinguishability

5 Quantum Encryption Schemes

5.1 Quantum Symmetric-Key Encryption from One-Way Functions

5.2 Quantum Public-Key Encryption from Trapdoor Permutations

6 Conclusion

6.1 Extensions and Future Work

References

Efficient Simulation for Quantum Message Authentication

1 Introduction

2 Preliminaries

2.1 Basic Notation

2.2 Pauli Matrices

2.3 Clifford Group

3 Quantum Message Authentication

4 Quantum Message Authentication Schemes

4.1 The Clifford Code

4.2 The Trap Code

5 Security of Quantum Message Authentication Schemes

5.1 Security of the Clifford Code

5.2 Security of the Trap Code

A Appendix

References

Visual Cryptography

Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography

1 Introduction

2 Visual Cryptography

3 Privately Computable Functions

4 Secret Sharing Homomorphism

5 Visual Homomorphic Functions

5.1 Functions X, , y, , 0, 1

5.2 Function Xor

5.3 Function Xor

6 On Randomness Saving: Strategies and Impossibility Results

6.1 Security Definition

6.2 Impossibility Results

7 Randomness Reduction

8 Conclusions and Open Problems

References

Revisiting the False Acceptance Rate Attack on Biometric Visual Cryptographic Schemes

1 Introduction

2 Framework

3 Revisiting the False Acceptance Attack

4 A New Strategy for Attacking E-BVC

4.1 A Case Analysis for RO-e-BVC

5 Conclusion

References

Cryptographic Protocols

Detecting Algebraic Manipulation in Leaky Storage Systems

1 Introduction

2 Preliminaries

3 AMD Codes for Leaky Storage

3.1 Definition of -AMD

3.2 Efficiency Bounds for -AMD Codes

4 Limited-View -AMD Codes

5 Applications

5.1 Robust Ramp SSS

5.2 Wiretap II with Algebraic Adversary

6 Conclusion

A Proof of Lemma 4

B Proof of Lemma 5

C Proof of Proposition 2

D Proof of Construction 4

References

Cheater Detection in SPDZ Multiparty Computation

1 Introduction

2 The Original SPDZ Protocol

2.1 The Setting

2.2 Ingredients

2.3 Outline of the SPDZ Protocol

3 Our Protocol

3.1 An Overview of Our Protocol

3.2 The Checking Protocol BlockCheck

3.3 Security of Our Protocol

3.4 The Complexity of Our Protocol

4 Conclusion

A The Protocol BlockCheck in Detail

A.1 The Tag Checking in Detail

A.2 The Complexity of the Block Check

B The Commitment Check

C Checking the Input and Output of the Computation

References

Error-Correcting Codes Against Chosen-Codeword Attacks

1 Introduction

1.1 Ideas of the Construction

1.2 Related Work

2 Preliminaries

2.1 Notations

2.2 Error-Correcting Codes

3 Formal Model

4 Our Construction

4.1 Overview

4.2 Ingredients

4.3 The Construction

5 Security Proof

References

Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)

1 Introduction

1.1 Contribution

2 Definitions and Notation

2.1 Universal Composability

2.2 Notation

3 Commitments with Linear Proofs

4 Zero-Knowledge with Soundness-Error One-Half

4.1 Protocol for Equality

4.2 Parallel Equality Proofs and Proofs of Inequality

4.3 Linear Zero-Knowledge Proof

5 And-Proof with Soundness-Error Three-Quarter

6 Honest-Verifier Zero-Knowledge Proof for Circuit Satisfiability

6.1 Generating the Set S

7 Implementation

8 Conclusion

A Universal Composability Framework

A.1 Ideal Functionalities

B Inequality Protocol

C Parallel Equality Proofs

D Parallel Linear Proof

E Simulation of Mult

F Reproducing Our Empirical Studies

References

Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness

1 Introduction

1.1 Background

1.2 Our Contributions

1.3 Related Work

2 Revocable-Storage Broadcast Encryption

2.1 Model

2.2 Security Definition

3 Tight Lower Bounds on Sizes of Ciphertexts and Secret Keys

4 Construction

5 Robust Construction

A Shannon Entropy

B Collusion-Resistant RS-BE Scheme

C Construction for Arbitrary Plaintext Sizes and Number of Users

References

Entropy, Extractors and Privacy

A Practical Fuzzy Extractor for Continuous Features

1 Introduction

1.1 Information Reconciliation for Discrete Data

1.2 Fuzzy Extractors for Discrete Data

1.3 Information Reconciliation for Continuous Data

1.4 Related Work: Fuzzy Extractors for Continuous Data

1.5 Contributions of This Paper

2 Preliminaries

2.1 Lattice

2.2 Lattice Codes and the Unconstrained Power Channel

2.3 Discrete and Continuous Fuzzy Extractors

3 A CS-Fuzzy Extractor Assuming White Gaussian Noise

4 Dealing with Different Types of Noise

4.1 Gaussian Approximation Using the Central Limit Theorem

4.2 Variance Normalization to Stay Within the Correction Capacity

5 Proof of Security of Our Fuzzy Extractor

6 Practical Construction with Low-Density Lattice Codes

7 Conclusion

8 Open Questions and Possible Future Work

A Proof of Theorem1

B Proof of Theorem2

References

Almost Perfect Privacy for Additive Gaussian Privacy Filters

1 Introduction

1.1 Contributions

1.2 Preliminaries

2 Rate-Privacy Function for Additive Privacy Filters

3 Estimation-Theoretic Formulation

4 Conclusion

A Connection Between Mutual Information and Non-Gaussianness

B Completion of the Proof of Theorem4

References

A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage

1 Introduction

1.1 Entropy Notions and Chain Rules

1.2 Motivation: Limitations of Pseudoentropy Chain Rules

1.3 Our Results

1.4 Our Techniques

1.5 Paper Organization

2 Preliminaries

2.1 Basic Definitions

2.2 Pseudoentropy

3 Auxiliary Facts

4 Results

4.1 Flexible Chain Rule for Conditional Pseudoentropy

4.2 A Conditional Chain Rule for Noisy Leakage

5 Applications

5.1 Known Chain Rules for Unconditional Pseudoentropy

5.2 Stream Ciphers Resilient Against Noisy Leakages

5.3 Better Handling (some) Noisy Leakages

5.4 Noisy Leakage Basics

6 Open Problems

A Proof of Corollary2

B Proof of Theorem 3

C Proof of Theorem 4

References

Author Index

Anderson C.A. Nascimento Paulo Barreto (Eds.) 5 1 0 0 1 S C N L Information Theoretic Security 9th International Conference, ICITS 2016 Tacoma, WA, USA, August 9–12, 2016 Revised Selected Papers 0dayku.com第⼀一时间掌握全球0day资讯 1 2 3

Lecture Notes in Computer Science 10015 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany

More information about this series at http://www.springer.com/series/7410

Anderson C.A. Nascimento Paulo Barreto (Eds.) Information Theoretic Security 9th International Conference, ICITS 2016 Tacoma, WA, USA, August 9–12, 2016 Revised Selected Papers 123

Editors Anderson C.A. Nascimento University of Washington Tacoma Tacoma, WA USA Paulo Barreto University of Washington Tacoma, WA USA ISSN 0302-9743 Lecture Notes in Computer Science ISBN 978-3-319-49174-5 DOI 10.1007/978-3-319-49175-2 ISSN 1611-3349 (electronic) ISBN 978-3-319-49175-2 (eBook) Library of Congress Control Number: 2016956491 LNCS Sublibrary: SL4 – Security and Cryptology © Springer International Publishing AG 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, speciﬁcally the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microﬁlms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a speciﬁc statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer International Publishing AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland

Preface ICITS 2016, the 9th International Conference on Information-Theoretic Security, was held in Tacoma, Washington, USA, during August 9–12, 2016. The conference took place on the campus of the University of Washington, Tacoma. The general and program co-chairs were Paulo Barreto (UW Tacoma and University of Sao Paulo) and Anderson C.A. Nascimento (UW Tacoma). ICITS covers all aspects of information-theoretic security, from relevant mathe- matical tools to theoretical modeling to implementation. ICITS 2016 was an event in cooperation with The International Association for Cryptologic Research (IACR). ICITS 2016 had two tracks, a conference and a workshop track. Conference-track articles appear in the proceedings, whereas workshop-track contributions were only presented on-site with a talk. This two-track format has the advantage of bringing together researchers from various areas with different publication cultures. There were 40 submitted papers, 32 to the conference track and eight to the workshop track. In all, 14 submissions were accepted for the conference track and six for the workshop track. All submissions were reviewed by at least three members of the Program Committee, who sometimes were assisted by external reviewers. These pro- ceedings contain the accepted papers for the conference track. There were four invited talks: – “Obfuscation Without the Vulnerabilities of Multilinear Maps,” Sanjam Garg (UC Berkeley) – “Tools for Quantum and Reversible Circuit Compilation and Applications to Quantum Cryptanalysis,” Martin Roetteler (Microsoft Research) – “Information Theoretic Techniques Underlying Secure Obfuscation,” Amit Sahai (UCLA) – “New Techniques for Information-Theoretic Indistinguishability,” Stefano Tessaro (UC Santa Barbara) We would like to thank the Steering Committee of ICITS, in particular Yvo Des- medt and Rei Safavi-Naini. We also thank the Program Committee members and external reviewers for their careful work. We are grateful to the wonderful local organizing team here at UW Tacoma: BrieAnna Bales, Zaide Chavez, Bob Landowski, Mike McMillan, Tyler Pederson, and Yana Wilson. Finally, we would like to thank all the authors who submitted papers to ICITS 2016. September 2016 Anderson C.A. Nascimento Paulo Barreto

Organization Program Committee Divesh Aggarwal Paulo Barreto Anne Broadbent Paolo D’Arco Frédéric Dupuis Stefan Dziembowski Nico Döttling Ben Fuller Peter Gaži Divya Gupta Goichiro Hanaoka Carmit Hazay Mitsugu Iwamoto Iordanis Kerenidis Robert Koenig Ranjit Kumaresan Tancrède Lepoint Hemanta Maji Keith Martin EPFL, Switzerland University of Washington, USA University of Ottawa, Canada University of Salerno, Italy Masaryk University, Hungary University of Warsaw, Poland Aarhus University, Denmark MIT, USA IST, Austria UCLA, USA AIST Bar-Ilan University, Israel University of Electro-Communications, Japan LIAFA Technische Universität München, Germany University of Maryland, USA CryptoExperts Purdue University, USA Information Security Group, Royal Holloway, University of London, UK Anderson Nascimento Koji Nuida University of Washington, USA National Institute of Advanced Industrial Science and Frederique Oggier Arpita Patra Krzysztof Pietrzak Samuel Ranellucci Martin Roetteler Rei Safavi-Naini Rafael Schaefer Junji Shikata Rainer Steinwandt Stefano Tessaro Marten van Dijk Stefan Wolf Mark Zhandry Technology (AIST), Japan Research Center for Information Security Indian Institute of Science, India IST, Austria Aarhus University, Denmark Microsoft Research University of Calgary, Calgary Princeton University, USA Yokohama National University, Japan Florida Atlantic University, USA UCSB University of Connecticut, USA USI Princeton University, USA

Contents Secret Sharing Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Avishek Adhikari, Kirill Morozov, Satoshi Obana, Partha Sarathi Roy, Kouichi Sakurai, and Rui Xu Dynamic and Verifiable Hierarchical Secret Sharing . . . . . . . . . . . . . . . . . . 24 Giulia Traverso, Denise Demirel, and Johannes Buchmann Quantum Cryptography Computational Security of Quantum Encryption . . . . . . . . . . . . . . . . . . . . . 47 Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, and Michael St. Jules Efficient Simulation for Quantum Message Authentication . . . . . . . . . . . . . . 72 Anne Broadbent and Evelyn Wainewright Visual Cryptography Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Paolo D’Arco, Roberto De Prisco, and Yvo Desmedt 95 Revisiting the False Acceptance Rate Attack on Biometric Visual Cryptographic Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114 Koray Karabina and Angela Robinson Cryptographic Protocols Detecting Algebraic Manipulation in Leaky Storage Systems . . . . . . . . . . . . 129 Fuchun Lin, Reihaneh Safavi-Naini, and Pengwei Wang Cheater Detection in SPDZ Multiparty Computation . . . . . . . . . . . . . . . . . . 151 Gabriele Spini and Serge Fehr Error-Correcting Codes Against Chosen-Codeword Attacks . . . . . . . . . . . . . 177 Kenji Yasunaga

分享到：

赞收藏

资料库

Information Theoretic Security.pdf

相关推荐

安全技术

热门标签

最新资料