Scalable Extensions of Nonscalable Schemes

Abstract

Notwithstanding several advantages over deterministic schemes, probabilistic schemes like RPS and HARPS suffer from the fact that the computational overhead for public functions is proportional to the achievable collusion resistance $n$. In this chapter, 3 scalable extensions of non-scalable schemes are discussed. For all such schemes the public function complexity is also small, and does not depend on the achievable collusion resistance $n$. This chapter also proposes an $(n \phi, \alpha)$-security model (in addition to the $(n,p)$-model for probabilistic KPSs) to study the effect of an attacker’s ability to perform brute-force searches.