all InfoSec news
Some amortization techniques for FRI-based SNARKs
May 2, 2024, 2:06 a.m. |
IACR News www.iacr.org
ePrint Report: Some amortization techniques for FRI-based SNARKs
Albert Garreta, Hayk Hovhanissyan, Aram Jivanyan, Ignacio Manzur, Isaac Villalobos, Michał Zając
We present two techniques to improve the computational and/or communication costs of STARK proofs: packing and modular split-and-pack.
Packing allows to generate a single proof of the satisfiability of several constraints. We achieve this by packing the evaluations of all relevant polynomials in the same Merkle leaves, and combining all DEEP FRI functions into a single randomized validity function. Our …
communication computational constraints eprint report isaac modular proof report single techniques
More from www.iacr.org / IACR News
$\mathsf{FRAST}$: TFHE-friendly Cipher Based on Random S-boxes
2 days, 21 hours ago |
www.iacr.org
A Deniability Analysis of Signal's Initial Handshake PQXDH
2 days, 21 hours ago |
www.iacr.org
BGJ15 Revisited: Sieving with Streamed Memory Access
2 days, 21 hours ago |
www.iacr.org
Quantum Key-Revocable Dual-Regev Encryption, Revisited
2 days, 21 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Sr. Staff Firmware Engineer – Networking & Firewall
@ Axiado | Bengaluru, India
Compliance Architect / Product Security Sr. Engineer/Expert (f/m/d)
@ SAP | Walldorf, DE, 69190
SAP Security Administrator
@ FARO Technologies | EMEA-Portugal