An interactive, similarity increasing algorithm for random strings with applications to key agreement in ad hoc networks

DOI10.1111/J.1467-9590.2008.00408.XzbMATH Open1205.68047OpenAlexW2077333160MaRDI QIDQ3560190FDOQ3560190

Authors: Effie Makri, Yannis C. Stamatiou 

Publication date: 19 May 2010

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9590.2008.00408.x

Recommendations

• Secret key agreement by public discussion from common information
• Perfectly secure key distribution for dynamic conferences
• Key Agreement from Close Secrets over Unsecured Channels
• Information-theoretic key agreement: from weak to strong secret for free
• Common randomness in information theory and cryptography. I. Secret sharing

zbMATH Keywords

wireless mobile ad hoc networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• On the Lambert \(w\) function
• New directions in cryptography
• Title not available (Why is that?)

Cited In (2)

• An identity derived from the solution of a class of differential equations for the evolution of a key agreement protocol
• On the derivation of a closed-form expression for the solutions of a subclass of generalized Abel differential equations

This page was built for publication: An interactive, similarity increasing algorithm for random strings with applications to key agreement in ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560190)