This concrete example illustrates the necessity for a thorough theoretical analysis of information-theoretically secure cryptographic techniques that are to be deployed in practice. In this work we show how to implement a statistically secure and composable system for message passing, that is, a channel with negligible failure rate secure against unbounded adversaries, using a one time pad based cryptosystem. We prove the security of our system in an asynchronous adversarially-controlled network using the framework put forward by Backes, Pfitzmann, and Waidner. The composition theorem offered by this framework enables the use of our scheme as a building block of more complex protocols as needed in practical applications.
Category / Keywords: cryptographic protocols / unconditional security, composability, one time pad Date: received 14 May 2004, last revised 13 Sep 2004 Contact author: draub at ira uka de Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Note: Updated the paper with missing citations. Rewrote abstract. Version: 20040913:144010 (All versions of this report) Discussion forum: Show discussion | Start new discussion