  We investigate two possible techniques to authenticate the q-digest data
structure, along with a worst-case study of the computational complexity both
in time and space of the proposed solutions, and considerations on the
feasibility of the presented approaches in real-world scenarios. We conclude
the discussion by presenting some considerations on the information complexity
of the queries in the two proposed approaches, and by presenting some
interesting ideas that could be the subject of future studies on the topic.
