-
1
-
-
0032058198
-
-
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, Journal of the ACM, 45, pp. 501-555, 1998, (preliminary version in 33rd FOCS, 1992).
-
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and intractability of approximation problems," Journal of the ACM, vol. 45, pp. 501-555, 1998, (preliminary version in 33rd FOCS, 1992).
-
-
-
-
2
-
-
0031651077
-
-
S. Arora and S. Safra, Probabilistic checkable proofs: A new characterization of NP, Journal of the ACM, 45, pp. 70-122, 1998, (preliminary version in 33rd FOCS, 1992).
-
S. Arora and S. Safra, "Probabilistic checkable proofs: A new characterization of NP," Journal of the ACM, vol. 45, pp. 70-122, 1998, (preliminary version in 33rd FOCS, 1992).
-
-
-
-
4
-
-
85028539051
-
Checking computations in polylogarithmic time
-
L. Babai, L. Fortnow, L. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," in 23rd ACM Symposium on the Theory of Computing, pp. 21-31, 1991.
-
(1991)
23rd ACM Symposium on the Theory of Computing
, pp. 21-31
-
-
Babai, L.1
Fortnow, L.2
Levin, L.3
Szegedy, M.4
-
5
-
-
0002771903
-
-
L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Computational Complexity, 1, no. 1, pp. 3-40, 1991, (preliminary version in 31st STOC, 1990).
-
L. Babai, L. Fortnow, and C. Lund, "Non-deterministic exponential time has two-prover interactive protocols," Computational Complexity, vol. 1, no. 1, pp. 3-40, 1991, (preliminary version in 31st STOC, 1990).
-
-
-
-
6
-
-
0023995534
-
Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes
-
L. Babai and S. Moran, "Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes," Journal of Computer and System Science, vol. 36, pp. 254-276, 1988.
-
(1988)
Journal of Computer and System Science
, vol.36
, pp. 254-276
-
-
Babai, L.1
Moran, S.2
-
8
-
-
0542423500
-
Free bits, PCPs and nonapproximability - towards tight results
-
extended abstract in 36th FOCS, 1995
-
M. Bellare, O. Goldreich, and M. Sudan, "Free bits, PCPs and nonapproximability - towards tight results," SIAM Journal on Computing, vol. 27, no. 3, pp. 804-915, 1998, (extended abstract in 36th FOCS, 1995).
-
(1998)
SIAM Journal on Computing
, vol.27
, Issue.3
, pp. 804-915
-
-
Bellare, M.1
Goldreich, O.2
Sudan, M.3
-
9
-
-
0031334110
-
Does parallel repetition lower the error in computationally sound protocols?
-
M. Bellare, R. Impagliazzo, and M. Naor, "Does parallel repetition lower the error in computationally sound protocols?," in 38th IEEE Symposium on Foundations of Computer Science, pp. 374-383, 1997.
-
(1997)
38th IEEE Symposium on Foundations of Computer Science
, pp. 374-383
-
-
Bellare, M.1
Impagliazzo, R.2
Naor, M.3
-
10
-
-
85031771268
-
Everything provable is probable in zero-knowledge
-
Springer-Verlag Notes in Computer Science
-
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Håstad, J. Kilian, S. Micali, and P. Rogaway, "Everything provable is probable in zero-knowledge," in Crypto88, vol. 403, pp. 37-56, Springer-Verlag Notes in Computer Science, 1990.
-
(1990)
Crypto88
, vol.403
, pp. 37-56
-
-
Ben-Or, M.1
Goldreich, O.2
Goldwasser, S.3
Håstad, J.4
Kilian, J.5
Micali, S.6
Rogaway, P.7
-
11
-
-
84898945449
-
Multi-prover interactive proofs: How to remove intractability
-
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, "Multi-prover interactive proofs: How to remove intractability," in 20th ACM Symposium on the Theory of Computing, pp. 113-131, 1988.
-
(1988)
20th ACM Symposium on the Theory of Computing
, pp. 113-131
-
-
Ben-Or, M.1
Goldwasser, S.2
Kilian, J.3
Wigderson, A.4
-
12
-
-
34547829716
-
Robust PCPs of proximity, shorter PCPs, and applications to coding
-
extended abstract in 36th STOC, 2004
-
E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan, "Robust PCPs of proximity, shorter PCPs, and applications to coding," SIAM Journal on Computing, vol. 36, no. 4, pp. 889-974, 2006, (extended abstract in 36th STOC, 2004).
-
(2006)
SIAM Journal on Computing
, vol.36
, Issue.4
, pp. 889-974
-
-
Ben-Sasson, E.1
Goldreich, O.2
Harsha, P.3
Sudan, M.4
Vadhan, S.5
-
14
-
-
0000619172
-
Self-testing/correcting with applications to numerical problems
-
M. Blum, M. Luby, and R. Rubinfeld, "Self-testing/correcting with applications to numerical problems," Journal of Computer and System Science, vol. 47, no. 3, pp. 549-595, 1993.
-
(1993)
Journal of Computer and System Science
, vol.47
, Issue.3
, pp. 549-595
-
-
Blum, M.1
Luby, M.2
Rubinfeld, R.3
-
15
-
-
0023646410
-
Does Co-NP have short interactive proofs?
-
May
-
R. Boppana, J. Håstad, and S. Zachos, "Does Co-NP have short interactive proofs?," Information Processing Letters, vol. 25, pp. 127-132, May 1987.
-
(1987)
Information Processing Letters
, vol.25
, pp. 127-132
-
-
Boppana, R.1
Håstad, J.2
Zachos, S.3
-
16
-
-
0000867507
-
-
G. Brassard, D. Chaum, and C. Crépeau, Minimum disclosure proofs of knowledge, Journal of Computer and System Science, 37, no. 2, pp. 156-189, 1988, (preliminary version by Brassard and Crépeau in 27th FOCS, 1986).
-
G. Brassard, D. Chaum, and C. Crépeau, "Minimum disclosure proofs of knowledge," Journal of Computer and System Science, vol. 37, no. 2, pp. 156-189, 1988, (preliminary version by Brassard and Crépeau in 27th FOCS, 1986).
-
-
-
-
18
-
-
0032662982
-
Characterizations of NP: Towards a polynomially-small error-probability
-
I. Dinur, E. Fischer, G. Kindler, R. Raz, and S. Safra, "Characterizations of NP: Towards a polynomially-small error-probability," in 31st ACM Symposium on the Theory of Computing, pp. 29-40, 1999.
-
(1999)
31st ACM Symposium on the Theory of Computing
, pp. 29-40
-
-
Dinur, I.1
Fischer, E.2
Kindler, G.3
Raz, R.4
Safra, S.5
-
19
-
-
34547829715
-
Assignment-testers: Towards a combinatorial proof of the PCP-Theorem
-
extended abstract in 45th STOC, 2004
-
I. Dinur and O. Reingold, "Assignment-testers: Towards a combinatorial proof of the PCP-Theorem," SIAM Journal on Computing, vol. 36, no. 4, pp. 975-1024, 2006, (extended abstract in 45th STOC, 2004).
-
(2006)
SIAM Journal on Computing
, vol.36
, Issue.4
, pp. 975-1024
-
-
Dinur, I.1
Reingold, O.2
-
20
-
-
63649126239
-
On the complexity of approximating the maximum size of a clique
-
Unpublished manuscript
-
U. Feige, S. Goldwasser, L. Lovász, and S. Safra, "On the complexity of approximating the maximum size of a clique," Unpublished manuscript, 1990.
-
(1990)
-
-
Feige, U.1
Goldwasser, S.2
Lovász, L.3
Safra, S.4
-
21
-
-
0030100766
-
-
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete, Journal of the ACM, 43, pp. 268-292, 1996, (preliminary version in 32nd STOC, 1991).
-
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, "Approximating clique is almost NP-complete," Journal of the ACM, vol. 43, pp. 268-292, 1996, (preliminary version in 32nd STOC, 1991).
-
-
-
-
22
-
-
63649083199
-
-
L. Fortnow, J. Rompel, and M. Sipser, On the power of multi-prover interactive protocols, in 3rd IEEE Symposium on Structure in Complexity Theory, pp. 156-161, 1988. (See errata in 5th IEEE Symposium on Structure in Complexity Theory pages 318-319, 1990).
-
L. Fortnow, J. Rompel, and M. Sipser, "On the power of multi-prover interactive protocols," in 3rd IEEE Symposium on Structure in Complexity Theory, pp. 156-161, 1988. (See errata in 5th IEEE Symposium on Structure in Complexity Theory pages 318-319, 1990).
-
-
-
-
23
-
-
0003351499
-
On completeness and soundness in interactive proof systems
-
S. Micali, ed, pp
-
M. Fürer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, "On completeness and soundness in interactive proof systems," in Advances in Computing Research: A Research Annual, (S. Micali, ed.), pp. 429-442, 1989.
-
(1989)
Advances in Computing Research: A Research Annual
, pp. 429-442
-
-
Fürer, M.1
Goldreich, O.2
Mansour, Y.3
Sipser, M.4
Zachos, S.5
-
24
-
-
0011247227
-
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
-
Springer
-
O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Algorithms and Combinatorics Series, vol. 17. Springer, 1999.
-
(1999)
Algorithms and Combinatorics Series
, vol.17
-
-
Goldreich, O.1
-
28
-
-
0023545076
-
How to play any mental game - A completeness theorem for protocols with honest majority
-
O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game - A completeness theorem for protocols with honest majority," in 19th ACM Symposium on the Theory of Computing, pp. 218-229, 1987.
-
(1987)
19th ACM Symposium on the Theory of Computing
, pp. 218-229
-
-
Goldreich, O.1
Micali, S.2
Wigderson, A.3
-
29
-
-
71149116146
-
-
O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM, 38, no. 3, pp. 691-729, 1991, (preliminary version in 27th STOC, 1986).
-
O. Goldreich, S. Micali, and A. Wigderson, "Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems," Journal of the ACM, vol. 38, no. 3, pp. 691-729, 1991, (preliminary version in 27th STOC, 1986).
-
-
-
-
31
-
-
0242381728
-
On interactive proofs with a laconic provers
-
O. Goldreich, S. Vadhan, and A. Wigderson, "On interactive proofs with a laconic provers," Computational Complexity, vol. 11, pp. 1-53, 2002.
-
(2002)
Computational Complexity
, vol.11
, pp. 1-53
-
-
Goldreich, O.1
Vadhan, S.2
Wigderson, A.3
-
32
-
-
0024611659
-
-
S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18, pp. 186-208, 1989, (preliminary version in 17th STOC, 1985. Earlier versions date to 1982).
-
S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM Journal on Computing, vol. 18, pp. 186-208, 1989, (preliminary version in 17th STOC, 1985. Earlier versions date to 1982).
-
-
-
-
33
-
-
0001796243
-
Private coins versus public coins in interactive proof systems
-
S. Micali, ed, pp, extended abstract in 18th STOC, 1986. Extended abstract in 18th STOC, pp. 59-68, 1986
-
S. Goldwasser and M. Sipser, "Private coins versus public coins in interactive proof systems," in Advances in Computing Research: A Research Annual, (S. Micali, ed.), pp. 73-90, 1989, (extended abstract in 18th STOC, 1986. Extended abstract in 18th STOC, pp. 59-68, 1986).
-
(1989)
Advances in Computing Research: A Research Annual
, pp. 73-90
-
-
Goldwasser, S.1
Sipser, M.2
-
34
-
-
0032319635
-
A tight characterization of NP with 3 query PCPs
-
V. Guruswami, D. Lewin, M. Sudan, and L. Trevisan, "A tight characterization of NP with 3 query PCPs," in 39th IEEE Symposium on Foundations of Computer Science, pp. 8-17, 1998.
-
(1998)
39th IEEE Symposium on Foundations of Computer Science
, pp. 8-17
-
-
Guruswami, V.1
Lewin, D.2
Sudan, M.3
Trevisan, L.4
-
35
-
-
0000109157
-
-
1-ε, Acta Mathematica, 182, pp. 105-142, 1999, (preliminary versions in 28th STOC (1996) and 37th STOC (1996)).
-
1-ε," Acta Mathematica, vol. 182, pp. 105-142, 1999, (preliminary versions in 28th STOC (1996) and 37th STOC (1996)).
-
-
-
-
36
-
-
0000844603
-
Getting optimal in-approximability results
-
extended abstract in 29th STOC, 1997
-
J. Håstad, "Getting optimal in-approximability results," Journal of the ACM, vol. 48, pp. 798-859, 2001, (extended abstract in 29th STOC, 1997).
-
(2001)
Journal of the ACM
, vol.48
, pp. 798-859
-
-
Håstad, J.1
-
38
-
-
85028775577
-
Direct Zero-Knowledge Computations
-
Crypto87
-
R. Impagliazzo and M. Yung, "Direct Zero-Knowledge Computations," in Crypto87, vol. 293, pp. 40-51, Springer-Verlag Lecture Notes in Computer Science, 1987.
-
(1987)
Springer-Verlag Lecture Notes in Computer Science
, vol.293
, pp. 40-51
-
-
Impagliazzo, R.1
Yung, M.2
-
39
-
-
0026963441
-
A note on efficient zero-knowledge proofs and arguments
-
J. Kilian, "A note on efficient zero-knowledge proofs and arguments," in 24th ACM Symposium on the Theory of Computing, pp. 723-732, 1992.
-
(1992)
24th ACM Symposium on the Theory of Computing
, pp. 723-732
-
-
Kilian, J.1
-
40
-
-
0026930922
-
-
C. Lund, L. Fortnow, H. Karloff, and N. Nisan, Algebraic methods for interactive proof systems, Journal of the ACM, 39, no. 4, pp. 859-868, 1992, (preliminary version in 31st STOC, 1990).
-
C. Lund, L. Fortnow, H. Karloff, and N. Nisan, "Algebraic methods for interactive proof systems," Journal of the ACM, vol. 39, no. 4, pp. 859-868, 1992, (preliminary version in 31st STOC, 1990).
-
-
-
-
41
-
-
0034854953
-
-
S. Micali, Computationally sound proofs, SIAM Journal on Computing, 30, no. 4, pp. 1253-1298, 2000, (preliminary version in 35th STOC, 1994).
-
S. Micali, "Computationally sound proofs," SIAM Journal on Computing, vol. 30, no. 4, pp. 1253-1298, 2000, (preliminary version in 35th STOC, 1994).
-
-
-
-
42
-
-
29144500344
-
-
P. B. Miltersen and N. V. Vinodchandran, Derandomizing Arthur-Merlin games using hitting sets, Computational Complexity, 14, no. 3, pp. 256-279, 2005, (preliminary version in 40th STOC, 1999).
-
P. B. Miltersen and N. V. Vinodchandran, "Derandomizing Arthur-Merlin games using hitting sets," Computational Complexity, vol. 14, no. 3, pp. 256-279, 2005, (preliminary version in 40th STOC, 1999).
-
-
-
-
43
-
-
0027641832
-
-
J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM Journal on Computing, 22, pp. 838-856, 1993, (preliminary version in 22nd STOC, 1990).
-
J. Naor and M. Naor, "Small-bias probability spaces: Efficient constructions and applications," SIAM Journal on Computing, vol. 22, pp. 838-856, 1993, (preliminary version in 22nd STOC, 1990).
-
-
-
-
44
-
-
38149096534
-
Statistical zero-knowledge arguments for NP from any one-way function
-
M. Nguyen, S. J. Ong, and S. Vadhan, "Statistical zero-knowledge arguments for NP from any one-way function," in 47th IEEE Symposium on Foundations of Computer Science, pp. 3-14, 2006.
-
(2006)
47th IEEE Symposium on Foundations of Computer Science
, pp. 3-14
-
-
Nguyen, M.1
Ong, S.J.2
Vadhan, S.3
-
45
-
-
38049052188
-
Parallel repetition of computationally sound protocols, revisited
-
4th TCC, Springer
-
K. Pietrzak and D. Wikström, "Parallel repetition of computationally sound protocols, revisited," in 4th TCC, vol. 4392, pp. 86-102, Springer, Lecture Notes in Computer Science, 2007.
-
(2007)
Lecture Notes in Computer Science
, vol.4392
, pp. 86-102
-
-
Pietrzak, K.1
Wikström, D.2
-
46
-
-
0001226672
-
A parallel repetition theorem
-
extended abstract in 27th STOC, 1995
-
R. Raz, "A parallel repetition theorem," SIAM Journal on Computing, vol. 27, no. 3, pp. 763-803, 1998, (extended abstract in 27th STOC, 1995).
-
(1998)
SIAM Journal on Computing
, vol.27
, Issue.3
, pp. 763-803
-
-
Raz, R.1
-
47
-
-
0030128622
-
Robust characterization of polynomials with applications to program testing
-
R. Rubinfeld and M. Sudan, "Robust characterization of polynomials with applications to program testing," SIAM Journal on Computing, vol. 25, no. 2, pp. 252-271, 1996.
-
(1996)
SIAM Journal on Computing
, vol.25
, Issue.2
, pp. 252-271
-
-
Rubinfeld, R.1
Sudan, M.2
-
48
-
-
0026930543
-
-
A. Shamir, IP = PSPACE, Journal of the ACM, 39, no. 4, pp. 869-877, 1992, (preliminary version in 31st STOC, 1990).
-
A. Shamir, "IP = PSPACE," Journal of the ACM, vol. 39, no. 4, pp. 869-877, 1992, (preliminary version in 31st STOC, 1990).
-
-
-
-
49
-
-
0012526106
-
A study of statistical zero-knowledge proofs,
-
PhD Thesis, Department of Mathematics, MIT, available from
-
S. Vadhan, "A study of statistical zero-knowledge proofs," PhD Thesis, Department of Mathematics, MIT, available from http:// www.eecs.harvard.edu/~salil/papers/phdthesis-abs.html, 1999.
-
(1999)
-
-
Vadhan, S.1
-
50
-
-
34547839124
-
An unconditional study of computational zero knowledge
-
extended abstract in 45th STOC, 2004
-
S. Vadhan, "An unconditional study of computational zero knowledge," SIAM Journal on Computing, vol. 36, no. 4, pp. 1160-1214, 2006, (extended abstract in 45th STOC, 2004).
-
(2006)
SIAM Journal on Computing
, vol.36
, Issue.4
, pp. 1160-1214
-
-
Vadhan, S.1
-
51
-
-
0032266121
-
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
-
U. Zwick, "Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint," in 9th SODA, pp. 201-210, 1998.
-
(1998)
9th SODA
, pp. 201-210
-
-
Zwick, U.1
|