Lecture Notes on Cryptography

By Shafi Goldwasser, Mihir Bellare. 2001

327 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/807647514754a785db0590fc87d9387703a4833e

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

Prefix-preserving IP address anonymization: measurement-based security evaluation and a new cryptography-based scheme (2002, methodology): “A secure key distribution scheme (such as [ 7 , 8, 9]) suitable for”
Introduction to Modern Cryptography (2020, background): “dissertation [Tsi97] and on the Goldwasser-Bellare lecture notes [GB97].”
Packet leashes: a defense against wormhole attacks in wireless networks (2003, methodology): “To construct the PRF function F, we can use a pseudo-random permutation, i.e., a block cipher [ 16 ], or a message authentication code, such as HMAC [4].”
Efficient Similarity Search over Encrypted Data (2012, methodology): “…S ( H n ) and the real view v R ( H n ) of a n query history CLIENT: Require: E V : encrypted bit vectors, K payload : secret key, t : score limit for all σ V ) and outputs of a pseudorandom permutation and a PCPA-secure encryption are computationally indistinguishable from random values [4], [17].”
Wormhole attacks in wireless networks (2006, methodology): “To construct the PRF function F, we can use a pseudo-random permutation, i.e., a block cipher [ 12 ], or a message authentication code, such as HMAC [4].”
On Cryptographic Assumptions and Challenges (2003, background): “The last twenty years have seen great progress in de£ning what a good systems is in the area of Foundations of Cryptography (see Goldreich [24] for a more formal treatment and Bellare and Goldwasser [ 8 ] for a more concrete one).”
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks (2002, background): “A more formal definition of one-way hash functions is provided by Goldwasser and Bellare [ 11 ], and a number of such functions have been proposed, including MD5 [40] and SHA-1 [29].”
Practical techniques for searches on encrypted data (2000, background): “(Assuming that the pre-encryption is a pseudo-random permutation, then due to the birthday paradox [15], the probability that at least one collision happens after en-crypting words is at most ( 1)=2 (n(cid:0)m+1) ) With this ﬁx, the resulting scheme is provably secure, and in fact we can also show…”
Privacy-preserving matrix factorization (2013, background): “Our security guarantees will hold under the honest but curious threat model [17].”