Efficient Anonymity-Preserving Data Collection Justin Brickell and Vitaly Shmatikov Department of Computer Sciences The University of Texas at Austin Austin, TX, USA

First Page		Document Content
Date: 2007-02-22 22:55:51 Cryptography Ciphertext indistinguishability Chosen-ciphertext attack Adaptive chosen-ciphertext attack Ciphertext Secure multi-party computation Cryptosystem Data anonymization ElGamal encryption		Efficient Anonymity-Preserving Data Collection Justin Brickell and Vitaly Shmatikov Department of Computer Sciences The University of Texas at Austin Austin, TX, USA Add to Reading List Source URL: www.cyber-ta.org Download Document from Source Website File Size: 212,29 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
	Randomized Partial Checking Revisited Shahram Khazaei, Douglas Wikstr¨om, February 13, 2012 Abstract DocID: 1qDIf - View Document
	Efficient Anonymity-Preserving Data Collection Justin Brickell and Vitaly Shmatikov Department of Computer Sciences The University of Texas at Austin Austin, TX, USA DocID: 1qCnF - View Document
	Stealing Keys from PCs using a Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation (extended version) Daniel Genkin Lev Pachmanov DocID: 1qxjY - View Document