We show that the set of continuous-time memoryless queues,
parametrized by the service rate, forms a stochastically degraded
family. This implies that slower queues are more entropy-increasing 
than faster ones are. These two facts together provide a converse 
for the secrecy capacity of the memoryless queue, matching
an earlier achievability result in the literature.