Most previous work on unconditionally secure multiparty computation has focused on computing over a nite eld (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty ...

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

This is the scientific report for the paper entitled “Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings”. This research produces a powerful idea for transforming any semi-honestly secure multiparty computation (MPC) into an actively secure protocol while taking into consideration reducing the threshold of tolerance corruption for real parties by semi-honest adversa...

A function is private if there exists a protocol that is secure; that is, no party can learn any additional information about the other parties’ inputs other than what follows from their own input and the function’s output. Previous studies have investigated multiparty computation with broadcast communication, but broadcast communication does not fully capture all secure multiparty protocols. W...

We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming minimal assumption that oblivious transfer (OT) exists. If assumed OT protocol is against semi-honest adversaries (in plain model) then so our MPC protocol. Similarly, if malicious common random/reference string Previously, were only known under relatively stronger computational ass...

We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The protocol can be implemented in a constant ...

Secure multiparty computation allows multiple parties to participate in a computation. SMC (secure multiparty computation) assumes n parties where n>1. All the parties jointly compute a function. Privacy preserving data mining has become an emerging field in the secure multiparty computation. Privacy preserving data mining preserves the privacy of individual's data. Privacy preserving data mini...