Modification tolerant signature schemes: location and correction

DOI10.1007/978-3-030-35423-7_2zbMath1456.94088OpenAlexW2994821115MaRDI QIDQ2179378

Lucia Moura, Carlisle M. Adams, Thais Bardini Idalino

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_2

zbMATH Keywords

digital signaturecombinatorial group testingcover-free familycontent extraction signaturemalleable signaturemodification correctionmodification localizationmodification tolerant signatureredactable signature

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures

Cites Work

• Families of finite sets in which no set is covered by the union of \(r\) others
• On \(r\)-cover-free families
• Algorithm for creating a digital signature with error detection and correction
• Locating modifications in signed data for partial data integrity
• A General Framework for Redactable Signatures and New Constructions
• Combinatorial Group Testing for Corruption Localizing Hashing
• Indexing Information for Data Forensics
• Group Testing and Batch Verification
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Cryptography
• Sanitizable Signatures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modification tolerant signature schemes: location and correction