Faster batch forgery identification

DOI10.1007/978-3-642-34931-7_26MaRDI QIDQ2876952zbMATH OpenOpenAlexFDO

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

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 curvesscalar multiplicationsignaturesbatch verification

Mathematics Subject Classification ID

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

Recommendations

• A method of finding bad signatures in an RSA-type batch verification
• scientific article; zbMATH DE number 2006800
• scientific article; zbMATH DE number 1440047
• Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures
• A new batch verifying scheme for identifying illegal signatures

Cited in

(12)

• A composable security treatment of ECVRF and batch verifications
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• A method of finding bad signatures in an RSA-type batch verification
• Speeding up multi-scalar multiplications for pairing-based zkSNARKs
• scientific article; zbMATH DE number 1583941 (Why is no real title available?)
• A survey of elliptic curves for proof systems
• On the optimization of Pippenger's bucket method with precomputation
• TA-PDC: provable data contribution with traceable anonymous for group transactions
• Fast elliptic curve scalar multiplications in SN(T)ARK circuits
• Families of SNARK-friendly 2-chains of elliptic curves
• Adaptively secure BLS threshold signatures from DDH and co-CDH
• Simplified small exponent test for batch verification

This page was built for publication: Faster batch forgery identification

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