The 4th International Conference on Information Theoretic Security (ICITS 2009)

The 4th International Conference on Information Theoretic Security

Over the last few decades, we have seen several research topics studied requiring information theoretical security, also called unconditional security, 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 theoretically secure cryptosystems are secure even if the factoring assumption or the discrete log assumption are broken. Seeing the multitude of topics in modern cryptography requiring information theoretical security or using information theory, it is time to have a regular conference on this topic.

This is the 4th conference of this series that is aimed to bring together the leading researchers in the area of information and/or quantum theoretic security. ICITS 2009 will be held December 2009, Shizuoka, Japan.

Important Dates: Submission Deadline:August 13, 2009; Decision Notification:September 11,
September 28, 2009; Pre-proceedings version:October 12, 2009; Conference:December 3 - 6, 2009. Shizuoka, Japan; Proceedings version:December 23, 2009

Note: ICITS 2009 will NOT overlap with Asiacrypt 2009 (December 6-10 in Tokyo). ICITS 2009 will end at 3:00pm on Dec. 6th, and the Asiacrypt 2009 welcome party will start at 6:30pm. The trip from Shizuoka to Tokyo, the Asiacrypt 2009 site, takes one hour.

Announcement

Proceedings will be published in Springer's Lecture Notes in Computer Science. They will be sent to the participants after the conference (Pre-proceedings will be available on site).