On 08/07/2016 10:05, "Nikos Mavrogiannopoulos" <n...@redhat.com> wrote: >On Fri, 2016-07-08 at 08:59 +0000, Fossati, Thomas (Nokia - GB) wrote: > >> > How would the hash chain matching work for a server handling >> > multiple >> > clients? >> Sorry, I'm not sure I understand the question. Are you asking what >> happens if there is an Id collision between two separate hash chains? > >No, my question is much simpler. How would a server handling for >example 20000 clients, will figure to which chain a hash of H(x) >belongs to? Will it have to iterate through all the chains (client >states) and test for matching or there is something more clever than >that?
Ah! The hash chain would be computed at the end of the handshake, so all L Ids can be put in a hash table that maps them to the same DTLS context. When a data record comes in, its Id can be used to look up the context in O(1). Clearly the server needs to negotiate a sensible L if it doesn't want to blow up. _______________________________________________ TLS mailing list TLS@ietf.org https://www.ietf.org/mailman/listinfo/tls
