Bloom filters are well-known space-efficient data structures that answer set
membership queries with some probability of false positives. In an attempt to
solve many of the limitations of current inter-networking architectures, some
recent proposals rely on including small Bloom filters in packet headers for
routing, security, accountability or other purposes that push application
states into the packets themselves. In this paper, we consider the design of
in-packet Bloom filters (iBF). Our main contribution consists of a series of
extensions (1) to increase the practicality and performance of iBFs, (2) to
enable false-negative-free element deletion, and (3) to provide security
enhancements. An evaluation of the design parameters and implementation
alternatives validates the usefulness of the proposed extensions, providing for
enhanced and novel iBF networking applications.