Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5922 LNCS, Issue , 2009, Pages 398-417

  Patra, Arpita ^a   Choudhary, Ashish ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Error probability; Information theoretic security; Multiparty computation

Indexed keywords

ACTIVE ADVERSARY; ARITHMETIC CIRCUIT; BROADCAST CHANNELS; COMMUNICATION COMPLEXITY; COMPUTING POWER; ERROR PROBABILITIES; MULTIPARTY COMPUTATION; ON-DEMAND; OPEN PROBLEMS; OPTIMAL RESILIENCE; PRIVATE COMMUNICATION; SECURE CHANNELS; SECURE MULTI-PARTY COMPUTATION; SECURITY PARAMETERS; SET INTERSECTION; SHARED SECRETS; TECHNIQUES USED; THEORETIC MODEL;

COMMUNICATION; CRYPTOGRAPHY; INFORMATION THEORY; MODEL PREDICTIVE CONTROL; NETWORK PROTOCOLS; OPTIMIZATION; PREDICTIVE CONTROL SYSTEMS; PROBABILITY;

NETWORK SECURITY;

EID: 77649259693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10628-6_26     Document Type: Conference Paper

References (19)

1. Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420-432. Springer, Heidelberg (1992)
2. Beerliová-Trubíniová, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305-328. Springer, Heidelberg (2006)
3. Beerliová-Trubíniová, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 376-392. Springer, Heidelberg (2007)
4. Beerliová-Trubíniová, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213-230. Springer, Heidelberg (2008)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC, pp. 1-10 (1988)
6. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11-19 (1988)
7. Cramer, R., Damgård, I.: Multiparty Computation, an Introduction. In: Contemporary Cryptography, Birkhuser Basel (2005)
8. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
9. Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1-19. Springer, Heidelberg (2004)
10. Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fact-track multiparty computations with applications to threshold cryptography. In: PODC, pp. 101-111 (1998)
11. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218-229 (1987)
12. Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation. In: PODC, pp. 25-34 (1997)
13. Katz, J., Koo, C.Y.: Round-efficient secure computation in point-to-point networks. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 311-328. Springer, Heidelberg (2007)
14. Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241-257. Springer, Heidelberg (2005)
15. Li, R., Wu, C.: An unconditionally secure protocol for multi-party set intersection. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 226-236. Springer, Heidelberg (2007)
16. Patra, A., Choudhary, A., Rangan, C.P.: Round efficient unconditionally secure multiparty computation protocol. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 185-199. Springer, Heidelberg (2008)
17. Patra, A., Choudhary, A., Pandu Rangan, C.: Information theoretically secure multi party set intersection re-visited. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 71-91. Springer, Heidelberg (2009)
18. Rabin, T.: Robust sharing of secrets when the dealer is honest or cheating. J. ACM 41(6), 1089-1109 (1994)
19. Yao, A.C.: Protocols for secure computations. In: FOCS, pp. 160-164 (1982)