WonLam-streamsig - Digital Signatures for Flows and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Digital Signatures for Flows and Multicasts Chung Kei Wong Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188 June 14, 1999 (revised) Abstract We present chaining techniques for signing/verifying multiple packets using a single signing/verification opera- tion. We then present flow signing and verification proce- dures based upon a tree chaining technique. Since a sin- gle signing/verification operation is amortized over many packets, these procedures improve signing and verification rates by one to two orders of magnitude compared to the ap- proach of signing/verifying packets individually. Our pro- cedures do not depend upon reliable delivery of packets, provide delay-bounded signing, and are thus suitable for delay-sensitive flows and multicast applications. To further improve our procedures, we propose several extensions to the Feige-Fiat-Shamir digital signature scheme to substan- tially speed up both the signing and verification operations, as well as to allow “adjustable and incremental” verifica- tion. The extended scheme, called eFFS, is compared to four other digital signature schemes (RSA, DSA, ElGamal, Rabin). We compare their signing and verification times, as well as key and signature sizes. We observe that (i) eFFS is the fastest in signing (by a large margin over any of the other four schemes) and as fast as RSA in verification (tie for a close second behind Rabin), (ii) eFFS allows a trade- off between memory and signing/verification time, and (iii) eFFS allows adjustable and incremental verification by re- ceivers. 1. Introduction Data confidentiality, authenticity, integrity, and non- repudiation are basic concerns of securing data delivery over an insecure network, such as the Internet. Confiden- tiality means that only authorized receivers will get the data; authenticity , an authorized receiver can verify the iden- tity of the data’s source; integrity , an authorized receiver can verify that received data have not been modified; non- repudiation , an authorized receiver can prove to a third Research sponsored in part by Texas Advanced Research Program grant no. 003658-063 and by NSA INFOSEC University Research Pro- gram grant no. MDA904-98-C-A901. An early version of this paper ap- pears in Proceedings IEEE ICNP ’98 , Austin, TX, October 1998. party the identity of the data’s source. 1 Most investigations on securing data delivery over packet networks have focused on unicast delivery of data sent as independent packets. Exceptions include recent pa- pers on scalable secure multicasting [1, 13, 20] and a flow- based approach to datagram security [14]. All of these pa- pers are mainly concerned with data confidentiality. In this paper, our concerns are data authenticity, integrity
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/31/2009 for the course ECE 18731 taught by Professor Perrig during the Spring '08 term at Carnegie Mellon.

Page1 / 13

WonLam-streamsig - Digital Signatures for Flows and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online