ICITS2009washeldattheShizuokaConventionandArtsCenter“GRANSHIP” in Japan during December 3–6,2009.This was the 4th International Conference on Information Theoretic Security. Over the last few decades, we have seen several research topics studied - quiringinformationtheoreticalsecurity,alsocalledunconditionalsecurity,where there is no unproven computational assumption on the adversary. (This is the framework proposed by Claude Shannon in his seminal paper.) Also, coding as well as other aspects of information theory have been used in the design of cryptographic schemes. Examples are authentication, secure communication, key exchange, multi-party computation and information hiding to name a few. A related area is quantum cryptography that predominantly uses information theory for modeling and evaluation of security. Needless to say, information t- oretically secure cryptosystems are secure even if the factoring assumption or the discrete log assumption is broken. Seeing the multitude of topics in m- ern cryptographyrequiring informationtheoreticalsecurity or using information theory, it is time to have a regular conference on this topic. This was the fourth conference of this series, aiming to bring together the leading researchers in the area of information and/or quantum theoretic security.
Author(s): Joël Alwen, Yevgeniy Dodis, Daniel Wichs (auth.), Kaoru Kurosawa (eds.)
Series: Lecture Notes in Computer Science 5973 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 249
Tags: Data Encryption; Systems and Data Security; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Management of Computing and Information Systems; Computers and Society
Front Matter....Pages -
Survey: Leakage Resilience and the Bounded Retrieval Model....Pages 1-18
A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes....Pages 19-26
Security of Key Distribution and Complementarity in Quantum Mechanics....Pages 27-27
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification....Pages 28-44
Code-Based Public-Key Cryptosystems and Their Applications....Pages 45-55
On the Security of Pseudorandomized Information-Theoretically Secure Schemes....Pages 56-73
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience....Pages 74-92
On the Optimization of Bipartite Secret Sharing Schemes....Pages 93-109
Linear Threshold Multisecret Sharing Schemes....Pages 110-126
Multiterminal Secrecy Generation and Tree Packing....Pages 127-127
Information Theoretic Security Based on Bounded Observability....Pages 128-139
Group Testing and Batch Verification....Pages 140-157
What Can Cryptography Do for Coding Theory?....Pages 158-158
Cryptanalysis of Secure Message Transmission Protocols with Feedback....Pages 159-176
The Optimum Leakage Principle for Analyzing Multi-threaded Programs....Pages 177-193
A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure....Pages 194-212
An Improvement of Pseudorandomization against Unbounded Attack Algorithms – The Case of Fingerprint Codes....Pages 213-230
Statistical-Mechanical Approach for Multiple Watermarks Using Spectrum Spreading....Pages 231-247
Back Matter....Pages -
