Efficient message authentication codes with combinatorial group testing

DOI10.1007/978-3-319-24174-6_10MaRDI QIDQ5097046zbMATH OpenOpenAlexFDO

Authors Kazuhiko Minematsu

Publication date 19 August 2022

Published in Computer Security -- ESORICS 2015 (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 2.5 Generic

Full work available at URL https://doi.org/10.1007/978-3-319-24174-6_10

zbMATH Keywords

combinatorial group testingdata corruptionmessage authentication codeprovable security

Mathematics Subject Classification ID

Computer security (68M25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
• Non-adaptive Group-Testing Aggregate MAC Scheme
• Advances in Cryptology - CRYPTO 2003
• Message authentication, revisited
• Aggregate Message Authentication Codes

Cited in

(5)

• Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
• scientific article; zbMATH DE number 5584127 (Why is no real title available?)
• Non-adaptive Group-Testing Aggregate MAC Scheme
• Group testing aggregate signatures with soundness
• Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing

This page was built for publication: Efficient message authentication codes with combinatorial group testing

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