Local verification algorithm

Some properties also hold if n is not a generalized Blum integer. Thus one can sometimes omit a zero-knowledge proof (see the end of Section 8.1.3) and use a more efficient local verification algorithm. Hence most definitions are presented for more general integers n. 

As usual, an implementation of this construction is particularly simple if the zero-knowledge proof scheme is only a local verification algorithm. 

Local verification algorithm all jest (for acceptable and good prekeys) ... 

A local verification algorithm for AllFam i.e., an algorithm all test° that, on input ( 1 , K°) decides if K" AIVin time polynomial in the first input alone. 

---