Hardened bloom filters, with an application to unobservability

DOI10.2478/v10065-012-0018-yzbMath1283.68147OpenAlexW2028468968MaRDI QIDQ2442961

Nicolas Bernard, Franck Leprévost

Publication date: 2 April 2014

Published in: Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10065-012-0018-y

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• RIPEMD-160: A strengthened version of RIPEMD
• Space/time trade-offs in hash coding with allowable errors
• Unnamed Item
• Unnamed Item

This page was built for publication: Hardened bloom filters, with an application to unobservability