EfficientBGPSecurity详解.ppt

08/01/2005 63rd IETF - Paris, FRANCE Efficient BGP Security Meiyuan Zhao, Sean Smith Dartmouth College David Nicol University of Illinois, Urbana-Champaign Motivation BGP—central routing for the Internet BGP lacks security Black holes Disconnected networks Suboptimal routes … Secure BGP Deployment difficulties Processing overheads Storage demands PKIs Goal Efficient AND practical security Outline Overview BGP S-BGP Path authentication PKI and origin authentication Discussion Conclusions Border Gateway Protocol (BGP) Inter-domain routing protocol Mainly between autonomous systems (ASes) Updates are in form of route announcements Secure BGP (S-BGP) Attestations Route Attestations—authenticate AS path Address Attestations—authorization of IP address ownerships Public key infrastructures Certificates for routers Certificates for address ownership Outline Overview Path authentication S-BGP RAs Aggregated Path Authentication Performance evaluation PKI and origin authentication Discussion Conclusions S-BGP Route Attestations (RAs) Router signs (AS path, prefix, next_hop) Sends all previous signatures Verify AS path {1, 2, 3} Needs 3 signatures Sign AS path {1, 2, 3} Creates n signatures Signature Algorithm—DSA Caching optimization Performance Problems Time Processing latency 230% longer Space Message size: 800% longer Memory cost: 10 times more For Attestations Certificate database Current routers: 128MB or 256MB RAM Signature Amortization (S-A) Fast signature verification—RSA Fewer signature signings—amortized cost Bit vectors (indicating recipients) Merkle hash trees Auxiliary values for each signature Aggregate Signatures k signers {s1, s2, …, sk} k messages {m1, m2, …, mk} one aggregate signature s One aggregate signature for entire AS path Aggregate Signature Variants General aggregate signature (GAS) Based on BLS short signature on Anyone can aggregate in any ordering Takes k+1 pairing calculation for verifying Sequential aggregate signa