Skip to main content

A Class of I.P.P. Codes with Efficient Identification

New Image

An explicit construction is presented of t-i.p.p. codes of rate bounded away from zero, for which identification can be accomplished with complexity poly(n).