메뉴 건너뛰기




Volumn Part F129502, Issue , 1994, Pages 172-183

Two prover protocols - Low error at affordable rates

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; ERROR ANALYSIS; ERROR CORRECTION; PROBABILISTIC LOGICS; RANDOM PROCESSES; THEOREM PROVING;

EID: 0027964132     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195128     Document Type: Conference Paper
Times cited : (48)

References (34)
  • 2
    • 0002640262 scopus 로고    scopus 로고
    • Proof verification and intractability of approximation problems
    • S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, "Proof verification and intractability of approximation problems", FOCS 92, 14-23.
    • FOCS , vol.92 , pp. 14-23
    • Arora, S.1    Lund, C.2    Motwani, R.3    Sudan, M.4    Szegedy, M.5
  • 3
    • 0002336419 scopus 로고    scopus 로고
    • Checking computations in polylogarithmic time
    • L. Babai, L. Fortnow, L. Levin, M. Szegedy, "Checking computations in polylogarithmic time", STOC 91, 2131.
    • STOC , vol.91 , pp. 2131
    • Babai, L.1    Fortnow, L.2    Levin, L.3    Szegedy, M.4
  • 4
    • 84976682195 scopus 로고    scopus 로고
    • Non-deterministic exponential time has two-prover interactive protocols
    • L. Babai, L. Fortnow, C. Lund, "Non-Deterministic Exponential Time has Two-Prover Interactive Protocols", FOGS 90, 16-25.
    • FOGS , vol.90 , pp. 16-25
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 5
    • 0013117132 scopus 로고    scopus 로고
    • Interactive proofs and approximation
    • M. Bellare, "Interactive proofs and approximation", ISTCS 93, 266-274.
    • ISTCS , vol.93 , pp. 266-274
    • Bellare, M.1
  • 6
    • 0027308413 scopus 로고    scopus 로고
    • Efficient probabilistic checkable proofs and applications to approximation
    • M. Bellare, S. Goldwasser, C. Lund, A. Russell, "Efficient probabilistic checkable proofs and applications to approximation", STOC 93, 294-304.
    • STOC , vol.93 , pp. 294-304
    • Bellare, M.1    Goldwasser, S.2    Lund, C.3    Russell, A.4
  • 7
    • 0345581486 scopus 로고
    • The complexity of approximating a nonlinear program
    • P. Pardalos, ed. World Scientific
    • M. Bellare, P. Rogaway, "The complexity of approximating a nonlinear program", In: Complexity in numerical optimization, P. Pardalos, ed., World Scientific, 1993.
    • (1993) Complexity in Numerical Optimization
    • Bellare, M.1    Rogaway, P.2
  • 8
    • 85031324812 scopus 로고    scopus 로고
    • Improved non-Approximability results
    • M. Bellare, M. Sudan, "Improved non-Approximability results", STOC 94.
    • STOC , vol.94
    • Bellare, M.1    Sudan, M.2
  • 9
    • 84898945449 scopus 로고    scopus 로고
    • Multi prover interactive proofs: How to remove intractability
    • M. Ben-or, S. Goldwasser, J. Kilian, A. Wigderson, "Multi Prover Interactive Proofs: How to Remove Intractability", STOC 88, 113-131.
    • STOC , vol.88 , pp. 113-131
    • Ben-Or, M.1    Goldwasser, S.2    Kilian, J.3    Wigderson, A.4
  • 10
    • 84990834089 scopus 로고    scopus 로고
    • Efficient identification schemes using two prover interactive proofs
    • M. Ben-or, S. Goldwasser, J. Kilian, A. Wigderson, "Efficient identification schemes using two prover interactive proofs", Crypto 89, 498-506.
    • Crypto , vol.89 , pp. 498-506
    • Ben-Or, M.1    Goldwasser, S.2    Kilian, J.3    Wigderson, A.4
  • 11
    • 0026624588 scopus 로고
    • On the complexity of approximating the independent set problem
    • P. Berman, G. Schnitger, "On the Complexity of Approximating the Independent Set Problem", Information and Computation, Vol. 96, 77-94, 1992.
    • (1992) Information and Computation , vol.96 , pp. 77-94
    • Berman, P.1    Schnitger, G.2
  • 12
    • 0025686844 scopus 로고    scopus 로고
    • On bounded round multi-prover interactive proof systems
    • J. Cai, A. Condon, R. Lipton, "On Bounded Round Multi-Prover Interactive Proof Systems", Structures 90, 45-54.
    • Structures , vol.90 , pp. 45-54
    • Cai, J.1    Condon, A.2    Lipton, R.3
  • 13
    • 85031323414 scopus 로고    scopus 로고
    • Playing games of incomplete information
    • J. Cai, A. Condon, R. Lipton, "Playing Games of Incomplete Information", STACS 90.
    • STACS , vol.90
    • Cai, J.1    Condon, A.2    Lipton, R.3
  • 14
    • 0026373973 scopus 로고    scopus 로고
    • PSPACEis provable by two provers in one round
    • J. Cai, A. Condon, R. Lipton, "PSPACEis Provable by Two Provers in One Round", Structures 91, 110-115.
    • Structures , vol.91 , pp. 110-115
    • Cai, J.1    Condon, A.2    Lipton, R.3
  • 15
    • 0000182415 scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observa-Tions
    • H. ChernofF, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations", Annals of Math. Stat., 23:493-509, 1952.
    • (1952) Annals of Math. Stat , vol.23 , pp. 493-509
    • ChernofF, H.1
  • 16
    • 85030042716 scopus 로고    scopus 로고
    • Low Communication, 2-Prover zero-knowledge proofs for NP
    • C. Dwork, U. Feige, J. Kilian, M. Naor, S. Safra, "Low Communication, 2-Prover Zero-Knowledge Proofs for NP" Crypto 92, 217-229.
    • Crypto , vol.92 , pp. 217-229
    • Dwork, C.1    Feige, U.2    Kilian, J.3    Naor, M.4    Safra, S.5
  • 17
    • 0026393591 scopus 로고    scopus 로고
    • On the success probability of the two provers in one round proof systems
    • U. Feige, "On the Success Probability of the Two Provers in One Round Proof Systems", Structures 91, 116-123.
    • Structures , vol.91 , pp. 116-123
    • Feige, U.1
  • 19
    • 0026991175 scopus 로고
    • Two-prover one-round proof systems, their power and their problems
    • U. Feige, L. Lovasz, "Two-prover one-round proof systems, their power and their problems", STOC 1992, 733-744.
    • (1992) STOC , pp. 733-744
    • Feige, U.1    Lovasz, L.2
  • 21
    • 0023728126 scopus 로고    scopus 로고
    • On the power of multi-prover interactive protocols
    • L. Fortnow, J. Rompel, M. Sipser, "On the Power of Multi-Prover Interactive Protocols", Structures 88, 156-161.
    • Structures , vol.88 , pp. 156-161
    • Fortnow, L.1    Rompel, J.2    Sipser, M.3
  • 22
    • 0542433619 scopus 로고    scopus 로고
    • Errata for on the power of multi-prover interactive protocols
    • L. Fortnow, J. Rompel, M. Sipser, "Errata for On the Power of Multi-Prover Interactive Protocols", Structures 90, 318-319.
    • Structures , vol.90 , pp. 318-319
    • Fortnow, L.1    Rompel, J.2    Sipser, M.3
  • 23
    • 0024611659 scopus 로고
    • The knowledge complexity of interactive proof systems
    • S. Goldwasser, S. Micali, C. Rackoff, "The Knowledge Complexity of Interactive Proof Systems", SI AM Journal on Computing, 18 1, 1989, 186-208.
    • (1989) SI AM Journal on Computing , vol.18 , Issue.1 , pp. 186-208
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 24
    • 0542433620 scopus 로고
    • Strong separation models of multi prover interactive proofs
    • October
    • J. Kilian, "Strong Separation Models of Multi Prover Interactive Proofs" DIM ACS Workshop on Cryptography, October 1990.
    • (1990) DIM ACS Workshop on Cryptography
    • Kilian, J.1
  • 26
    • 0027274447 scopus 로고    scopus 로고
    • Constructing small sample spaces satisfying given constraints
    • D. Koller, N. Megiddo, "Constructing small sample spaces satisfying given constraints", STOC 93, 268-277.
    • STOC 93 , pp. 268-277
    • Koller, D.1    Megiddo, N.2
  • 28
    • 0026400402 scopus 로고    scopus 로고
    • Fully parallelized multi prover protocols for NEXP-Time
    • D. Lapidot, A. Shamir, "Fully Parallelized Multi Prover Protocols for NEXP-Time" FOCS 91, 13-18.
    • FOCS , vol.91 , pp. 13-18
    • Lapidot, D.1    Shamir, A.2
  • 29
    • 0003819663 scopus 로고
    • Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes
    • F. T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes" Morgan Kaufmann, 1992, pp. 167-168.
    • (1992) Morgan Kaufmann , pp. 167-168
    • Leighton, F.T.1
  • 30
    • 0027205882 scopus 로고    scopus 로고
    • On the hardness of approximating minimization problems
    • C. Lund, M. Yannakakis, "On the hardness of approximating minimization problems", STOC 93, 286-293.
    • STOC , vol.93 , pp. 286-293
    • Lund, C.1    Yannakakis, M.2
  • 32
    • 84974318000 scopus 로고
    • From pioneer to freier: The changing models of generalized exchange in Israel
    • L. Roniger, M. Feige, "From Pioneer to Freier: The Changing Models of Generalized Exchange in Israel", European Journal of Sociology, 1992, 33(2), 280-307.
    • (1992) European Journal of Sociology , vol.33 , Issue.2 , pp. 280-307
    • Roniger, L.1    Feige, M.2
  • 33
    • 85031321214 scopus 로고
    • Multi-prover encoding schemes, and 3- prover interactive proofs
    • G. Tardos. "Multi-prover encoding schemes, and 3- prover interactive proofs." Structures, 1994.
    • (1994) Structures
    • Tardos, G.1
  • 34
    • 0028586169 scopus 로고
    • Towards the parallel repetition conjecture
    • O. Verbitsky, "Towards the Parallel Repetition Conjecture", Structures, 1994.
    • (1994) Structures
    • Verbitsky, O.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.