Date: 2014-09-16 05:37:56Secure two-party computation Pseudorandomness Random oracle Security parameter Zero-knowledge proof IP Universal composability Verifiable secret sharing Cryptography Cryptographic protocols Secure multi-party computation | | Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries∗ Carmit Hazay† Yehuda Lindell†Document is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 370,41 KB |