Authentication of Transit Flows and k-Siblings One-time Signature (abstract)

We exploit the unique features of the $k$-sibling Intractable hashing in presenting two authentication schemes. In the first scheme, we propose a method which enables intermediate nodes in IP communication networks to verify the authenticity of transit flows. While in the second scheme, we introduce a new one-time digital signatures scheme.

Back to CMS 2002 schedule.