Progressive and efficient verification for digital signatures

DOI10.1007/978-3-031-09234-3_22OpenAlexW4285186757MaRDI QIDQ2096619

Dario Fiore, Elena Pagnin, Cecilia Boschini

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_22

zbMATH Keywords

digital signaturespost-quantum securityamortized efficiencyflexible verificationprogressive verification

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Flexible signatures: making authentication suitable for real-time environments
• Using Freivalds' algorithm to accelerate lattice-based signature verifications
• Speeding-up verification of digital signatures
• Homomorphic Signatures with Efficient Verification for Polynomial Functions
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Multi-key Homomorphic Authenticators
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• The vectorization of ITPACK 2C
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Bonsai Trees, or How to Delegate a Lattice Basis
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Rainbow, a New Multivariable Polynomial Signature Scheme
• Progress in Cryptology - INDOCRYPT 2003

This page was built for publication: Progressive and efficient verification for digital signatures