  Secure multi-party computation using a deck of playing cards has been a
subject of research since the "five-card trick" introduced by den Boer in 1989.
One of the main problems in card-based cryptography is to design
committed-format protocols to compute a Boolean AND operation subject to
different runtime and shuffle restrictions by using as few cards as possible.
In this paper, we introduce two AND protocols that use only uniform shuffles.
The first one requires four cards and is a restart-free Las Vegas protocol with
finite expected runtime. The second one requires five cards and always
terminates in finite time.
