Introduction to Modern Cryptography, Second Edition

546 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.

Distributed Differentially Private Averaging with Improved Utility and Robustness to Malicious Parties (2020, background): “A more detailed description can be found in Chapter 7 of [54].”
Pseudorandom Functions: Three Decades Later (2017, methodology): “Although these types of proofs are standard in cryptography [63, 82], they will serve as compelling motivations to introduce some additional ideas and should help the reader get accustomed to the notation.”
TrojanNet: Embedding Hidden Trojan Horse Models in Neural Networks (2020, methodology): “To solve this problem, we can apply a cryptographic hash function (Katz & Lindell, 2014) such as SHA-256 to the key before its use in the pseudo-random permutation generator H .”
Cryptϵ: Crypto-Assisted Differential Privacy on Untrusted Servers (2019, background): “For this, the CSP shares a random one-time MAC key,mk i,i ∈[m]with each of the data owners, DO i. Along with the encrypted record D˜ i, DO i sends a Pedersen commitment [88] Com i to the one-time MAC [65] on D˜ i and a short ZKP that the opening of this commitment is a valid one-time MAC on D˜ i. Th”