Strict Polynomial-time in Simulation and Extraction

Strict Polynomial-time in Simulation and Extraction (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Boaz Barak , Yehuda Lindell

Citations:

39 - 8 self

BibTeX

@MISC{Barak04strictpolynomial-time,
    author = {Boaz Barak and Yehuda Lindell},
    title = {Strict Polynomial-time in Simulation and Extraction},
    year = {2004}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain constant-round

Citations

892	C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
327	Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems - Goldreich, Micali, et al. - 1991
289	Zero Knowledge Proofs of Identity - Feige, Fiat, et al. - 1987
264	Minimum Disclosure Proofs of Knowledge - Brassard, Chaum, et al. - 1988
206	Bit Commitment Using Pseudo-Randomness - Naor - 1991
175	How to go beyond the black-box simulation barrier - Barak - 1997
174	Average case complete problems - Levin - 1986
168	On the composition of zero-knowledge proof systems - Goldreich, Krawczyk - 1996
150	Witness indistinguishable and witness hiding protocols - Feige, Shamir - 1990
143	Multiple non-interactive zero knowledge proofs based on a single random string - Feige, Lapidot, et al. - 1990
140	Concurrent zero-knowledge - Dwork, Naor, et al. - 1998
132	How to construct constant-round zeroknowledge proof systems for NP - Goldreich, Kahan - 1996
121	On Defining Proofs of Knowledge - Bellare, Goldreich - 1993
120	C.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole - Alexi, Chor, et al. - 1988
113	Foundations of Cryptography: Volume 2 – Basic Applications - Goldreich - 2004
99	Definitions and properties of zero-knowledge proof systems - Goldreich, Oren - 1994
94	Zero knowledge proofs of knowledge in two rounds - Feige, Shamir - 1989
91	How to prove a theorem so no one else can claim it - Blum - 1987
77	Foundations of Cryptography: Volume 1, Basic Tools - Goldreich - 2007
72	Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information - Tompa, Woll - 1987
71	Black-box concurrent zero-knowledge requires ˜ω(log n) rounds - Canetti, Kilian, et al. - 2001
69	Parallel coin-tossing and constant-round secure two-party computation - Lindell
64	Secure multi-party computation - Goldreich - 1998
62	Resettable Zero-Knowledge - Canetti, Goldreich, et al. - 2000
49	Universal arguments and their applications - Barak, Goldreich
47	Coin Flipping by Phone - Blum - 1982
34	Alternative Models for Zero-Knowledge Interactive Proofs - Feige - 1990
31	Everything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds - Brassard, Crépeau, et al. - 1989
26	Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation - Bellare, Yung - 1996
23	Primality testing using elliptic curves - Goldwasser, Kilian - 1999
19	Resettably-sound zeroknowledge and its applications - Barak, Goldreich, et al. - 2001
15	Notes on Levin’s Theory of Average-Case Complexity. This volume. See also ECCC - Goldreich - 1997
2	Universal Arguments and their Applications. Report 2001/105,Cryptology ePrint Archive. http://eprint.iacr.org (Full version of this work.) [8] M. Bellare and O. Goldreich. On Defining Proofs of Knowledge - Barak, Goldreich
2	Coin by phone - Blum - 1982
1	Record 2001/051, Cryptology ePrint Archive, June 2001. An extended abstract appeared - Rounds - 2001
1	Resettable Zero-Knowledge. Cryptology ePrint Archive - Canetti, Goldreich, et al. - 1999