@inproceedings {43113,
	title = {Counting Vampires: From Univariate Sumcheck to~Updatable ZK-SNARK},
	journal = {Asiacrypt 2022},
	volume = {13792},
	year = {2023},
	pages = {249 - 278},
	publisher = {Springer Nature Switzerland},
	address = {Cham},
	abstract = {We propose a univariate sumcheck argument\&nbsp;Count\&nbsp;of essentially optimal communication efficiency of one group element. While the previously most efficient univariate sumcheck argument of Aurora is based on polynomial commitments,\&nbsp;Count\&nbsp;is based on inner-product commitments. We use\&nbsp;Count to construct a new pairing-based updatable and universal zk-SNARK\&nbsp;Vampire\&nbsp;with the shortest known argument length (four group and two finite field elements) for\&nbsp;NP. In addition,\&nbsp;Vampire\&nbsp;uses the aggregated polynomial commitment scheme of Boneh et al.},
	isbn = {978-3-031-22965-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-031-22966-410.1007/978-3-031-22966-4_9},
	url = {https://link.springer.com/10.1007/978-3-031-22966-4},
	author = {Lipmaa, Helger and Siim, Janno and Zaj{\k a}c, Micha{\l}},
	editor = {Agrawal, Shweta and Lin, Dongdai}
}
@inproceedings {27144,
	title = {A Non-Interactive Shuffle Argument With Low Trust Assumptions},
	journal = {Cryptographers{\textquoteright} Track at the RSA Conference (CT-RSA 2020)},
	year = {2020},
	month = {02/2020},
	pages = {667-692},
	publisher = {Springer, Cham},
	abstract = {A shuffle argument is a cryptographic primitive for proving correct behaviour of mix-networks without leaking any private information. Several recent constructions of non-interactive shuffle arguments avoid the random oracle model but require the public key to be trusted.We augment the most efficient argument by Fauzi et al. [Asiacrypt 2017] with a distributed key generation protocol that assures soundness of the argument if at least one party in the protocol is honest and additionally provide a key verification algorithm which guarantees zero-knowledge even if all the parties are malicious. Furthermore, we simplify their construction and improve security by using weaker assumptions while retaining roughly the same level of efficiency. We also provide an implementation to the distributed key generation protocol and the shuffle argument.},
	keywords = {Non-interactive zero-knowledge, Secure multi-party computation, Shuffle, Subversion security},
	doi = {https://doi.org/10.1007/978-3-030-40186-3_28},
	url = {https://eprint.iacr.org/2019/1420},
	author = {Aggelakis, Antonis and Fauzi, Prastudy and Korfiatis, Georgios and Louridas, Panos and Mergoupis-Anagnou, Foteinos and Siim, Janno and Zaj{\k a}c, Micha{\l}},
	editor = {Jarecki, Stanislaw}
}
