Privacy-Preserving Multi-Party Bartering Secure Against Active Adversaries
نویسندگان
چکیده
A majority of electronic bartering transactions is carried out via online platforms. Typically, these platforms require users to disclose sensitive information about their trade capabilities which might restrict their room for negotiation. It is in this context that we propose a novel decentralized and privacy-preserving bartering protocol for multiple parties that offers the same privacy guarantees as provided by traditional bartering and by cash payments. The proposed protocol is even secure against an active attacker who controls a majority of colluding parties.
منابع مشابه
Towards Privacy-Preserving Multi-party Bartering
Both B2B bartering as well as bartering between individuals is increasingly facilitated through online platforms. However, typically these platforms lack automation and tend to neglect the privacy of their users by leaking crucial information about trades. It is in this context that we devise the first privacypreserving protocol for automatically determining an actual trade between multiple par...
متن کاملEfficient Secure Computation with Garbled Circuits
Secure two-party computation enables applications in which participants compute the output of a function that depends on their private inputs, without revealing those inputs or relying on any trusted third party. In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to s...
متن کاملSecure Multiparty Sorting Protocols with Covert Privacy
We introduce the notion of covert privacy for secret-sharingbased secure multiparty computation (SMC) protocols. We show how covertly or actively private SMC protocols, together with recently introduced verifiable protocols allow the construction of SMC protocols secure against active adversaries. For certain computational problems, the relative overhead of our protocols, when compared to proto...
متن کاملComplete Characterization of AdversariesTolerable in Secure Multi - Party Computation
The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We prove...
متن کاملPrivacy-preserving Similarity Sorting in Multi-party Model
In social network, it is conceivable that a rational execution sequence does good to cooperative mission, especially for a large number of participants. However, there are many difficulties for multi-party computation, the most important of which is privacy. In this paper, secure multiparty computation technology and dimensionality reduction are chosen to design a privacy-preserving protocol, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017