Zero-knowledge proofs for set membership: Efficient, succinct, modular
D Benarroch, M Campanelli, D Fiore, K Gurkan… - Designs, Codes and …, 2023 - Springer
We consider the problem of proving in zero knowledge that an element of a public set
satisfies a given property without disclosing the element, ie, for some u,“u∈ S and P (u) …
satisfies a given property without disclosing the element, ie, for some u,“u∈ S and P (u) …
Cryptographic accumulators: New definitions, enhanced security, and delegatable proofs
A Barthoulot, O Blazy, S Canard - International Conference on Cryptology …, 2024 - Springer
Cryptographic accumulators, introduced in 1993 by Benaloh and De Mare, represent a set
with a concise value and offer proofs of (non-) membership. Accumulators have evolved …
with a concise value and offer proofs of (non-) membership. Accumulators have evolved …
Set (non-) membership nizks from determinantal accumulators
H Lipmaa, R Parisella - … on Cryptology and Information Security in Latin …, 2023 - Springer
We construct a falsifiable set (non-) membership NIZK that is considerably more efficient
than known falsifiable set (non-) membership NIZKs. It also has a universal CRS. is based …
than known falsifiable set (non-) membership NIZKs. It also has a universal CRS. is based …
Structure-Preserving Compressing Primitives: Vector Commitments, Accumulators and Applications
Compressing primitives such as accumulators and vector commitments, allow to rep-resent
large data sets with some compact, ideally constant-sized value. Moreover, they support …
large data sets with some compact, ideally constant-sized value. Moreover, they support …
[PDF][PDF] Succinct Cryptographic Commitments with Fine-Grained Openings for Decentralized Environments
DS Kolonelos - 2023 - dimkolonelos.github.io
This is probably the most dif cult to write part of the thesis. Undoubtedly many thanks to my
advisor, Dario Fiore, for giving me the opportunity to pursue the PhD in such a wonderful …
advisor, Dario Fiore, for giving me the opportunity to pursue the PhD in such a wonderful …