Abstract
AbstractSo far our focus was on general n-party secure MPC, where the emphasis was on asymptotic efficiency. In this chapter, we discuss a special case of perfectly-secure MPC, namely MPC for small number of parties. Instead of asymptotic efficiency, our focus will be on concrete efficiency. The use case considered in this chapter is that of secure 3-party computation (secure 3PC), with one passive corruption. We discuss two different protocols in this setting, the first one due to [9] and the second one due to [47].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Secure Multi-Party Computation Against Passive Adversaries
Paper Title
Journal
Date
