2009 · 39 citations · 6 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer SecurityCryptographyCryptographic ComplexityDigital SignaturesElectronic SignaturesIdentity-based CryptographyAggregate SignaturesConstant-time AlgorithmsCryptographic SignaturesForgery ResistanceHardnessIdentity-based Signature SchemesIdentity-based SignaturesSignature Scheme Constructions
At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any messages of its choice. In addition, we show that the computational assumption is not correct by concretely presenting a constant-time algorithm solving the problem. The contribution of the new scheme and assumption is a natural step in cryptologic research that calls for further investigation, which is a step we perform in the current work.
6
Secure Border Gateway Protocol (S-BGP)
S. Kent, Charles Lynn, Karen Seo · IEEE Journal on Selected Areas in Communications · 2000 · 644 citations
Secure Border Gateway Protocol (Secure-BGP)
Stephen Kent, Charles Lynn, Karen Seo · 2000 · 137 citations
Origin authentication in interdomain routing
William Aiello, John P. A. Ioannidis, Patrick McDaniel · 2003 · 103 citations
Optimizing BGP security by exploiting path stability
Kevin Butler, Patrick McDaniel, William Aiello · 2006 · 81 citations