@inproceedings {26620,
	title = {Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles},
	journal = {Cryptographers{\textquoteright} Track at the RSA Conference (CT-RSA 2016)},
	volume = {96103188{\textendash}A235921},
	year = {2016},
	month = {03/2016},
	pages = {200 - 216},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {One way to guarantee security against malicious voting servers is to use NIZK shuffle arguments. Up to now, only two NIZK shuffle arguments in the CRS model have been proposed. Both arguments are relatively inefficient compared to known random oracle based arguments. We propose a new, more efficient, shuffle argument in the CRS model. Importantly, its online prover{\textquoteright}s computational complexity is dominated by only two\&nbsp;(n+1)-wide multi-exponentiations, where\&nbsp;n\&nbsp;is the number of ciphertexts. Compared to the previously fastest argument by Lipmaa and Zhang, it satisfies a stronger notion of soundness.\&nbsp;},
	keywords = {Bilinear pairings, CRS model, Mix-net, Non-interactive zero knowledge, Shuffle argument},
	isbn = {978-3-319-29484-1},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-29485-810.1007/978-3-319-29485-8_12},
	url = {http://link.springer.com/10.1007/978-3-319-29485-8_12},
	author = {Fauzi, Prastudy and Lipmaa, Helger},
	editor = {Sako, Kazue}
}
