New models for efficient authenticated dictionaries

Abstract : We propose models for data authentication which take into account the behavior of the clients who perform queries. Our models reduce the size of the authenticated proof when the frequency of the query corresponding to a given data is higher. Existing models implicitly assume the frequency distribution of queries to be uniform, but in reality, this distribution generally follows Zipf's law. Our models better reflect reality and the communication cost between clients and the server provider is reduced allowing the server to save bandwidth. The obtained gain on the average proof size compared to existing schemes depends on the parameter of Zipf law. The greater the parameter, the greater the gain. When the frequency distribution follows a perfect Zipf's law, we obtain a gain that can reach 26%. Experiments show the existence of applications for which Zipf parameter is greater than 1, leading to even higher gains.
Document type :
Journal articles
Complete list of metadatas
Contributor : Alexis Bonnecaze <>
Submitted on : Saturday, October 31, 2015 - 1:51:55 PM
Last modification on : Thursday, March 7, 2019 - 12:04:03 PM
Long-term archiving on: Friday, April 28, 2017 - 8:41:02 AM


Files produced by the author(s)




Kevin Atighehchi, Alexis Bonnecaze, Gabriel Risterucci. New models for efficient authenticated dictionaries. Computers and Security, Elsevier, 2015, 53, pp.203-214. ⟨10.1016/j.cose.2015.04.010⟩. ⟨hal-01222953⟩



Record views


Files downloads