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

	An Attack on a Trace-Zero Cryptosystem Claus Diem and Jasper Scholten Institut f¨ ur Experimentelle Mathematik, Universit¨ at Duisburg-Essen, Germany and DocID: 1uI0z - View Document
	Communication services empowered with a classical chaos based cryptosystem G. Vidal 1 Institute of Physics DocID: 1uDNn - View Document
	FPGA-based Niederreiter Cryptosystem using Binary Goppa Codes Wen Wang1, Jakub Szefer1, and Ruben Niederhagen2 1. Yale University, USA 2. Fraunhofer Institute SIT, Germany April 9, 2018 DocID: 1ufAq - View Document
	Published in Designs, Codes and Cryptography 14(1):53–56, Reducing the elliptic curve cryptosystem of Meyer-M¨ uller to the cryptosystem of Rabin-Williams DocID: 1tWu0 - View Document
	Optimally Sound Sigma Protocols Under DCRA Helger Lipmaa University of Tartu, Tartu, Estonia Abstract. Given a well-chosen additively homomorphic cryptosystem and a ⌃ protocol with linear answer, Damg˚ DocID: 1tMjN - View Document