Information Theoretic Security 4th International Conference, ICITS 2009, Shizuoka, Japan, December 3-6, 2009. Revised Selected Papers /

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,alsocalledunco...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kurosawa, Kaoru (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 5973
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04956nam a22005655i 4500
001 978-3-642-14496-7
003 DE-He213
005 20151204180304.0
007 cr nn 008mamaa
008 100910s2010 gw | s |||| 0|eng d
020 |a 9783642144967  |9 978-3-642-14496-7 
024 7 |a 10.1007/978-3-642-14496-7  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A25 
072 7 |a URY  |2 bicssc 
072 7 |a COM053000  |2 bisacsh 
082 0 4 |a 005.82  |2 23 
245 1 0 |a Information Theoretic Security  |h [electronic resource] :  |b 4th International Conference, ICITS 2009, Shizuoka, Japan, December 3-6, 2009. Revised Selected Papers /  |c edited by Kaoru Kurosawa. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a X, 249 p. 23 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5973 
505 0 |a Leakage Resilient Cryptography -- Survey: Leakage Resilience and the Bounded Retrieval Model -- A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes -- Quantum Cryptography and Indistinguishability -- Security of Key Distribution and Complementarity in Quantum Mechanics -- Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification -- Connection to Computational Security -- Code-Based Public-Key Cryptosystems and Their Applications -- On the Security of Pseudorandomized Information-Theoretically Secure Schemes -- Secret Sharing -- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience -- On the Optimization of Bipartite Secret Sharing Schemes -- Linear Threshold Multisecret Sharing Schemes -- Key Agreement from Common Randomness -- Multiterminal Secrecy Generation and Tree Packing -- Information Theoretic Security Based on Bounded Observability -- Random Graph and Group Testing -- Group Testing and Batch Verification -- Reliable Data Transmision and Computation -- What Can Cryptography Do for Coding Theory? -- Cryptanalysis of Secure Message Transmission Protocols with Feedback -- The Optimum Leakage Principle for Analyzing Multi-threaded Programs -- Fingerprint and Watermarking -- A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure -- An Improvement of Pseudorandomization against Unbounded Attack Algorithms – The Case of Fingerprint Codes -- Statistical-Mechanical Approach for Multiple Watermarks Using Spectrum Spreading. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer security. 
650 0 |a Data encryption (Computer science). 
650 0 |a Coding theory. 
650 0 |a Algorithms. 
650 0 |a Management information systems. 
650 1 4 |a Computer Science. 
650 2 4 |a Data Encryption. 
650 2 4 |a Coding and Information Theory. 
650 2 4 |a Systems and Data Security. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Management of Computing and Information Systems. 
700 1 |a Kurosawa, Kaoru.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642144950 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5973 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-14496-7  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)