- Full text PDF available (20)
- This year (2)
- Last five years (30)
= 0 = 1 ？？ ？ ？ a b a∧b = 1 a∧b = 0 ？？ ？ ？ a b ？ ？ Abstract Abstract 3 The five-card trick, by Bert den Boer [Eurocrypt 89], securely computes AND using 5 cards. ？？ ？ ？ a b a∧b = 1 a∧b = 0 Abstract 4 The five-card trick, by den Boer [Eurocrypt 89], securely computes AND using 5 cards. This paper gives a protocol which securely computes AND using 4… (More)
It is known that secure multi-party computations can be achieved using a number of black and red physical cards (with identical backs). In previous studies on such card-based cryptographic protocols, typically an ideal situation where all players are semi-honest and all cards of the same suit are indistinguishable from one another was assumed. In this… (More)
Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share information-theoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the notion of an Eulerian secret key exchange, in which the pairs of players… (More)
— This paper proposes a spectrum analysis method to identify the frequency band that can be used to perform power analysis attacks against cryptographic modules. The proposed method conducts Differential Power Analysis (DPA) in the frequency domain instead of the time domain. The result is then used to identify the frequency bands containing information… (More)
3 There are 2 candidates and n voters. 2 candidates n voters election Abstract 4 There are 2 candidates and n voters. Usually, n ballot papers are required. 2 candidates n voters election n ballot papers Abstract 5 There are 2 candidates and n voters. Usually, n ballot papers are required. We show O(log n) cards conduct an election.