First Page | Document Content | |
---|---|---|
Date: 2006-09-25 10:55:42Cryptography Mathematical analysis Quantum complexity theory Computational complexity theory Functions and mappings Secure multi-party computation Communication complexity Secure two-party computation Limit of a function Cryptographic protocol Pi PP | Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. StrausskAdd to Reading ListSource URL: cs-www.cs.yale.eduDownload Document from Source WebsiteFile Size: 411,92 KBShare Document on Facebook |