Tightly-Secure Signatures from Lossy Identification Schemes

DOI10.1007/978-3-642-29011-4_34zbMath1297.94115OpenAlexW1582357539MaRDI QIDQ2894432

Pierre-Alain Fouque, Mehdi Tibouchi, Michel Abdalla, Vadim Lyubashevsky

Publication date: 29 June 2012

Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_34

zbMATH Keywords

signature schemesFiat-Shamirtight reductions

Mathematics Subject Classification ID

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

Related Items (28)

On the security loss of unique signatures ⋮ Tightly secure signatures from lossy identification schemes ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Optimal tightness for chain-based unique signatures ⋮ On tightly-secure (linkable) ring signatures ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ A lightweight identification protocol based on lattices ⋮ Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ Tight adaptive reprogramming in the QROM ⋮ Practical dynamic group signatures without knowledge extractors ⋮ On the tightness of forward-secure signature reductions ⋮ Lossy Identification Schemes from Decisional RSA ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Compact structure-preserving signatures with almost tight security ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ More efficient digital signatures with tight multi-user security ⋮ Verifiable random functions with optimal tightness ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Identity-based signatures in standard model ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Short identity-based signatures with tight security from lattices

This page was built for publication: Tightly-Secure Signatures from Lossy Identification Schemes