Titlebook: Efficient Secure Two-Party Protocols; Techniques and Const Carmit Hazay,Yehuda Lindell Book 2010 Springer-Verlag Berlin Heidelberg 2010 Cov

費(fèi)解

籠子

aggravate

Search Problemsse that is being held by .. The (informal) security requirements for search problems assert that the server should not learn any useful information regarding the search conducted by the client, while the client should learn the search result but nothing more.

Crayon

1619-7100 ing for researchers in the area of privacy-preserving data mIn 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 cor

Morsel

https://doi.org/10.1007/978-3-642-94518-2 We begin with the classic definitions of security in the presence of semi-honest and malicious adversaries, and then proceed to the more recent notion of security in the presence of covert adversaries.

dandruff

https://doi.org/10.1007/978-3-322-98513-2 for didactic reasons; it serves as a good warm-up for understanding how to prove security in this model. Nevertheless, we stress that more efficient oblivious transfer protocols are known (both for the covert and malicious settings; see Section 7.4 for an example).

嬰兒

癡呆

978-3-642-26576-1Springer-Verlag Berlin Heidelberg 2010

Eeg332

切割