A suggestion for restricted definitions and their benefits Oded Goldreich...  Home/Search
Context
Related
| iacr.org/2006/277.ps.gz 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: This paper concerns the possibility of developing a coherent theory of security when feasibility is associated with expected probabilistic polynomial-time (expected PPT). The source of difficulty is that the known definitions of expected PPT strategies (i.e., expected PPT interactive machines) do not support natural results of the type presented below. (Update)
Active bibliography (related documents): More All
0.4: Zero-Knowledge twenty years after its invention - Goldreich (2002) (Correct)
0.2: Strict Polynomial-time in Simulation and Extraction - Barak, Lindell (2002) (Correct)
0.2: Foundations of Cryptography - Goldreich (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ restricted-expected,
author = "Suggestion For Restricted",
title = "On Expected Probabilistic Polynomial-Time Adversaries:",
url = "citeseer.ist.psu.edu/758872.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
194 Proofs that Yield Nothing but their Validity or All Language.. (context) - Goldreich, Micali et al. - 1986
189 Universally Composable Security: A New Paradigm for Cryptogr.. - Canetti - 2001
179 Security and Composition of Multi-party Cryptographic Protoc.. - Canetti - 2000
99 Foundation of Cryptography: Basic Tools (context) - Goldreich - 2001
94 Concurrent Zero-Knowledge - Dwork, Naor et al. - 1998
67 Definitions and Properties of Zero-Knowledge Proof Systems - Goldreich, Oren - 1994
63 How to Construct Constant-Round Zero-Knowledge Proof Systems.. - Goldreich, Kahan - 1988
56 How to Go Beyond the Black-Box Simulation Barrier - Barak - 2001
33 Resettable Zero-Knowledge - Canetti, Goldreich et al. - 2000
22 Alternative Models for Zero-Knowledge Interactive Proofs (context) - Feige - 1990
16 Foundation of Cryptography: Basic Applications (context) - Goldreich - 2004
14 Strict Polynomial-time in Simulation and Extraction - Barak, Lindell - 2002
13 Universal arguments and their applications - Barak, Goldreich - 2002
11 General Composition and Universal Composability in Secure Mu.. - Lindell - 2003
6 Notes on Levin's Theory of Average-Case Complexity (context) - Goldreich - 1997
1 Handling Expected Polynomial-Time Strategies in SimulationBa.. (context) - Katz, Lindell - 2005
1 Local Zero-Knowledge (context) - Micali, Pass - 2006
1 Alternatives to expected probabilistic polynomial-time (context) - Vadhan - 2006
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