IBM / AT&T Labs / Bell Labs / Avaya Labs / HP Labs / NEC Laboratories America / Microsoft / Telcordia Technologies / / /
Event
FDA Phase / /
Facility
Princeton University / Rutgers University / Rensselaer Polytechnic Institute / Computer Science Yale University / Georgia Institute of Technology / Stevens Institute of Technology / The Cancer Institute of New Jersey / Computer Science Division University of California / /
IndustryTerm
deterministic communication protocols / online auctions / hypothetical ideal protocol / costly protocols / private communication protocols / natural protocols / possible protocols / private protocol / Trivial protocol / communication protocol / particular protocol / /
Organization
National Science Foundation / Rensselaer Polytechnic Institute / Cancer Institute of New Jersey / Rutgers University / Georgia Institute of Technology / Princeton University / University of California / Berkeley / Stevens Institute of Technology / Joan Feigenbaum1 / 2 Department / U.S. Securities and Exchange Commission / Yale University / /
Person
Rabin / /
Position
first player / model of two-party communication / DIMACS Assistant Research Professor / else player / player / /
Product
PAR / S1 / /
ProvinceOrState
New Jersey / California / /
Technology
three natural protocols / SMC protocol / two-party protocol / trivial protocol / one protocol / 3.2 Protocols / three protocols / Alternating protocol / deterministic communication protocols / two-participant protocol / particular protocol / communication protocol / impractically costly protocols / perfectly private communication protocols / maximally privacypreserving protocol / three possible protocols / perfectly private protocol / /
DIMACS Technical Report[removed]Version of 2010–01–19 Approximate Privacy: PARs for Set Problems by Joan Feigenbaum1,2