Faster Batch Forgery Identification

DOI10.1007/978-3-642-34931-7_26zbMath1295.94173OpenAlexW2127195783MaRDI QIDQ2876952

Tanja Lange, Daniel J. Bernstein, Jan-Jaap Oosterwijk, Jeroen Doumen

Publication date: 20 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34931-7_26

zbMATH Keywords

elliptic curvessignaturesscalar multiplicationbatch verification

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Families of SNARK-friendly 2-chains of elliptic curves ⋮ A survey of elliptic curves for proof systems ⋮ A composable security treatment of ECVRF and batch verifications ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Simplified small exponent test for batch verification

This page was built for publication: Faster Batch Forgery Identification