Short identity-based signatures with tight security from lattices
type: Item
instance of: scholarly article
title: Short identity-based signatures with tight security from lattices
zbMATH Open document ID: 1485.94145
DOI: 10.1007/978-3-030-81293-5_19
author: Benedikt Wagner
author: Jia-xin Pan
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
zbMATH DE Number: 7495922
zbMATH Keywords: identity-based signatures
zbMATH Keywords: tight security
zbMATH Keywords: short integer solution assumption
zbMATH Keywords: lattices
describes a project that uses: Falcon
MaRDI profile type: Publication
full work available at URL: 978-3-030-81293-5 19
OpenAlex ID: W3182064934
cites work: Tightly-Secure Signatures from Lossy Identification Schemes
cites work: Q4228459
cites work: Tightly-Secure Authenticated Key Exchange
cites work: Pseudorandom Functions and Lattices
cites work: Q3374913
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
cites work: Tightly-Secure Signatures from Chameleon Hash Functions
cites work: (Hierarchical) Identity-Based Encryption from Affine Message Authentication
cites work: Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Fully, (Almost) Tightly Secure IBE and Dual System Groups
cites work: Q4940695
cites work: More efficient digital signatures with tight multi-user security
cites work: Strong Key-Insulated Signature Schemes
cites work: Kurosawa-Desmedt meets tight security
cites work: More efficient (almost) tightly secure structure-preserving signatures
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Hierarchical ID-Based Cryptography
cites work: Practical and tightly-secure digital signatures and authenticated key exchange
cites work: Efficient signature schemes with tight reductions to the Diffie-Hellman problems
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
cites work: Tightly Secure Signatures and Public-Key Encryption
cites work: Simple and more efficient PRFs with tight security from LWE and matrix-DDH
cites work: Tighter security proofs for GPV-IBE in the quantum random oracle model
cites work: Q3615877
cites work: Key-homomorphic pseudorandom functions from LWE with small modulus
cites work: Tightly secure hierarchical identity-based encryption
cites work: Hierarchical Identity-Based Encryption with Tight Multi-challenge Security
cites work: Unbounded HIBE with tight security
cites work: Tight security for the generic construction of identity-based signature (in the multi-instance setting)
cites work: Lattice Signatures without Trapdoors
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Identity-Based Cryptosystems and Signature Schemes
cites work: A generic construction of tightly secure signatures in the multi-user setting
description: scientific article; zbMATH DE number 7495922