Mix and Match: Secure Function Evaluation via Ciphertexts

314 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the Capacity of Secure Distributed Matrix Multiplication (2018, background): “Some previous works include secure two-party computation [1] which proposed using one-way functions to achieve security, and secure multi-party computation [2], [3] to name a few.”
Breaking and Mending Resilient Mix-Nets (2003, background): “It can be used in a wide range of applications, including anonymous email [4], Web browsing [7], electronic voting [22, 14], anonymous payment systems [9], secure multiparty computation [12] and privacy in advertisements [15].”
Civitas: Toward a Secure Voting System (2008, methodology): “Civitas reﬁnes and implements a voting scheme, which we refer to as JCJ , developed by Juels, Cata-lano, and Jakobsson [58].”
Secure function evaluation based on secret sharing and homomorphic encryption (2009, background): “problems, notably secure comparison [13] and secure auctions [14].”
Coercion-resistant electronic elections (2005, background): “PET may be realized as an e.cient distributed protocol that reveals no additional, non-negligible information about plaintexts.”
Universal Re-encryption for Mixnets (2004, background): “nique for anonymizing electronic mail and elections, mix networks have proven useful for a variety of other applications, ranging from payments schemes [23] to elections [13, 22, 16], cellular telephony privacy [11, 32], and general multi-party computation [20].”