메뉴 건너뛰기




Volumn , Issue , 2008, Pages 113-122

Delegating computation: Interactive proofs for Muggles

Author keywords

Delegating computation; Interactive proofs; Proof verification

Indexed keywords

ADAPTIVENESS; BOOLEAN CIRCUITS; COMMUNICATION COMPLEXITIES; COMPUTATIONAL ASSUMPTIONS; COMPUTATIONAL POWERS; DELEGATING COMPUTATION; DESIGNATED VERIFIERS; EXPRESSIVE POWERS; INTERACTIVE PROOFS; KEY MODELS; LINEAR TIMES; POLYNOMIAL TIMES; PROOF SYSTEMS; PROOF VERIFICATION; PUBLIC KEYS; RANDOM ORACLE MODELS;

EID: 57049095424     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (368)

References (53)
  • 1
    • 57049161708 scopus 로고    scopus 로고
    • ET, phone SETI@home!. Seience@NASA headlines, 1999.
    • ET, phone SETI@home!. Seience@NASA headlines, 1999.
  • 2
    • 57049124608 scopus 로고    scopus 로고
    • The great internet mersenne prime search, project web
    • The great internet mersenne prime search, project webpage. http://www.mersenne.org/, 2007.
    • (2007)
  • 3
    • 57049136885 scopus 로고    scopus 로고
    • SETI@home project website
    • SETI@home project website. http://setiathome.berkeley.edu/, 2007.
    • (2007)
  • 6
    • 10444272266 scopus 로고    scopus 로고
    • BOINC: A system for public-resource computing and storage
    • D. P. Anderson. BOINC: A system for public-resource computing and storage. In GRID, pages 4-10, 2004.
    • (2004) GRID , pp. 4-10
    • Anderson, D.P.1
  • 7
    • 85028925878 scopus 로고
    • Proof verification and hardness of approximation problems
    • S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In FOCS, pages 14-23, 1992.
    • (1992) FOCS , pp. 14-23
    • Arora, S.1    Lund, C.2    Motwani, R.3    Sudan, M.4    Szegedy, M.5
  • 8
    • 0031651077 scopus 로고    scopus 로고
    • Probabilistic checking of proofs: A new characterization of NP
    • S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
    • (1998) Journal of the ACM , vol.45 , Issue.1 , pp. 70-122
    • Arora, S.1    Safra, S.2
  • 9
    • 0021980820 scopus 로고
    • Trading group theory for randomness
    • L. Babai. Trading group theory for randomness. In STOC, pages 421-429, 1985.
    • (1985) STOC , pp. 421-429
    • Babai, L.1
  • 10
    • 85028539051 scopus 로고
    • Checking computations in polylogarithmic time
    • L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In STOC, pages 21-31, 1991.
    • (1991) STOC , pp. 21-31
    • Babai, L.1    Fortnow, L.2    Levin, L.A.3    Szegedy, M.4
  • 11
    • 0025791374 scopus 로고
    • Non-deterministic exponential time has two-prover interactive protocols
    • L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. In FOCS, pages 16-25, 1990.
    • (1990) FOCS , pp. 16-25
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 12
    • 0036294828 scopus 로고    scopus 로고
    • Universal arguments and their applications
    • B. Barak and O. Goldreich. Universal arguments and their applications. In CCC, pages 194-203, 2002.
    • (2002) CCC , pp. 194-203
    • Barak, B.1    Goldreich, O.2
  • 15
    • 84898945449 scopus 로고
    • Multi-prover interactive proofs: How to remove intractability assumptions
    • M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In STOC, pages 113-131, 1988.
    • (1988) STOC , pp. 113-131
    • Ben-Or, M.1    Goldwasser, S.2    Kilian, J.3    Wigderson, A.4
  • 16
    • 4544310411 scopus 로고    scopus 로고
    • Robust peps of proximity, shorter peps and applications to coding
    • E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. P. Vadhan. Robust peps of proximity, shorter peps and applications to coding. In STOC, pages 1-10, 2004.
    • (2004) STOC , pp. 1-10
    • Ben-Sasson, E.1    Goldreich, O.2    Harsha, P.3    Sudan, M.4    Vadhan, S.P.5
  • 19
    • 0029214558 scopus 로고
    • Designing programs that check their work
    • M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 42(1):269-291, 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.1 , pp. 269-291
    • Blum, M.1    Kannan, S.2
  • 20
    • 1642602228 scopus 로고    scopus 로고
    • Computationally private information retrieval with polylogarithmic communication
    • C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT, pages 402-414, 1999.
    • (1999) EUROCRYPT , pp. 402-414
    • Cachin, C.1    Micali, S.2    Stadler, M.3
  • 21
    • 4243180376 scopus 로고    scopus 로고
    • The random oracle methodology, revisited
    • R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. Journal of the ACM, 51(4):557-594, 2004.
    • (2004) Journal of the ACM , vol.51 , Issue.4 , pp. 557-594
    • Canetti, R.1    Goldreich, O.2    Halevi, S.3
  • 22
    • 1642586455 scopus 로고
    • Space-bounded probabilistic game automata
    • A. Condon. Space-bounded probabilistic game automata. Journal of the ACM, 38(2):472-494, 1991.
    • (1991) Journal of the ACM , vol.38 , Issue.2 , pp. 472-494
    • Condon, A.1
  • 24
    • 0024772323 scopus 로고
    • On the complexity of space bounded interactive proofs (extended abstract)
    • A. Condon and R. J. Lipton. On the complexity of space bounded interactive proofs (extended abstract). In FOCS, pages 462-467, 1989. [
    • (1989) FOCS , pp. 462-467
    • Condon, A.1    Lipton, R.J.2
  • 25
    • 34250354807 scopus 로고    scopus 로고
    • The pep theorem by gap amplification
    • I. Dinur. The pep theorem by gap amplification. Journal of the ACM, 54(3):12, 2007.
    • (2007) Journal of the ACM , vol.54 , Issue.3 , pp. 12
    • Dinur, I.1
  • 27
    • 0026930507 scopus 로고
    • Finite state verifiers i: The power of interaction
    • C. Dwork and L. J. Stockmeyer. Finite state verifiers i: The power of interaction. Journal of the ACM, 39(4):800-828, 1992.
    • (1992) Journal of the ACM , vol.39 , Issue.4 , pp. 800-828
    • Dwork, C.1    Stockmeyer, L.J.2
  • 28
    • 0026929494 scopus 로고
    • Finite state verifiers ii: Zero knowledge
    • C. Dwork and L. J. Stockmeyer. Finite state verifiers ii: Zero knowledge. Journal of the ACM, 39(4):829-858, 1992.
    • (1992) Journal of the ACM , vol.39 , Issue.4 , pp. 829-858
    • Dwork, C.1    Stockmeyer, L.J.2
  • 31
    • 84990731886 scopus 로고
    • How to prove yourself: Practical solutions to identification and signature problems
    • A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186-194, 1986.
    • (1986) CRYPTO , pp. 186-194
    • Fiat, A.1    Shamir, A.2
  • 32
    • 0038435616 scopus 로고
    • Complexity-theoretic aspects of interactive proof systems
    • Technical Report MIT/LCS/TR-447, Massachusetts Institute of Technology
    • L. Fortnow. Complexity-theoretic aspects of interactive proof systems. PhD thesis. Technical Report MIT/LCS/TR-447, Massachusetts Institute of Technology, 1989.
    • (1989)
    • Fortnow, L.1
  • 33
    • 0027595217 scopus 로고
    • Interactive proof systems and alternating time-space complexity
    • L. Fortnow and C. Lund. Interactive proof systems and alternating time-space complexity. Theoretical Computer Science, 113(l):55-73, 1993.
    • (1993) Theoretical Computer Science , vol.113 , Issue.L , pp. 55-73
    • Fortnow, L.1    Lund, C.2
  • 34
    • 71149116146 scopus 로고
    • Proofs that yield nothing but their validity, or all languages in np have zero-knowledge proof systems
    • 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(l):691-729, 1991.
    • (1991) Journal of the ACM , vol.38 , Issue.L , pp. 691-729
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 36
    • 0344550529 scopus 로고    scopus 로고
    • On the (in)security of the fiat-shamir paradigm
    • S. Goldwasser and Y. T. Kalai. On the (in)security of the fiat-shamir paradigm. In FOCS, pages 102-, 2003.
    • (2003) FOCS , pp. 102
    • Goldwasser, S.1    Kalai, Y.T.2
  • 37
    • 0024611659 scopus 로고
    • The knowledge complexity of interactive proof-systems
    • S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SI AM Journal on Computing, 18(l):186-208, 1989.
    • (1989) SI AM Journal on Computing , vol.18 , Issue.L , pp. 186-208
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 39
    • 35448945589 scopus 로고    scopus 로고
    • Zero-knowledge from secure multiparty computation
    • Y.Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Zero-knowledge from secure multiparty computation. In STOC, pages 21-30, 2007.
    • (2007) STOC , pp. 21-30
    • Ishai, Y.1    Kushilevitz, E.2    Ostrovsky, R.3    Sahai, A.4
  • 40
    • 38049046515 scopus 로고    scopus 로고
    • Evaluating branching programs on encrypted data
    • Y.Ishai and A. Paskin. Evaluating branching programs on encrypted data. In TCC, pages 575-594, 2007.
    • (2007) TCC , pp. 575-594
    • Ishai, Y.1    Paskin, A.2
  • 41
    • 57049172215 scopus 로고    scopus 로고
    • Y.T. Kalai and R,. Raz. Interactive pep. Technical Report TR07-031, ECCC, 2007.
    • Y.T. Kalai and R,. Raz. Interactive pep. Technical Report TR07-031, ECCC, 2007.
  • 42
    • 57049155208 scopus 로고    scopus 로고
    • Probabilistically checkable arguments
    • Manuscript
    • Y.T. Kalai and R. Raz. Probabilistically checkable arguments. Manuscript, 2007.
    • (2007)
    • Kalai, Y.T.1    Raz, R.2
  • 43
    • 0024137116 scopus 로고
    • Zero-knowledge with log-space verifiers
    • J.Kilian. Zero-knowledge with log-space verifiers. In FOCS, pages 25-35, 1988.
    • (1988) FOCS , pp. 25-35
    • Kilian, J.1
  • 44
    • 0026963441 scopus 로고
    • A note on efficient zero-knowledge proofs and arguments (extended abstract)
    • J.Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In STOC, pages 723-732, 1992.
    • (1992) STOC , pp. 723-732
    • Kilian, J.1
  • 45
    • 84957654400 scopus 로고
    • Improved efficient arguments (preliminary version)
    • J. Kilian. Improved efficient arguments (preliminary version). In CRYPTO, pages 311-324, 1995.
    • (1995) CRYPTO , pp. 311-324
    • Kilian, J.1
  • 46
    • 0031378815 scopus 로고    scopus 로고
    • E. Kushilevitz and R,. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS, pages 364-373, 1997.
    • E. Kushilevitz and R,. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS, pages 364-373, 1997.
  • 47
    • 0027627287 scopus 로고
    • Constant depth circuits, fourier transform, and learnability
    • N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, fourier transform, and learnability. Journal of the ACM, 40(3):607-620, 1993.
    • (1993) Journal of the ACM , vol.40 , Issue.3 , pp. 607-620
    • Linial, N.1    Mansour, Y.2    Nisan, N.3
  • 48
    • 33645970169 scopus 로고    scopus 로고
    • An oblivious transfer protocol with log-squared communication
    • H. Lipmaa. An oblivious transfer protocol with log-squared communication. In ISC, pages 314-328, 2005.
    • (2005) ISC , pp. 314-328
    • Lipmaa, H.1
  • 49
    • 0026930922 scopus 로고
    • Algebraic methods for interactive proof systems
    • C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, 1992.
    • (1992) Journal of the ACM , vol.39 , Issue.4 , pp. 859-868
    • Lund, C.1    Fortnow, L.2    Karloff, H.3    Nisan, N.4
  • 50
    • 0002597886 scopus 로고
    • Cs proofs (extended abstract)
    • S. Micali. Cs proofs (extended abstract). In FOCS, pages 436-453, 1994.
    • (1994) FOCS , pp. 436-453
    • Micali, S.1
  • 51
    • 79551478054 scopus 로고
    • Bit commitment using pseudo randomness
    • M. Naor. Bit commitment using pseudo randomness. In CRYPTO, pages 128-136, 1989.
    • (1989) CRYPTO , pp. 128-136
    • Naor, M.1
  • 52
    • 0027929411 scopus 로고
    • Nearly-linear size holographic proofs
    • A. Polishchuk and D. A. Spielman. Nearly-linear size holographic proofs. In STOC, pages 194-203, 1994.
    • (1994) STOC , pp. 194-203
    • Polishchuk, A.1    Spielman, D.A.2
  • 53
    • 0026930543 scopus 로고    scopus 로고
    • 53.A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, 1992.
    • 53.A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869-877, 1992.


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