We consider binary channels with independent and identically distributed insertions, deletions and substitutions, 
occurring in positions that are unknown to both the transmitter and the receiver. The capacity of such channels 
is unknown, and only capacity bounds are available in the current literature. We derive novel upper and lower bounds 
by exploiting an auxiliary system where the channel is the same as that of the system of interest, but the receiver is 
provided with (partial) genie-aided information on the insertion/deletion/substitution process. In particular, we 
show that, when this information is revealed, we obtain a memoryless channel whose capacity can be evaluated by means
of the Blahut-Arimoto algorithm, leading to a provable upper bound on the capacity of interest. Moreover, we show 
that capacity lower bounds can be derived as well, by exploiting the same auxiliary system and resorting to several
information-theoretic inequalities. In the case of the deletion channel, that is, when no insertions or substitutions 
occur, the proposed upper bound improves the existing ones for most values of the deletion probability, while the 
proposed lower bound does not. On the other hand, in the more general case, both proposed bounds improve the existing 
results significantly, narrowing the region to which the actual capacity can belong.