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

Arpita Patra; Ashish Choudhary; C. Pandu Rangan

Conference Proceedings

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

Patra A
Choudhary A
Rangan C

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5922 LNCS 398-417

DOI: 10.1007/978-3-642-10628-6_26

5Citations

22Readers

Get full text

Abstract

In information theoretic model, unconditionally secure multiparty computation (UMPC) allows a set of n parties to securely compute an agreed function f, even upto t

Author supplied keywords

Error probability
Information theoretic security
Multiparty computation

Cite

CITATION STYLE

APA

Patra, A., Choudhary, A., & Rangan, C. P. (2009). Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5922 LNCS, pp. 398–417). https://doi.org/10.1007/978-3-642-10628-6_26

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

Abstract

Author supplied keywords

Cite

Register to see more suggestions