for NP from One Way Functions Vipul Goyal Ryan Moriarty Rafail Ostrovsky Amit ...  Home/Search
Context
Related
| iacr.org/2006/400.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we show a general transformation from any honest verifier statistical zeroknowledge argument to a concurrent statistical zero-knowledge argument. Our transformation uses only one-way functions which are essentially minimal for any non-trivial language [OW93]. (Update)
Active bibliography (related documents): More All
0.0: Statistical Zero-Knowledge Arguments for NP - From Any One-Way (2006) (Correct)
0.0: Black-Box Concurrent Zero-Knowledge Requires (almost) .. - Canetti, Kilian.. (2002) (Correct)
0.0: On Expected Probabilistic Polynomial-Time Adversaries: - Suggestion For Restricted (2006) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ from-concurrent,
author = "For Np From",
title = "Concurrent Statistical Zero-Knowledge Arguments",
url = "citeseer.ist.psu.edu/761784.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988
194 Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
99 Foundation of Cryptography - Basic Tools (context) - Goldreich - 2001
94 Concurrent zero-knowledge - Dwork, Naor et al. - 1998
73 Does co-np have short interactive proofs (context) - Boppana, Hastad et al. - 1987
63 How to construct constant-round zero-knowledge proof systems.. - Goldreich, Kahan - 1996
22 alternative models for zero knowledge interactive proofs (context) - Feige, thesis - 1990
21 A discrete logarithm implementation of perfect zero-knowledg.. (context) - Boyar, Kurtz et al. - 1990
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
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