Foundations of Cryptography: Volume 2, Basic Applications

By Goldreich Oded. 2004

1,414 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

QUOTIENT: Two-Party Secure Neural Network Training and Prediction (2019, neutral): “As common in MPC, this is formalized in the simulation framework (see [17] for details).”
How to Use Bitcoin to Design Fair Protocols (2014, methodology): “However, definitions of secure computation [48] do vary across models, in part owing to general impossibility results for fair coin-tossing [35].”
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012, background): “Most previous work in secure computation has assumed either a semi-honest or malicious threat model [10].”
SPHINCS: Practical Stateless Hash-Based Signatures (2015, methodology): “Goldreich [23] (elaborating upon [22]) proposed a stateless hash-based signature scheme, using a binary certification tree built”
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (2008, methodology): “As a result, we chose the KDF to be implemented by SHA-256, and as the elliptic curve E we selected the curve secp256r1 from the SECG standard [ 20 ].”
Securely outsourcing linear algebra computations (2010, methodology): “To define when an outsourcing protocol is secure, we adapt the standard definitions from Secure Multiparty Computation (SMC) (see [17] for an overview of these definitions) to the outsourcing model.”
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users (2010, methodology): “We refer the readers to [30] for details and formal definition of information-theoretic pri vacy.”