Thus, the number of rounds is the criterion to evaluate the time complexity of card-based protocols with private operations. The minimum number of rounds of most protocols is two. Suppose that the number of rounds is one.
Abstract. This paper shows new card-based cryptographic protocols with the minimum number of rounds using private operations under the semi-honest model.
This paper shows new card-based cryptographic protocols with the minimum number of rounds using private operations under the semi-honest model.
This paper shows logical AND, logical XOR, and copy protocols for a standard deck of cards that use the minimum number of cards that any Boolean functions ...
Abstract. This paper proposes new card-based cryptographic protocols with the minimum number of cards using private operations under the semi-honest model.
Abstract: This paper shows new card-based cryptographic protocols with the minimum number of rounds, using private operations under the semi-honest model.
This paper proposes new card-based cryptographic protocols with the minimum number of cards using private operations under the semi-honest model.
In the subsequent Section 6 we show that five cards are necessary for finite-runtime protocols. In Section 7 we state a Las Vegas protocol for general boolean ...
This paper proposes new card-based cryptographic protocols to calculate logic functions with the minimum number of cards using private operations under the semi ...
The number of rounds is defined to evaluate the efficiency of the protocols using private operations to show new card-based cryptographic protocols with the ...