Identity-based interactive aggregate signatures from lattices

DOI10.1007/978-3-031-29371-9_20MaRDI QIDQ6134230zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Towards lattice based aggregate signatures
• Identity-based key-insulated aggregate signatures, revisited
• Public Key Cryptography - PKC 2006
• Identity based aggregate signcryption schemes
• Identity-based proxy re-signatures from lattices
• Cryptology and Network Security
• Identity-based signatures from lattices: simpler, faster, shorter

Cites work

• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A Schnorr-Like Lightweight Identity-Based Signature Scheme
• A unified framework for trapdoor-permutation-based sequential aggregate signatures
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Sequential Aggregate Signed Data
• Fault-tolerant aggregate signatures
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
• Generating shorter bases for hard random lattices
• History-free sequential aggregate signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Identity-based signatures
• Lattice signatures without trapdoors
• Making NTRU as secure as worst-case problems over ideal lattices
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Practical and robust secure logging from fault-tolerant sequential aggregate signatures
• Public Key Cryptography - PKC 2006
• Security proofs for identity-based identification and signature schemes
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• Sequential aggregate signatures made shorter
• Sequential aggregate signatures with lazy verification from trapdoor permutations. (Extended abstract)
• Short identity-based signatures with tight security from lattices
• Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
• Synchronized aggregate signatures from the RSA assumption
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst-case to average-case reductions for module lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134230)