Foundations of Cryptography: Volume 1

By Oded Goldreich. 2006

605 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/128e785ed606ea7d0831cc61b25933dde1bc7f79

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

On Ideal Lattices and Learning with Errors over Rings (2010, methodology): “As a result, for cryptographic applications Stehl´e et al. use hard-core bits obtained via the efﬁcient Goldreich-Levin construction based on Toeplitz matrices [Gol04, Section 2.5].”
Constant-Round Privacy Preserving Multiset Union (2013, methodology): “We describe informal definitions of these models; formal definitions of these models can be found in [9].”
Practical Dynamic Searchable Encryption with Small Leakage (2014, methodology): “We define security using the standard simulation model of secure computation [14], requiring that a real-world execution “simulates” an ideal-world (reactive) functionality.”
Survey on Federated Learning Threats: concepts, taxonomy on attacks and defences, experimental study and challenges (2022, methodology): “Note that We refer to SFL protocols as FL protocols that attains the security in the simulation-based framework used to formalize the notion of security [132, 133, 134].”
Secure Federated Matrix Factorization (2019, background): “So no bit of information will be leaked to the server as long as our homomorphic encryption system ensures ciphertext indistinguishability against chosen plaintext attacks [Goldreich, 2009].”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, methodology): “Shortly thereafter the definition was generalized to arbitrary MPC by Goldreich et al. (1987). These definitions contain the important features of the real-ideal paradigm, but”
Secure Face Matching Using Fully Homomorphic Encryption (2018, background): “Homomorphic Encryption for Biometrics: A few biometric authentication approaches [23, 6] based on homomorphic encryption [18] have been proposed, almost all of them in the context of matching binarized templates.”
Lossy trapdoor functions and their applications (2008, background): “Strongly unforgeable one-time signatures can be constructed from one-way functions [24], and more efficiently from collision-resistant hash functions [29].”
Anonymity-preserving data collection (2005, background): “More formally, we give the following de(cid:12)nition of anonymity in a standard cryptographic model, the semi-honest model [14].”
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation (2020, methodology): “We refer the reader to [44] for details on the model.”
ADMM Based Privacy-Preserving Decentralized Optimization (2017, background): “Due to the existence of random r, the Paillier cryptosystem is resistant to the dictionary attack [56].”