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

倔強(qiáng)一點(diǎn)

Der Karriere-Kompass für Studierendesorted data sets in the presence of semi-honest and malicious adversaries. An important special case of this problem is that of securely computing the .. The construction of [1] is based on the iterative protocol of [74] for computing the .th-ranked element with low communication complexity. The sec

摘要

知識(shí)

STRIA

Wahrscheinlichkeitszusammenhang,re multiparty computation. This places the topic of this book in its larger context. Following this, we describe the basic results and techniques related to efficiency in secure computation. Finally, we conclude with a roadmap to the book.

兒童

補(bǔ)角

Introductionre multiparty computation. This places the topic of this book in its larger context. Following this, we describe the basic results and techniques related to efficiency in secure computation. Finally, we conclude with a roadmap to the book.

MEN

Definitionssecurity for semi-honest, malicious and covert adversaries; all these definitions are based on the ideal/real-model paradigm for formulating security. We begin with the classic definitions of security in the presence of semi-honest and malicious adversaries, and then proceed to the more recent notio

meretricious

易受刺激

Covert Adversariesdefinitions of the model. We begin by presenting a protocol for oblivious transfer that is secure in the covert model. We present this protocol mainly 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

lethargy