## CryptoDB

### Takuya Yoshida

#### Publications

Year
Venue
Title
2002
PKC
2001
EPRINT
In this paper, we first show that three public-key $(k,n)$-traceability schemes can be derived from an $[n,u,d]$-linear code ${\cal C}$ such that $d \geq 2k+1$. The previous schemes are obtained as special cases. This observation gives a more freedom and a new insight to this field. For example, we show that Boneh-Franklin scheme is equivalent to a slight modification of the corrected Kurosawa-Desmedt scheme. This means that BF scheme is redundant or overdesigned because the modified KD scheme is much simpler. It is also shown that the corrected KD scheme is the best among them.
1998
ASIACRYPT

#### Coauthors

Mike Burmester (1)
Yvo Desmedt (1)
Kaoru Kurosawa (3)