all InfoSec news
Succinct Arguments over Towers of Binary Fields
Nov. 20, 2023, 2:48 a.m. |
IACR News www.iacr.org
ePrint Report: Succinct Arguments over Towers of Binary Fields
Benjamin E. Diamond, Jim Posen
We introduce an efficient SNARK for towers of binary fields. Adapting Brakedown (CRYPTO '23), we construct a multilinear polynomial commitment scheme suitable for polynomials over tiny fields, including that with 2 elements. Our commitment scheme, unlike those of previous works, treats small-field polynomials with zero embedding overhead. We further introduce binary-field adaptations of HyperPlonk's (EUROCRYPT '23) product and permutation checks, as well as of Lasso's lookup. …
More from www.iacr.org / IACR News
Secure Coded Distributed Computing
1 day, 19 hours ago |
www.iacr.org
Secure Implementation of SRAM PUF for Private Key Generation
1 day, 20 hours ago |
www.iacr.org
Multiple academic teaching positions
2 days, 18 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Enterprise Security Architect
@ Proofpoint | Utah
Senior Incident Response and Digital Forensics Engineer
@ Danske Bank | Vilnius, Lithuania
SOC Analyst (Remote)
@ Bertelsmann | New York City, US, 10019
Risk Consulting - Protect Tech - Staff - IT Compliance - ISO-NIST-FISMA-PCI DSS and Privacy
@ EY | Bengaluru, KA, IN, 560016
Security Officer Warrenpoint Harbour
@ TSS | Newry, County Down, United Kingdom
Senior DevSecOps Engineer
@ Scientific Systems Company, Inc. | Burlington, Massachusetts, United States