메뉴 건너뛰기




Volumn 3788 LNCS, Issue , 2005, Pages 79-99

Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTS PER GATE; COMMUNICATION COMPLEXITY; MULTIPARTY COMPUTATION; PROTOCOL EXECUTION;

EID: 33646810497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_5     Document Type: Conference Paper
Times cited : (11)

References (45)
  • 1
    • 0024940038 scopus 로고
    • Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
    • [BB89]
    • [BB89] J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In PODC'89, p. 201-209, 1989.
    • (1989) PODC'89 , pp. 201-209
    • Bar-Ilan, J.1    Beaver, D.2
  • 2
    • 0027188428 scopus 로고
    • Asynchronous secure computation
    • [BCG93]
    • [BCG93] M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation (extended abstract). In 85th STOC, p. 52-61, 1993.
    • (1993) 85th STOC , pp. 52-61
    • Ben-Or, M.1    Canetti, R.2    Goldreich, O.3
  • 3
    • 84957629783 scopus 로고    scopus 로고
    • Relations among notions of security for publickey encryption schemes
    • [BDPR98]. H. Krawczyk, ed., LNCS 1462
    • [BDPR98] M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for publickey encryption schemes. In H. Krawczyk, ed., Crypto '98, p. 26-45, 1998. LNCS 1462.
    • (1998) Crypto '98 , pp. 26-45
    • Bellare, M.1    Desai, A.2    Pointcheval, D.3    Rogaway, P.4
  • 4
    • 84933507780 scopus 로고
    • Efficient multiparty protocols using circuit randomization
    • [Bea91a]. J. Feigenbaum, ed., LNCS 576
    • [Bea91a] D. Beaver. Efficient multiparty protocols using circuit randomization. In J. Feigenbaum, ed., Crypto '91, p. 420-432, 1991. LNCS 576.
    • (1991) Crypto '91 , pp. 420-432
    • Beaver, D.1
  • 5
    • 33746365751 scopus 로고
    • Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority
    • [Bea91b]
    • [Bea91b] D. Beaver. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2)75-122, 1991.
    • (1991) Journal of Cryptology , vol.4 , Issue.2 , pp. 75-122
    • Beaver, D.1
  • 6
    • 84979502594 scopus 로고
    • Security with low communication overhead
    • [BFKR90]. A. J. Menezes and S. A. Vanstone, ed., LNCS 537
    • [BFKR90] D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In A. J. Menezes and S. A. Vanstone, ed., Crypto '90, p. 62-76, 1990. LNCS 537.
    • (1990) Crypto '90 , pp. 62-76
    • Beaver, D.1    Feigenbaum, J.2    Kilian, J.3    Rogaway, P.4
  • 8
    • 84898960610 scopus 로고
    • Completeness theorems for non-cryptographic fault-tolerant distributed computation
    • [BGW88]
    • [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In 20th STOC, p. 1-10, 1988.
    • (1988) 20th STOC , pp. 1-10
    • Ben-Or, M.1    Goldwasser, S.2    Wigderson, A.3
  • 9
    • 0025137207 scopus 로고
    • The round complexity of secure protocols
    • [BMR90]
    • [BMR90] D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In 22nd STOC, p. 503-513, 1990.
    • (1990) 22nd STOC , pp. 503-513
    • Beaver, D.1    Micali, S.2    Rogaway, P.3
  • 10
    • 0000731055 scopus 로고    scopus 로고
    • Security and composition of multiparty cryptographic protocols
    • [Can00], winter
    • [Can00] R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, winter 2000.
    • (2000) Journal of Cryptology , vol.13 , Issue.1 , pp. 143-202
    • Canetti, R.1
  • 11
    • 0035163054 scopus 로고    scopus 로고
    • Universally composable security: A new paradigm for cryptographic protocols
    • [Can01]
    • [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd FOCS, 2001.
    • (2001) 42nd FOCS
    • Canetti, R.1
  • 12
    • 84898947315 scopus 로고
    • Multiparty unconditionally secure protocols
    • [CCD88]
    • [CCD88] D. Chaum, C. Crépeau, and I. Damgåd. Multiparty unconditionally secure protocols (extended abstract). In 80th STOC, p. 11-19, 1988.
    • (1988) 80th STOC , pp. 11-19
    • Chaum, D.1    Crépeau, C.2    Damgåd, I.3
  • 13
    • 84957717648 scopus 로고    scopus 로고
    • Efficient multiparty computations secure against an adaptive adversary
    • +99]. J. Stern, ed., LNCS 1592
    • +99] R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In J. Stern, ed., EuroCrypt '99, p. 311-326, 1999. LNCS 1592.
    • (1999) EuroCrypt '99 , pp. 311-326
    • Cramer, R.1    Damgård, I.2    Dziembowski, S.3    Hirt, M.4    Rabin, T.5
  • 14
    • 0033706246 scopus 로고    scopus 로고
    • On the complexity of verifiable secret sharing and multiparty computation
    • [CDD00]
    • [CDD00] R. Cramer, I. Damgård, and S. Dziembowski. On the complexity of verifiable secret sharing and multiparty computation. In 22nd STOC, p. 325-334, 2000.
    • (2000) 22nd STOC , pp. 325-334
    • Cramer, R.1    Damgård, I.2    Dziembowski, S.3
  • 15
    • 84864708144 scopus 로고
    • Multiparty computations ensuring privacy of each party's input and correctness of the result
    • [CDG87]. C. Pomerance, ed., LNCS 293
    • [CDG87] D. Chaum, I. Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In C. Pomerance, ed., Crypto '87, p. 87-119, 1987. LNCS 293.
    • (1987) Crypto '87 , pp. 87-119
    • Chaum, D.1    Damgård, I.2    Van De Graaf, J.3
  • 16
    • 84948975649 scopus 로고    scopus 로고
    • General secure multi-party computation from any linear secret-sharing scheme
    • [CDM00]. B. Preneel, ed., LNCS 1807
    • [CDM00] R. Cramer, I. Damg&rd, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In B. Preneel, ed., EuroCrypt 8000, p. 316-334, 2000. LNCS 1807.
    • (2000) EuroCrypt 8000 , pp. 316-334
    • Cramer, R.1    Damg, I.2    Maurer, R.U.3
  • 17
    • 84945124606 scopus 로고    scopus 로고
    • Multiparty computation from threshold homomorphic encryption
    • [CDN01]. LNCS 2045
    • [CDN01] R. Cramer, I. Damgaard, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In EuroCrypt 2001, p. 280-300, 2001. LNCS 2045.
    • (2001) EuroCrypt 2001 , pp. 280-300
    • Cramer, R.1    Damgaard, I.2    Nielsen, J.B.3
  • 19
    • 0026839969 scopus 로고
    • Modular construction of a byzantine agreement protocol with optimal message complexity
    • [CW92], March
    • [CW92] B. A. Coan and J. L. Welch. Modular construction of a byzantine agreement protocol with optimal message complexity. Information and Computation, 97(1):61-85, March 1992.
    • (1992) Information and Computation , vol.97 , Issue.1 , pp. 61-85
    • Coan, B.A.1    Welch, J.L.2
  • 20
    • 84948970500 scopus 로고    scopus 로고
    • Efficient concurrent zero-knowledge in the auxiliary string model
    • [Dam00]. B. Preneel, ed., LNCS 1807
    • [Dam00] I. Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In B. Preneel, ed., EuroCrypt 2000, p. 418-430, 2000. LNCS 1807.
    • (2000) EuroCrypt 2000 , pp. 418-430
    • Damgård, I.1
  • 21
    • 0031642212 scopus 로고    scopus 로고
    • Non-interactive and non-malleable commitment
    • [DCI098]
    • [DCI098] G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and non-malleable commitment. In 30th STOC, p. 141-150, 1998.
    • (1998) 30th STOC , pp. 141-150
    • Di Crescenzo, G.1    Ishai, Y.2    Ostrovsky, R.3
  • 22
    • 85087244453 scopus 로고    scopus 로고
    • Non-interactive and reusable non-maleable commitment schemes
    • [DG02]
    • [DG02] I. Damgaard and J. Groth. Non-interactive and reusable non-maleable commitment schemes. In 34th STOC, 2002.
    • (2002) 34th STOC
    • Damgaard, I.1    Groth, J.2
  • 23
    • 0002908662 scopus 로고    scopus 로고
    • A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
    • [DJ01]. K. Kim, ed., LNCS 1992
    • [DJ01] I. Damgârd and M. Jurik. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In K. Kim, ed., 4th Public Key Cryptography, p. 110-136, 2001. LNCS 1992.
    • (2001) 4th Public Key Cryptography , pp. 110-136
    • Damgârd, I.1    Jurik, M.2
  • 24
    • 33645595606 scopus 로고    scopus 로고
    • Universally composable efficient multiparty computation from threshold homomorphic encryption
    • [DN03]. D. Boneh, ed., LNCS 2729
    • [DN03] I. Damgârd and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In D. Boneh, ed., Crypto 2003, 2003. LNCS 2729.
    • (2003) Crypto 2003
    • Damgârd, I.1    Nielsen, J.B.2
  • 25
    • 33646806738 scopus 로고    scopus 로고
    • Efficient non-malleable commitment schemes
    • [FF00]. M. Bellare, ed., LNCS 1880
    • [FF00] M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. In M. Bellare, ed., Crypto 2000, p. 414-432, 2000. LNCS 1880.
    • (2000) Crypto 2000 , pp. 414-432
    • Fischlin, M.1    Fischlin, R.2
  • 26
    • 0002992068 scopus 로고    scopus 로고
    • Joint encryption and message-efficient secure computation
    • [FH96]. Autumn
    • [FH96] M. Franklin and S. Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology, 9(4):217-232, Autumn 1996.
    • (1996) Journal of Cryptology , vol.9 , Issue.4 , pp. 217-232
    • Franklin, M.1    Haber, S.2
  • 28
    • 84937440738 scopus 로고    scopus 로고
    • On 2-round secure multiparty computation
    • [GIKR02]. M. Yung, ed., LNCS 2442
    • [GIKR02] R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. On 2-round secure multiparty computation. In M. Yung, ed., Crypto 2002, p. 178-193, 2002. LNCS 2442.
    • (2002) Crypto 2002 , pp. 178-193
    • Gennaro, R.1    Ishai, Y.2    Kushilevitz, E.3    Rabin, T.4
  • 29
    • 21144458613 scopus 로고    scopus 로고
    • Local conversion of secret-sharing schemes with applications to threshold cryptography
    • [CDI05]. LNCS 3378
    • [CDI05] R. Cramer, I. Damgârd, and Y. Ishai. Local conversion of secret-sharing schemes with applications to threshold cryptography. In TCC 2005, p.342-362, 2005. LNCS 3378.
    • (2005) TCC 2005 , pp. 342-362
    • Cramer, R.1    Damgârd, I.2    Ishai, Y.3
  • 30
    • 84955564077 scopus 로고
    • Fair computation of general functions in presence of immoral majority
    • [GL90]. A. J. Menezes and S. A. Vanstone, ed., LNCS 537
    • [GL90] S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In A. J. Menezes and S. A. Vanstone, ed., Crypto '90, p. 77-93, 1990. LNCS 537.
    • (1990) Crypto '90 , pp. 77-93
    • Goldwasser, S.1    Levin, L.2
  • 31
    • 0021941417 scopus 로고
    • The knowledge complexity of interactive proof-systems
    • [GMR85]
    • [GMR85] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems (extended abstract). In 17th STOC, p. 291-304, 1985.
    • (1985) 17th STOC , pp. 291-304
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 32
    • 0023545076 scopus 로고
    • How to play any mental game or a completeness theorem for protocols with honest majority
    • [GMW87]
    • [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In 19th STOC, p. 218-229, 1987.
    • (1987) 19th STOC , pp. 218-229
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 33
    • 0031628398 scopus 로고    scopus 로고
    • Simplified VSS and fast-track multi-party computations with applications to threshold cryptography
    • [GRR98]
    • [GRR98] R. Gennaro, M. Rabin, and T. Rabin. Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In PODC'98, 1998.
    • (1998) PODC'98
    • Gennaro, R.1    Rabin, M.2    Rabin, T.3
  • 34
    • 85032194875 scopus 로고
    • How to solve any protocol problem - An efficiency improvement
    • [GV87]. C. Pomerance, ed., LNCS 293
    • [GV87] O. Goldreich and R. Vainish. How to solve any protocol problem - an efficiency improvement. In C. Pomerance, ed., Crypto '87, p. 73-86, 1987. LNCS 293.
    • (1987) Crypto '87 , pp. 73-86
    • Goldreich, O.1    Vainish, R.2
  • 35
    • 33745999816 scopus 로고    scopus 로고
    • Player simulation and general adversary structures in perfect multiparty computation
    • [HM00]. winter
    • [HM00] M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, winter 2000.
    • (2000) Journal of Cryptology , vol.13 , Issue.1 , pp. 31-60
    • Hirt, M.1    Maurer, U.2
  • 36
    • 84880854377 scopus 로고    scopus 로고
    • Robustness for free in unconditional multi-party computation
    • [HM01]. J. Kilian, ed., LNCS 2139
    • [HM01] M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In J. Kilian, ed., Crypto 2001, p. 101-118, 2001. LNCS 2139.
    • (2001) Crypto 2001 , pp. 101-118
    • Hirt, M.1    Maurer, U.2
  • 37
    • 35248861868 scopus 로고    scopus 로고
    • Efficient secure multi-party computation
    • [HMP00]. T. Okamoto, ed., LNCS 1976
    • [HMP00] M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In T. Okamoto, ed., ASIA CRYPT 2000, p. 143-161, 2000. LNCS 1976.
    • (2000) ASIA CRYPT 2000 , pp. 143-161
    • Hirt, M.1    Maurer, U.2    Przydatek, B.3
  • 38
    • 84937417083 scopus 로고    scopus 로고
    • Mix and match: Secure function evaluation via ciphertexts
    • [JJ00]. T. Okamoto, ed., LNCS 1976
    • [JJ00] M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, ed., ASIA CRYPT 2000, p. 162-177, 2000. LNCS 1976.
    • (2000) ASIA CRYPT 2000 , pp. 162-177
    • Jakobsson, M.1    Juels, A.2
  • 39
    • 84958741591 scopus 로고    scopus 로고
    • Threshold cryptosystems based on factoring
    • [KY02]. Y. Zheng, ed., LNCS 2501
    • [KY02] J. Katz and M. Yung. Threshold cryptosystems based on factoring. In Y. Zheng, ed., ASIA CRYPT 2002, p. 192-205, 2002. LNCS 2501.
    • (2002) ASIA CRYPT 2002 , pp. 192-205
    • Katz, J.1    Yung, M.2
  • 41
    • 84974655726 scopus 로고
    • Secure computation
    • [MR91]. J. Feigenbaum, ed., LNCS 576
    • [MR91] S. Micali and P. Rogaway. Secure computation. In J. Feigenbaum, ed., Crypto '91, p. 392-404, 1991. LNCS 576.
    • (1991) Crypto '91 , pp. 392-404
    • Micali, S.1    Rogaway, P.2
  • 42
    • 33645600801 scopus 로고    scopus 로고
    • [Nie03]. Dissertation Series DS-03-8, BRICS, Department of Computer Science, University of Aarhus, August
    • [Nie03] J. B. Nielsen. On protocol security in the cryptographic model. Dissertation Series DS-03-8, BRICS, Department of Computer Science, University of Aarhus, August 2003.
    • (2003) On Protocol Security in the Cryptographic Model
    • Nielsen, J.B.1
  • 43
    • 84942550998 scopus 로고    scopus 로고
    • Public-key cryptosystems based on composite degree residue classes
    • [Pai99]. J. Stern, ed., LNCS 1592
    • [Pai99] P. Paillier. Public-key cryptosystems based on composite degree residue classes. In J. Stern, ed., EuroCrypt '99, p. 223-238, 1999. LNCS 1592.
    • (1999) EuroCrypt '99 , pp. 223-238
    • Paillier, P.1
  • 44
    • 0024859552 scopus 로고
    • Verifiable secret sharing and multiparty protocols with honest majority
    • [RB89]
    • [RB89] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21th STOC, p. 73-85, 1989.
    • (1989) 21th STOC , pp. 73-85
    • Rabin, T.1    Ben-Or, M.2
  • 45
    • 0020312165 scopus 로고
    • Protocols for secure computations
    • [Yao82]
    • [Yao82] A. C.-C. Yao. Protocols for secure computations (extended abstract). In 23rd FOCS, p. 160-164, 1982.
    • (1982) 23rd FOCS , pp. 160-164
    • Yao, A.C.-C.1


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