Cryptology ePrint Archive: Report 2002/055

Available versions in chronological order

20020506:231802 (posted 06-May-2002 23:18:02 UTC): Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity; Manoj Prabhakaran and Amit Sahai

[ Cryptology ePrint archive ]