ABSTRACT
We have shown in the previous chapters that construction of perfect authentication schemes is reduced to construction of strong partially balanced design (SPBD). As we know from literature that there are mainly two kinds of known combinatorial designs, which are SPBD too: t-designs and orthogonal arrays [1]. Some special family of partially balanced incomplete block (PBIB [34]) design can provide SPBD with t = 2. In this chapter we construct a new family of SPBD by means of rational normal curves (RNC) over finite fields. Then we discuss the authentication schemes constructed based on this new SPBD.
