Efficient Secure Two-Party Protocols: Techniques and Constructions
By Carmit Hazay, Yehuda Lindell. 2010
317 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/7098cffc6ce275b271528d87a00cf110b4a40561
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Vladimir Kolesnikov
- Thomas Schneider
- Mike Rosulek
- Michael Zohner
- Benny Pinkas
- Ni Trieu
- Julien Bringer
- Naor Matania
Citations in the corpus
- GSHADE: faster privacy-preserving distance computation and biometric identification (2014, methodology): “This is formally expressed using a simulation game, see [24] for more details.”
- Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries (2013, methodology): “We prove security via the standard definition of secure two-party computation following the real/ideal paradigm, and using modular sequential composition; see [4, 12, 14] for details.”
- A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries (2010, background): “Most of this note is an excerpt from [5].”
- Practical Multi-party Private Set Intersection from Symmetric-Key Techniques (2017, methodology): “We note that the augmented semi-honestmodel is well known [14, 16] and was used in previous work on multi-party PSI and related functionalities [12, 13].”