Updatable signatures and message authentication codes

DOI10.1007/978-3-030-75245-3_25zbMath1479.94303OpenAlexW3159204268MaRDI QIDQ2061942

Daniel Slamanig, Valerio Cini, Erkan Tairi, Christoph Striecks, Sebastian Ramacher

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_25

zbMATH Keywords

message authentication codesupdatable signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Pointcheval-Sanders signature-based synchronized aggregate signature

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptography in constant parallel time
• Updatable and universal common reference strings with applications to zk-SNARKs
• Updatable encryption with post-compromise security
• Optimal channel security against fine-grained state compromise: the safety of messaging
• Key rotation for authenticated encryption
• Efficient redactable signature and application to anonymous credentials
• Fast and secure updatable encryption
• Key-and-argument-updatable QA-NIZKs
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Incremental cryptography revisited: PRFs, nonces and modular design
• Proxy re-encryption and re-signatures from lattices
• (R)CCA secure updatable encryption with integrity protection
• Efficient ratcheting: almost-optimal guarantees for secure messaging
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• The direction of updatable encryption does not matter much
• Improving speed and security in updatable encryption schemes
• Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
• Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys
• Short Randomizable Signatures
• Foundations of Fully Dynamic Group Signatures
• Key Homomorphic PRFs and Their Applications
• New and Improved Key-Homomorphic Pseudorandom Functions
• Trapdoors for hard lattices and new cryptographic constructions
• Unlinkability of Sanitizable Signatures
• Get Shorty via Group Signatures without Encryption
• Security of Sanitizable Signatures Revisited
• Cryptography with Updates
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• Sanitizable Signatures

This page was built for publication: Updatable signatures and message authentication codes