메뉴 건너뛰기




Volumn 6223 LNCS, Issue , 2010, Pages 483-501

Improved delegation of computation using fully homomorphic encryption

Author keywords

computationally sound proofs; outsourcing computation; universal argument systems; verifiable computation; worst case average case reductions

Indexed keywords

ARGUMENT SYSTEMS; COMPUTATIONALLY SOUND PROOFS; CRYPTOLOGY; DELEGATING COMPUTATION; DELEGATORS; E-PRINTS; FIRST CONSTRUCTIONS; FULLY HOMOMORPHIC ENCRYPTION; IMPROVED SCHEME; OFFLINE; PUBLIC KEYS; TIME COMPLEXITY; VERIFIABLE COMPUTATION; WORST-CASE/AVERAGE-CASE REDUCTIONS;

EID: 77957002840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_26     Document Type: Conference Paper
Times cited : (299)

References (25)
  • 2
    • 10444272266 scopus 로고    scopus 로고
    • Boinc: A system for public-resource computing and storage
    • Anderson, D.P.: Boinc: A system for public-resource computing and storage. In: GRID, pp. 4-20 (2004)
    • (2004) GRID , pp. 4-20
    • Anderson, D.P.1
  • 3
    • 0021980820 scopus 로고
    • Trading group theory for randomness
    • Babai, L.: Trading group theory for randomness. In: STOC, pp. 421-429 (1985)
    • (1985) STOC , pp. 421-429
    • Babai, L.1
  • 4
    • 0035166072 scopus 로고    scopus 로고
    • How to go beyond the black-box simulation barrier
    • Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106-115 (2001)
    • (2001) FOCS , pp. 106-115
    • Barak, B.1
  • 6
    • 0002771903 scopus 로고
    • Non-deterministic exponential time has two-prover interactive protocols
    • Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3-40 (1991)
    • (1991) Computational Complexity , vol.1 , pp. 3-40
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 7
    • 85028539051 scopus 로고
    • Checking computations in polylogarithmic time
    • Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC, pp. 21-31 (1991)
    • (1991) STOC , pp. 21-31
    • Babai, L.1    Fortnow, L.2    Levin, L.A.3    Szegedy, M.4
  • 9
    • 4243180376 scopus 로고    scopus 로고
    • The random oracle methodology, revisited
    • Canetti, R., Goldreich, O., Halevi, S.: 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
  • 11
    • 0027595217 scopus 로고
    • Interactive proof systems and alternating time-space complexity
    • Fortnow, L., Lund, C.: Interactive proof systems and alternating time-space complexity. Theoretical Computer Science 113(1), 55-73 (1993)
    • (1993) Theoretical Computer Science , vol.113 , Issue.1 , pp. 55-73
    • Fortnow, L.1    Lund, C.2
  • 12
    • 84990731886 scopus 로고
    • How to prove yourself: Practical solutions to identification and signature problems
    • Odlyzko, A.M. (ed.) LNCS Springer, Heidelberg
    • Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
    • (1987) CRYPTO 1986 , vol.263 , pp. 186-194
    • Fiat, A.1    Shamir, A.2
  • 13
    • 70350642087 scopus 로고    scopus 로고
    • Fully homomorphic encryption using ideal lattices
    • Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169-178 (2009)
    • (2009) STOC , pp. 169-178
    • Gentry, C.1
  • 16
    • 57049095424 scopus 로고    scopus 로고
    • Delegating computation: Interactive proofs for muggles
    • Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113-122 (2008)
    • (2008) STOC , pp. 113-122
    • Goldwasser, S.1    Kalai, Y.T.2    Rothblum, G.N.3
  • 17
    • 0024611659 scopus 로고
    • The knowledge complexity of interactive proof-systems
    • Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. SIAM Journal on Computing 18(1), 186-208 (1989)
    • (1989) SIAM Journal on Computing , vol.18 , Issue.1 , pp. 186-208
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 18
    • 24144497043 scopus 로고    scopus 로고
    • Sufficient conditions for collision-resistant hashing
    • Kilian, J. (ed.) LNCS Springer, Heidelberg
    • Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Sufficient conditions for collision-resistant hashing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 445-456. Springer, Heidelberg (2005)
    • (2005) TCC 2005 , vol.3378 , pp. 445-456
    • Ishai, Y.1    Kushilevitz, E.2    Ostrovsky, R.3
  • 19
    • 0026963441 scopus 로고
    • A note on efficient zero-knowledge proofs and arguments (extended abstract)
    • Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC, pp. 723-732 (1992)
    • (1992) STOC , pp. 723-732
    • Kilian, J.1
  • 20
    • 70350343384 scopus 로고    scopus 로고
    • Probabilistically checkable arguments
    • Halevi, S. (ed.) LNCS Springer, Heidelberg
    • Kalai, Y.T., Raz, R.: Probabilistically checkable arguments. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 143-159. Springer, Heidelberg (2009)
    • (2009) CRYPTO 2009 , vol.5677 , pp. 143-159
    • Kalai, Y.T.1    Raz, R.2
  • 21
    • 0026930922 scopus 로고
    • Algebraic methods for interactive proof systems
    • project webpag
    • Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859-868 (1992) The great internet mersenne prime search, project webpag (2007), http://www.mersenne.org/
    • (1992) J. ACM , vol.39 , Issue.4 , pp. 859-868
    • Lund, C.1    Fortnow, L.2    Karloff, H.J.3    Nisan, N.4
  • 22
    • 0002597886 scopus 로고
    • Cs proofs (extended abstracts)
    • Micali, S.: Cs proofs (extended abstracts). In: FOCS, pp. 436-453 (1994)
    • (1994) FOCS , pp. 436-453
    • Micali, S.1
  • 23
    • 0034854953 scopus 로고    scopus 로고
    • Computationally sound proofs
    • Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253-1298 (2000)
    • (2000) SIAM J. Comput. , vol.30 , Issue.4 , pp. 1253-1298
    • Micali, S.1
  • 24
    • 0026930543 scopus 로고
    • IP = PSPACE
    • Shamir, A.: IP = PSPACE. Journal of the ACM 39(4), 869-877 (1992)
    • (1992) Journal of the ACM , vol.39 , Issue.4 , pp. 869-877
    • Shamir, A.1
  • 25
    • 51749107030 scopus 로고    scopus 로고
    • Re-CAPTCHA: Human-based character recognition via web security measures
    • von Ahn, L., Maurer, B., McMillen, C., Abraham, D., Blum, M.: re-CAPTCHA: Human-Based Character Recognition via Web Security Measures. Science 321(5895), 1465-1468 (2008)
    • (2008) Science , vol.321 , Issue.5895 , pp. 1465-1468
    • Von Ahn, L.1    Maurer, B.2    McMillen, C.3    Abraham, D.4    Blum, M.5


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