Marco Pratesi

m.pratesi@cyberethicslab.com

Let’s say you have a box where you put a bunch of names — but instead of showing the whole list every time, you want to prove that one specific name is inside, without opening the box. An RSA accumulator is like a magical digital box. You throw in a bunch of elements (like numbers or IDs), and it gives you back a single compact value — kind of like a seal or a fingerprint of the whole set. Then, if someone asks, “Is this element in the box?” you can give them a short proof, and they’ll be able to check it — without ever seeing the full list. It’s based on strong math (RSA, like in encryption), and it’s super useful for things like digital certificates, anonymous credentials, or even in blockchain, where you want to prove membership in a set without revealing the whole set. More in details: “A cryptographic accumulator is a primitive that produces a short binding commitment to a set of elements together with short membership/non-membership proofs for any element in the set.” The initial state of the RSA Accumulator is the generator sampled from the group of unknown order, g and implies that the list of elements in the accumulator is empty []. an accumulator must have the quasi-commutative mathematical property. quasi-commutative means if adding more elements doesn't depend on the order of operations relative to the fixed accumulator state. The initial state of the RSA Accumulator is the generator sampled from the group of unknown order, g and implies that the list of elements in the accumulator is empty []. an accumulator must have the quasi-commutative mathematical property. quasi-commutative means if adding more elements doesn't depend on the order of operations relative to the fixed accumulator state. EXAMPLE : Cryptographic accumulators offer a privacy-preserving and efficient way to prove set membership. One of their key advantages is that they do not require revealing the full list of elements. Instead, a compact witness allows the holder to prove inclusion of a specific value. Unlike traditional data structures, accumulators avoid costly searches or scans, since membership can be verified through a single modular exponentiation. This makes them highly scalable and suitable for systems where privacy and performance are critical.

Zero Knowledge Proof

Imagine being able to prove to someone that you know a secret — without ever telling them what the secret is. Sounds like magic? That’s exactly what a Zero-Knowledge Proof (ZKP) does. It’s a clever way for someone (the “prover”) to convince someone else (the “verifier”) that something is true, without revealing how or why it's true. A classic example? Imagine a cave with two paths, and a secret door that opens only if you know the magic word. You go into the cave, and the verifier calls out which path you should come out from. If you always manage to come out the right way, the verifier can be sure you know the secret word — without ever hearing it. Zero-Knowledge Proofs are incredibly useful in the digital world — for things like protecting privacy, securing identities, and proving facts without exposing sensitive data. They’re like saying: “Trust me — and here’s proof — but I won’t show you my cards.”   More details: Zero-knowledge protocols are probabilistic assessments, which means they don't prove something with as much certainty as simply revealing the entire information would. They provide unlinkable information that can together show that the validity of the assertion is probable. Properties of Zero Knowledge Proof

• Zero-Knowledge: If the statement is true, the verifier will not know that the statement or was. Here statement can be an absolute value or an algorithm.
• Completeness: If the statement is true then an honest verifier can be convinced eventually.
• Soundness: If the prover is dishonest, they can't convince the verifier of the soundness of the proof.

The Schnorr Protocol: Alice and Bob's Zero-Knowledge Proof Alice wants to prove to Bob that she knows a secret number xx without revealing it. They use a special mathematical group with a public generator gg and a large prime number p. Here's how the interaction goes: