Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker

Reference : Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/36635

Title :	Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker
Language :	English
Author, co-author :	Bana, Gergely [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Chadha, Rohit [University of Missouri - MU > Computer Science]
	Eeralla, Ajay [University of Missouri - MU > Computer Science]
Publication date :	2018
Main document title :	Computer Security
Pages :	350–372
Peer reviewed :	Yes
Event name :	ESORICS 2018, 23rd European Symposium on Research in Computer Security
Event date :	2018
Permalink :	http://hdl.handle.net/10993/36635

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	Esorics18.pdf		Publisher postprint	1.1 MB	View/Open

All documents in ORBi^lu are protected by a user license.