Sandwich BUFF: achieving non-resignability using iterative hash functions

DOI10.1007/978-3-032-12296-4_8MaRDI QIDQ7233213zbMATH OpenFDO

Authors Serge Fehr, Yu-Hsuan Huang, Julia Kastner

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12296-4_8

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• BUFFing FALCON without increasing the signature size
• Careful with composition: limitations of the indifferentiability framework
• Digital Signatures Do Not Guarantee Exclusive Ownership
• Hash your keys before signing. BUFF security of the additional NIST PQC signatures
• Hide-and-seek and the non-resignability of the BUFF transform
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• On the (in)security of the BUFF transform
• One Way Hash Functions and DES

Cited in

(1)

• On the buff security of ECDSA with key recovery

This page was built for publication: Sandwich BUFF: achieving non-resignability using iterative hash functions

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