A 2-Round Anonymous Veto Protocol A new solution to the dining cryptographers problem Speaker: Feng Hao Computer Laboratory University of Cambridge

First Page		Document Content
Date: 2007-07-03 13:14:36 Dining cryptographers problem Mathematics Applied mathematics Cryptography Cryptographic protocols Anonymous veto network		A 2-Round Anonymous Veto Protocol A new solution to the dining cryptographers problem Speaker: Feng Hao Computer Laboratory University of Cambridge Add to Reading List Source URL: homepages.cs.ncl.ac.uk Download Document from Source Website File Size: 188,92 KB Share Document on Facebook

	Defining “Anonymity” in Networked Communication, version 1 Joan Feigenbaum1 Technical Report YALEU/DCS/TR-‐1448 December 2011 DocID: 1qqXe - View Document
	page bidon... MULTIPARTY UNCONDITIONALLY SECURE PROTOCOLS (Extended Abstract) DocID: 1qkUg - View Document
	Design and Analysis of Efficient Anonymous-Communication Protocols DocID: 1pLjz - View Document
	J. Cryptology:Journal of CryptologyInternational Association for Cryptologic Research DocID: 1pFxr - View Document
	Yale University Department of Computer Science Security Analysis of Accountable Anonymity in Dissent Ewa Syta Aaron Johnson Henry Corrigan-Gibbs DocID: 1m0qm - View Document