Efficient Secure Two-Party Protocols: Techniques and ConstructionsIn the setting of multiparty computation, sets of two or more parties with p- vate inputs wish to jointly compute some (predetermined) function of their inputs. The computation should be such that the outputs received by the parties are correctly distributed, and furthermore, that the privacy of each party’s input is preserved as much as possible, even in the presence of - versarial behavior. This encompasses any distributed computing task and includes computations as simple as coin-tossing and broadcast, and as c- plex as electronic voting, electronic auctions, electronic cash schemes and anonymous transactions. The feasibility (and infeasibility) of multiparty c- putation has been extensively studied, resulting in a rather comprehensive understanding of what can and cannot be securely computed, and under what assumptions. The theory of cryptography in general, and secure multiparty computation in particular, is rich and elegant. Indeed, the mere fact that it is possible to actually achieve the aforementioned task is both surprising and intriguing. |
Other editions - View all
Efficient Secure Two-Party Protocols: Techniques and Constructions Carmit Hazay,Yehuda Lindell No preview available - 2013 |
Efficient Secure Two-Party Protocols: Techniques and Constructions Carmit Hazay,Yehuda Lindell No preview available - 2010 |
Common terms and phrases
abort auxiliary input Chapter cheating check circuits chooses a random chosen-plaintext attacks ciphertexts commitment scheme computationally indistinguishable computing f construct corrupted party corrupted₁ covert adversaries database decommitments decryption define denote Diffie-Hellman tuple distinguish E-protocol efficient elements encryption scheme evaluation circuits FbasicDB FCPRP follows FPRF Furthermore garbled circuit garbled values gate h₁ homomorphic encryption honest party ideal model input bit input wires k₁ malicious adversaries median negligible probability oblivious transfer protocol obtain one-sided simulation P₁'s P2's input pair party P₁ polynomial presence of covert presence of malicious presence of semi-honest probabilistic polynomial-time proof of knowledge prove pseudorandom function pseudorandom permutation random tape real execution Section secure multiparty computation secure protocol securely computes security parameter semi-honest adversaries sender sends server sets smartcard Specifically SREC string subprotocol Theorem trapdoor trapdoor permutations trusted party computing verifier zero-knowledge proof