\textsf{Boomy}: batch opening of multivariate polynomial commitment

DOI10.62056/AN5TX4E-MaRDI QIDQ7326596zbMATH OpenFDO

Authors Thomas Lavaur, Jérôme Lacan

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AN5TX4E-

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A classification of computational assumptions in the algebraic group model
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Fraud and data availability proofs: detecting invalid blocks in light clients
• scientific article; zbMATH DE number 1304185 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Ideals, Varieties, and Algorithms
• Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Modern computer algebra
• On the complexity of multivariate polynomial division
• Orion: zero knowledge proof with linear prover time
• Signatures of correct computation
• Snarky ceremonies
• The algebraic group model and its applications

This page was built for publication: \textsf{Boomy}: batch opening of multivariate polynomial commitment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326596)