Browsing by Author "Wheeler, D."

Now showing items 1-3 of 3

    • Merkle puzzles revisited - finding matching elements between lists 

      Christianson, B.; Wheeler, D. (University of Hertfordshire, 1999)
      Consider the following problem. A and B have a N-element set of bit-strings. They wish to find all collisions, in other words to find the common strings of their sets or to establish that there are none. How much data must ...

    • Merkle Puzzles Revisited — Finding Matching Elements between Lists 

      Christianson, B.; Wheeler, D. (2002)
      Consider the following problem. A and B each have a N-element set of bit-strings. They wish to find all collisions, in other words to find the common strings of their sets or to establish that there are none. How much data ...

    • Secure Sessions from Weak Secrets 

      Christianson, B.; Roe, M.; Wheeler, D. (2005)
      Sometimes two parties who already share a weak secret k such as a password wish to share also a strong secret s such as a session key without revealing information about k to an active attacker. We assume that both parties ...