This work has several contributions. We first correct some flaws in the definition of the ideal signature functionality of Canetti, 2001, andsubsequent formulations. Next we provide a minimal formalization of ``ideal certification authorities'' and show how authenticated communication can be obtained using ideal signatures and an ideal certification authority. This is done while guaranteeing full modularity (i.e., each component is analyzed as stand-alone), and in an unconditional and errorless way. This opens the door to symbolic and automated analysis of protocols for these tasks, in a way that is both modular and cryptographically sound.
Category / Keywords: foundations / Publication Info: An extended abstract of this work appears in the proceedings of CSFW 2004. The current version contains some corrections and updates of the CSFW 2004 paper. Date: received 17 Nov 2003, last revised 15 Aug 2004 Contact author: canetti at watson ibm com Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20040815:140230 (All versions of this report) Discussion forum: Show discussion | Start new discussion