Privacy preserving auctions and mechanism design

By Moni Naor, Benny Pinkas, Reuban Sumner. 1999

How researchers see this paper

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

Citations in the corpus

Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, methodology): “Obliv-C includes an implementation of Yao’s garbled circuit protocol that incorporates recent optimizations including free XOR [44], garbled row reduction [56], fixed key block ciphers [3], and half gates [73].”
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, methodology): “A similar approach has been used for other tasks such as sealed second price auctions [16].”
DeepSecure: Scalable Provably-Secure Deep Learning (2017, methodology): “There are several optimizations for the GC protocol including Free-XOR [10], Row Reduction [11], Half Gates [12], and Fixed-Key Cipher [13].”
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications (2018, methodology): “The garbled table’s rows are shuffled according to the point-and-permute technique [68] where the four rows are permuted by using the Least Significant Bit (LSB) of the input labels as the permutation bits.”
Secure Linear Regression on Vertically Partitioned Datasets (2016, methodology): “We built the multi-party protocols atop Obliv-C [43], a derivative of the C language supporting two party computation with a number of recent optimizations, including Free XOR [26], Garbled Row Reduction [33], Fixed Key Block Ciphers [3], and Half Gates [44].”
Mix and Match: Secure Function Evaluation via Ciphertexts (2000, background): “[36] is the first to seek to achieve the first four auction properties enumerated above.”
Garbling Gadgets for Boolean and Arithmetic Circuits (2016, methodology): “The number of ciphertexts can also be reduced from 4 to 3 by the following row reduction trick of Naor, Pinkas and Sumner [16].”
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound (2015, methodology): “Garbled Row Reduction [41] and Free XOR [30] are used.”
Efficient Privacy-Preserving Face Recognition (2009, unknown): “) we use garbled row reduction [26,31] which allows to omit the first entry of the garbled tables, i.”
Extending Oblivious Transfers Efficiently (2003, background): “, [30,29,17,26,12,27]), where oblivious transfers typically form the efficiency bottleneck.”
Distributed algorithmic mechanism design: recent results and future directions (2002, unknown): “In addition to the standard SMFE literature [26], work that might be relevant to Open Problem 12 includes but is not limited to the papers of Naor and Nissim [48], Naor, Pinkas, and Sumner [49], and Dodis, Halevi, and Rabin [15].”
A Proof of Security of Yao’s Protocol for Two-Party Computation (2009, background): “Related Work Sketches of Yao’s protocol have appeared in a number of places; see, for example, [2,7,12].”
TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits (2015, background): “…preserving and security critical applications that could benefit from a practical realization of SFE, including but not limited to: biometrics matching, face recognition, image/data classification, electronic auctions and voting, remote diagnosis, and secure search [1], [8], [9], [22], [39], [58].”
Privacy-aware mechanism design (2011, unknown): “The cryptographic literature also includes references to “privacy preserving mechanism design” (an example is Naor, Pinkas and Sumner [NPS99]).”
Efficient oblivious transfer protocols (2001, methodology): “relevant in case the sender is committed to its value prior to the protocol, as in the [26] scenario.”
Information sharing across private databases (2003, background): “A variant of Yao’s protocol is presented in [37] where the number of oblivious transfers is proportional to the number of inputs and not the size of the circuit.”
Compacting privacy-preserving k-nearest neighbor search using logic synthesis (2015, background): “Thus, the first entry need not be sent [26].”
Improved Garbled Circuit: Free XOR Gates and Applications (2008, background): “General SFE has been a subject of immense amount of research, started by Yao [27,28], which resulted in significant advances in the field [9,21,17].”