 Date: 2010-01-20 15:00:17Cryptographic protocols Communication Communication complexity Computational complexity theory Quantum complexity theory Quantum information science Communications protocol IP Secure multi-party computation Theoretical computer science Applied mathematics Information | |  DIMACS Technical Report[removed]Version of 2010–01–19 Approximate Privacy: PARs for Set Problems by Joan Feigenbaum1,2
Add to Reading ListSource URL: www.cs.yale.eduDownload Document from Source Website File Size: 296,72 KBShare Document on Facebook
|
