Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

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. [Pg.223]

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

Local verification algorithm all jest (for acceptable and good prekeys) ... [Pg.301]

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. [Pg.314]


See other pages where Local verification algorithm is mentioned: [Pg.191]    [Pg.216]    [Pg.247]    [Pg.253]    [Pg.339]    [Pg.191]    [Pg.216]    [Pg.247]    [Pg.253]    [Pg.339]    [Pg.300]    [Pg.77]    [Pg.406]    [Pg.47]    [Pg.320]    [Pg.518]    [Pg.128]    [Pg.529]    [Pg.842]    [Pg.679]   
See also in sourсe #XX -- [ Pg.191 ]




SEARCH



Verification

© 2024 chempedia.info