@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 {cryptoeprint:2022/851,
	title = {NIWI and New Notions of Extraction for Algebraic Languages},
	journal = {SCN 2022: Security and Cryptography for Networks},
	volume = {13409},
	year = {2022},
	note = {\url{https://eprint.iacr.org/2022/851},
	pages = {687-710},
	publisher = {Springer},
	address = {Cham},
	url = {https://eprint.iacr.org/2022/851},
	author = {Ganesh, Chaya and Khoshakhlagh, Hamidreza 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 {10.1007/978-3-030-57990-6_33,
	title = {On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs},
	journal = {Security and Cryptography for Networks},
	year = {2020},
	pages = {670{\textendash}690},
	publisher = {Springer International Publishing},
	address = {Cham},
	abstract = {We study adaptive security of delayed-input Sigma protocols and non-interactive zero-knowledge (NIZK) proof systems in the common reference string (CRS) model. Our contributions are threefold:We exhibit a generic compiler taking any delayed-input Sigma protocol and returning a delayed-input Sigma protocol satisfying adaptive-input special honest-verifier zero knowledge (SHVZK). In case the initial Sigma protocol also satisfies adaptive-input special soundness, our compiler preserves this property.We revisit the recent paradigm by Canetti et al. (STOC 2019) for obtaining NIZK proof systems in the CRS model via the Fiat-Shamir transform applied to so-called trapdoor Sigma protocols, in the context of adaptive security. In particular, assuming correlation-intractable hash functions for all sparse relations, we prove that Fiat-Shamir NIZKs satisfy either: (i)Adaptive soundness (and non-adaptive zero knowledge), so long as the challenge is obtained by hashing both the prover{\textquoteright}s first round and the instance being proven;(ii)Adaptive zero knowledge (and non-adaptive soundness), so long as the challenge is obtained by hashing only the prover{\textquoteright}s first round, and further assuming that the initial trapdoor Sigma protocol satisfies adaptive-input SHVZK.We exhibit a generic compiler taking any Sigma protocol and returning a trapdoor Sigma protocol. Unfortunately, this transform does not preserve the delayed-input property of the initial Sigma protocol (if any). To complement this result, we also give yet another compiler taking any delayed-input trapdoor Sigma protocol and returning a delayed-input trapdoor Sigma protocol with adaptive-input SHVZK.},
	isbn = {978-3-030-57990-6},
	author = {Ciampi, Michele and Parisella, Roberto and Venturi, Daniele},
	editor = {Galdi, Clemente and Kolesnikov, Vladimir}
}
