@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 {43399,
	title = {Set (Non-)Membership NIZKs from Determinantal Accumulators},
	journal = {International Conference on Cryptology and Information Security in Latin America Latincrypt-2023},
	year = {2023},
	author = {Lipmaa, Helger and Parisella, Roberto}
}
@inproceedings {28259,
	title = {Efficient NIZKs for~Algebraic Sets},
	journal = {Advances in Cryptology {\textendash} Asiacrypt 2021},
	volume = {LNCS, volume 13092},
	year = {2021},
	pages = {128 - 158},
	publisher = {Springer International Publishing},
	address = {Cham},
	isbn = {978-3-030-92077-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-030-92078-4_5},
	url = {https://link.springer.com/content/pdf/10.1007/978-3-030-92078-4_5},
	author = {Couteau, Geoffroy and Lipmaa, Helger and Parisella, Roberto and Arne Tobias {{\O}degaard}},
	editor = {Tibouchi, Mehdi and Wang, Huaxiong}
}
@inproceedings {27574,
	title = {Somewhere Statistically Binding Commitment Schemes with Applications},
	journal = {FC 2021},
	volume = {LNCS, volume 12674},
	year = {2021},
	pages = {436-456},
	publisher = {Springer},
	abstract = {We define a new primitive that we call a somewhere statistically binding (SSB) commitment scheme, which is a generalization of dual-mode commitments but has similarities with SSB hash functions (Hubacek and Wichs, ITCS 2015) without local opening. In (existing) SSB hash functions, one can compute a hash of a vector v that is statistically binding in one coordinate of v. Meanwhile, in SSB commitment schemes, a commitment of a vector v is statistically binding in some coordinates of v and is statistically hiding in the other coordinates. The set of indices where binding holds is predetermined but known only to the commitment key generator. We show that the primitive can be instantiated by generalizing the succinct Extended Multi-Pedersen commitment scheme (Gonz{\'a}lez et al., Asiacrypt 2015). We further introduce the notion of functional SSB commitment schemes and, importantly, use it to get an efficient quasi-adaptive NIZK for arithmetic circuits and efficient oblivious database queries.},
	keywords = {Commitment scheme, oblivious transfer, QA-NIZK, SSB},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Pindado, Zaira and Siim, Janno}
}
@inproceedings {28260,
	title = {Verifiably-Extractable OWFs and~Their Applications to~Subversion Zero-Knowledge},
	journal = {Asiacrypt 2021},
	volume = {LNCS, volume 13093},
	year = {2021},
	pages = {618 - 649},
	publisher = {Springer International Publishing},
	address = {Cham},
	isbn = {978-3-030-92067-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-030-92068-5_21},
	url = {https://link.springer.com/content/pdf/10.1007/978-3-030-92068-5_21},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Siim, Janno and Zajac, Michal and Arne Tobias {{\O}degaard}},
	editor = {Tibouchi, Mehdi and Wang, Huaxiong}
}
@inproceedings {26618,
	title = {An Efficient Pairing-Based Shuffle Argument},
	journal = {ASIACRYPT 2017},
	volume = {10626},
	year = {2017},
	pages = {97 - 127},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {We construct the most efficient known pairing-based NIZK shuffle argument. It consists of three subarguments that were carefully chosen to obtain optimal efficiency of the shuffle argument:1. A same-message argument based on the linear subspace QANIZK argument of Kiltz and Wee,\&nbsp;2. A (simplified) permutation matrix argument of Fauzi, Lipmaa, and Zaj{\k a}c,\&nbsp;3. A (simplified) consistency argument of Groth and Lu.We prove the knowledge-soundness of the first two subarguments in the generic bilinear group model, and the culpable soundness of the third subargument under a KerMDH assumption. This proves the soundness of the shuffle argument. We also discuss our partially optimized implementation that allows one to prove a shuffle of\&nbsp;100000100000\&nbsp;ciphertexts in less than a minute and verify it in less than 1.5\&nbsp;min.},
	keywords = {Common Reference String, Generic group model, Mix-net, Shuffle argument, Zero knowledge},
	isbn = {978-3-319-70696-2},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-70697-910.1007/978-3-319-70697-9_4},
	url = {http://link.springer.com/10.1007/978-3-319-70697-9_4},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Zaj{\k a}c, Micha{\l} and Siim, Janno},
	editor = {Takagi, Tsuyoshi and Peyrin, Thomas}
}
@book {43072,
	title = {Lecture Notes in Computer ScienceSecure IT Systems},
	volume = {10674},
	year = {2017},
	publisher = {Springer International Publishing},
	address = {Cham},
	isbn = {978-3-319-70289-6},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-70290-2},
	url = {http://link.springer.com/content/pdf/10.1007/978-3-319-70290-2http://link.springer.com/content/pdf/10.1007/978-3-319-70290-2.pdf},
	editor = {Lipmaa, Helger and Mitrokotsa, Aikaterini and Matulevi{\v c}ius, Raimundas}
}
@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}
}
@inproceedings {26617,
	title = {A Shuffle Argument Secure in the Generic Model},
	journal = {International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2016)},
	volume = {1003223592127},
	year = {2016},
	month = {12/2016},
	pages = {841 - 872},
	publisher = {Springer Berlin Heidelberg},
	address = {Berlin, Heidelberg},
	abstract = {We propose a new random oracle-less NIZK shuffle argument. It has a simple structure, where the first verification equation ascertains that the prover has committed to a permutation matrix, the second verification equation ascertains that the same permutation was used to permute the ciphertexts, and the third verification equation ascertains that input ciphertexts were {\textquotedblleft}correctly{\textquotedblright} formed. The new argument has 3.5 times more efficient verification than the up-to-now most efficient shuffle argument by Fauzi and Lipmaa (CT-RSA 2016). Compared to the Fauzi-Lipmaa shuffle argument, we (i) remove the use of knowledge assumptions and prove our scheme is sound in the generic bilinear group model, and (ii) prove standard soundness, instead of culpable soundness.},
	isbn = {978-3-662-53889-0},
	issn = {0302-9743},
	doi = {10.1007/978-3-662-53890-610.1007/978-3-662-53890-6_28},
	url = {http://link.springer.com/10.1007/978-3-662-53890-6_28},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Zaj{\k a}c, Micha{\l}},
	editor = {Jung Hee {Cheon} and Takagi, Tsuyoshi}
}
@inproceedings {26619,
	title = {Efficient Non-Interactive Zero Knowledge Arguments for Set Operations},
	journal = {FC 2014: Financial Cryptography and Data Security},
	volume = {8437261970},
	year = {2014},
	pages = {216 - 233},
	publisher = {Springer Berlin Heidelberg},
	address = {Berlin, Heidelberg},
	abstract = {We propose a non-interactive zero knowledge\&nbsp;pairwise multiset sum equality test (PMSET)argument of knowledge in the common reference string (CRS) model that allows a prover to show that the given committed multisets\&nbsp;Aj for\&nbsp;j∈{1,2,3,4} satisfy\&nbsp;A1⊎A2=A3⊎A4, i.e., every element is contained in\&nbsp;A1 and\&nbsp;A2 exactly as many times as in\&nbsp;A3 and\&nbsp;A4. As a corollary to the\&nbsp;PMSET argument, we present arguments that enable to efficiently verify the correctness of various (multi)set operations, for example, that one committed set is the intersection or union of two other committed sets. The new arguments have constant communication and verification complexity (in group elements and group operations, respectively), whereas the CRS length and the prover{\textquoteright}s computational complexity are both proportional to the cardinality of the (multi)sets. We show that one can shorten the CRS length at the cost of a small increase of the communication and the verifier{\textquoteright}s computation.},
	isbn = {978-3-662-45471-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-662-45472-510.1007/978-3-662-45472-5_14},
	url = {https://link.springer.com/chapter/10.1007/978-3-662-45472-5_14},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Zhang, Bingsheng},
	editor = {Christin, Nicolas and Safavi-Naini, Reihaneh}
}
@inproceedings {26616,
	title = {Efficient Modular NIZK Arguments from Shift and Product},
	journal = {Cryptology and Network Security (CANS 2013)},
	volume = {8257371918411522619174},
	year = {2013},
	pages = {92 - 121},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {We propose a non-interactive product argument, that is more efficient than the one by Groth and Lipmaa, and a novel shift argument. We then use them to design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover{\textquoteright}s computation. We construct NIZK arguments for\&nbsp;NP-complete languages,\&nbsp;Set-Partition,\&nbsp;Subset-Sum\&nbsp;and\&nbsp;Decision-Knapsack, with constant communication, subquadratic prover{\textquoteright}s computation and linear verifier{\textquoteright}s computation.},
	isbn = {978-3-319-02936-8},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-02937-510.1007/978-3-319-02937-5_6},
	url = {https://link.springer.com/chapter/10.1007/978-3-319-02937-5_6},
	author = {Fauzi, Prastudy and Lipmaa, Helger and Zhang, Bingsheng},
	editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Jon M. {Kleinberg} and Mattern, Friedemann and John C. {Mitchell} and Naor, Moni and Nierstrasz, Oscar and Rangan, Pandu and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Moshe Y. {Vardi} and Weikum, Gerhard and Abdalla, Michel and Nita-Rotaru, Cristina and Dahab, Ricardo}
}
