E. Bibare and A. Shulman. Memory Efficient Divisible Electronic Cash. In CARDIS '98, LNCS 1820. Springer-Verlag, 2000.  Home/Search   Document Not in Database   Summary   Related Articles

.... know how to prove the zero knowledge property if the verifier can bias the distribution of the challenges when they are large enough, i.e. Order of the multiplicative group KNOWN UNKNOWN Chaum Everste van de Graaf Peralta [7, 6] Order of g Beth [al Girault [12] KNOWN Schnorr [27] Biham Shulnmn [4] Okamoto [24] Order of g Girault Poupard Stern [13, 25] Brickell McCurley 5] UNKNOWN Poupard Stern [26] Fig. 1. Discrete log related schemes when B is non polynomial. As a consequence, we can only prove the security of Schnorr identification against passive adversaries. A solution proposed ....

E. Bibare and A. Shulman. Memory Efficient Divisible Electronic Cash. In CARDIS '98, LNCS 1820. Springer-Verlag, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC