Secure Nearest Neighbor Revisited Bin Yao1 , Feifei Li2 , Xiaokui Xiao3 1 Department of Computer Science and Engineering, Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China

First Page		Document Content
Date: 2013-07-08 15:39:55 Ciphertext indistinguishability Voronoi diagram Chosen-plaintext attack Cryptography Homomorphic encryption RSA		Secure Nearest Neighbor Revisited Bin Yao1 , Feifei Li2 , Xiaokui Xiao3 1 Department of Computer Science and Engineering, Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China Add to Reading List Source URL: www.cs.utah.edu Download Document from Source Website File Size: 319,64 KB Share Document on Facebook

	Encryption-Scheme Security in the Presence of Key-Dependent Messages J. Black ∗ P. Rogaway DocID: 1rlwp - View Document
	An earlier version of this paper appears in Advances in Cryptology — EUROCRYPT ’06, Lecture Notes in Computer Science, vol. 4004, Springer, 2006. This is the full version of that paper. Deterministic Authenticated-En DocID: 1qWnQ - View Document
	Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance Viet Tung Hoang1,2 Reza Reyhanitabar3 DocID: 1qBQm - View Document
	A Formal Treatment of Remotely Keyed Encryption? Matt Blaze1 Joan Feigenbaum1 Moni Naor2 AT&T Labs { Research 180 Park Avenue Florham Park, NJUSA DocID: 1pT7s - View Document
	Non-Malleability: An Introduction and Survey of Recent Developments Cynthia Dwork∗ 1 DocID: 1pPLX - View Document