Information Theoretic Security
6th International Conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012, Proceedings
1. Auflage
Erschienen am 4. August 2012
XI, 219 Seiten
978-3-642-32284-6 (ISBN)
Beschreibung
This book constitutes the proceedings of the 6th International Conference on Information Theoretic Security, ICITS 2012, held in Montreal, Canada, in August 2012.
The 11 full papers presented in this volume were carefully reviewed and selected from 46 submissions. In addition 11 papers were selected for the workshop track, abstracts of 7 of these contributions are also included in this book. Topics of interest are: physical layer security; multiparty computations; codes, lattices and cryptography; authentication codes; randomness extraction; cryptography from noisy channels; wiretap channels; bounded-storage models; information-theoretic reductions; quantum cryptography; quantum information theory; nonlocality and nonsignaling; key and message rates; secret sharing; physical models and assumptions; network coding security; adversarial channel models; information-theoretic tools in computational settings; implementation challenges; and biometric security.
Weitere Details
Weitere Ausgaben
Inhalt
- Intro
- Preface
- Organizations
- Table of Contents
- Guessing Secrecy
- Introduction
- Previous Work
- Our Contribution
- Motivation
- Notations and Preliminaries
- Information Measures
- Shannon Secrecy
- Secrecy Based on Guessing Probability
- Basic Definitions
- Guessing Secrecy
- Guessing Secrecy with Imperfect Randomness
- Relation with Perfect Secrecy
- Concluding Remarks
- References
- Trading Robustness for Correctness and Privacyin Certain Multiparty Computations, beyond an Honest Majority
- Introduction
- Contributions
- Model and Definitions
- Preliminaries
- Sharing a Secret
- Sub-protocols Used
- Multiparty Sum with Bins
- Protocol
- Multiparty Sum with Bins and Ghosts
- Verifiable Secret Sharing
- Multiparty Sum with Bins, Ghosts and Commitments
- Verifiable Secret Sharing with Signatures
- Protocol
- Applications
- Voting
- Anonymous Message Transmission
- References
- Proofs
- Properties of BIN-SUM
- Properties of GVSS
- Properties of GHOST-SUM
- Properties of IC-GVSS
- Properties of IC-GHOST-SUM
- Two Protocols for Delegation of Computation
- Introduction
- Our Contributions
- Organization
- The Protocols of GKR08,KR09
- Preliminaries: Low Degree Extension (LDE)
- The Bare-Bones GKR08 Protocol, Given a Circuit Specification Oracle
- Realizing the Oracle for L-UniformNCCircuits
- The Transformation of KR09
- Refereed Delegation of Computation
- The Model
- One-Round RDoC for Any L-UniformNCComputation
- Offline/Online Verifiable Delegation of Computation with a Public Offline Stage
- Splitting the GKR08 Protocol
- One-Round OVDoC with Public Offline Stage
- References
- The Protocol of FK97
- On the Amortized Complexity of ZeroKnowledge Protocols for Multiplicative Relations
- Introduction
- Our Contribution
- Applications
- Preliminaries
- Information Theoretic Commitments
- Linear Secret Sharing Schemes
- Our Protocol
- A Concrete Example
- A More General Approach
- Proving Integer Multiplication
- Commitment Schemes Based on Computational Assumptions
- Results with Standard Commitments
- References
- Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
- Introduction
- Preliminaries
- Universal Composability
- Lossy Encryption
- McEliece Assumptions and Public-Key Cryptosystem
- Oblivious Transfer from Lossy Encryption
- Distinguishing Lossy and Injective Keys
- Extractable String Commitment Schemes
- The Protocol
- Security
- Oblivious Transfer from the McEliece Assumptions
- Security
- Conclusion
- References
- Definitions and Basic Constructions
- Universal Composability
- Semantically Secure McEliece Cryptosystem
- Lossy Encryption Constructions
- Distinguishing Lossy and Injective Keys: Constructions
- Shannon Impossibility, Revisited
- Definitions
- Few Remarks on the Definition
- Main Result
- Some Extensions
- Extension to General M
- Slightly Stronger Bound for Perfect Completeness and Perfect Security
- Bounds for Mutual Information Based Definition
- References
- Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation
- Introduction
- Our Contribution
- Related Work
- Framework
- Notion of Security
- The IFqk-OAFE Primitive in the UC Framework
- Satistically UC-secure IFqk-OAFE from O(k) Instances of IFq-OAFE
- The Basic Protocol Idea and Why It Does Not Work
- Why Universal Hashing Does Not Help
- Our Solution
- References
- Proof of Lemma 2
- Proof of Lemma 3
- Proof of Lemma 4
- Proof of Lemma 5
- Passive Corruption in Statistical Multi-Party Computation
- Introduction
- Secure Multi-Party Computation
- Contributions
- Model
- Outline of the Paper
- Information Checking
- MPC with General Adversaries
- A Parametrized Protocol for General Adversaries
- Main Result
- MPC with Threshold Adversaries
- A Parametrized Protocol for Threshold Adversaries
- Main Result
- Conclusion
- References
- Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
- Introduction
- Security Model and Preliminaries
- Security Model
- Secret Sharing
- Threshold Building Blocks
- Proofs of Knowledge of Preimages of Homomorphisms
- OR Construction for Proofs of Knowledge of Preimages
- Range Proofs
- Applications to User-Centric Protocols
- E-Cash with Threshold Wallets
- Increasing the Security of Anonymous Credentials
- Forward and Backward Untraceability
- References
- Information-Theoretic Timed-Release Security: Key-Agreement, Encryption, and Authentication Codes
- Introduction
- TR-KA: Timed-Release Key-Agreement with Information-Theoretic Security
- Model and Security Definition
- Lower Bounds
- Construction
- TRE: Timed-Release Encryption with Information-Theoretic Security
- Model and Security Definition
- Construction of TRE from TR-KA and One-Time Pad
- TRA-Codes: Timed-Release Authentication Codes
- Model and Security Definition
- Construction of TRA-codes from TR-KA and A-Codes
- Relation to Information-Theoretic Key-Insulated Security
- References
- Optimum General Threshold Secret Sharing
- Introduction
- Notations and Definitions
- Functions for GTSS Scheme
- GTSS Scheme
- Previous Lower Bound
- New Lower Bound
- Optimum Construction
- Division Based Construction
- Proposed Optimum Division
- Conclusion
- References
- Proof of Lemma 1
- Proof of Corollary 1
- Proof of Corollary 3
- Proof of Theorem 2
- Proof of Fact in Proof of Theorem 3
- Workshop Track Abstracts
- Author Index
