“On the Size of Pairing-based Non-interactive Arguments”
E1991250
UNEXPLORED
“On the Size of Pairing-based Non-interactive Arguments” is a cryptography research paper by Jens E. Groth that analyzes and optimizes the efficiency and succinctness of pairing-based non-interactive proof systems.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Groth16 zk-SNARK paper | 1 |
| “On the Size of Pairing-based Non-interactive Arguments” canonical | 1 |
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: “On the Size of Pairing-based Non-interactive Arguments”