Date: 2010-11-25 08:58:28Computational complexity theory Secure multi-party computation Commitment scheme Homomorphic encryption Secure two-party computation Paillier cryptosystem Oblivious transfer Zero-knowledge proof Communication complexity Cryptography Cryptographic protocols Public-key cryptography | | Efficient Set Operations in the Presence of Malicious Adversaries Carmit Hazay∗ Kobbi Nissim† November 25, 2010Document is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 331,80 KB |