Identity-based interactive aggregate signatures from lattices

DOI10.1007/978-3-031-29371-9_20OpenAlexW4361860635MaRDI QIDQ6134230

Shingo Sato, Junji Shikata

Publication date: 21 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-29371-9_20

zbMATH Keywords

lattice-based cryptographyidentity-based aggregate signaturesinteractive aggregation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security proofs for identity-based identification and signature schemes
• Practical and robust secure logging from fault-tolerant sequential aggregate signatures
• Synchronized aggregate signatures from the RSA assumption
• A unified framework for trapdoor-permutation-based sequential aggregate signatures
• Short identity-based signatures with tight security from lattices
• Worst-case to average-case reductions for module lattices
• Fault-Tolerant Aggregate Signatures
• Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures
• Sequential Aggregate Signatures Made Shorter
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Lattice Signatures without Trapdoors
• History-Free Sequential Aggregate Signatures
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• A Schnorr-Like Lightweight Identity-Based Signature Scheme
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Pseudorandom Generator from any One-way Function
• Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations
• Advances in Cryptology - EUROCRYPT 2004
• Generating Shorter Bases for Hard Random Lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Efficient Sequential Aggregate Signed Data
• Public Key Cryptography - PKC 2006
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Identity-based interactive aggregate signatures from lattices