“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.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Jens E. Groth notableWork “On the Size of Pairing-based Non-interactive Arguments”
Jens E. Groth notableWork Groth16 zk-SNARK paper
linked to: “On the Size of Pairing-based Non-interactive Arguments”