Partially structure-preserving signatures: lower bounds, constructions and more
type: Item
instance of: scholarly article
title: Partially structure-preserving signatures: lower bounds, constructions and more
zbMATH Open document ID: 1491.94079
DOI: 10.1007/978-3-030-78372-3_11
author: Essam Ghadafi
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7493494
zbMATH Keywords: digital signatures
zbMATH Keywords: bilinear groups
zbMATH Keywords: lower bounds
zbMATH Keywords: structure-preserving
MaRDI profile type: Publication
full work available at URL: 978-3-030-78372-3 11
OpenAlex ID: W3013671167
cites work: Lower bounds on structure-preserving signatures for bilateral messages
cites work: Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
cites work: Tagged One-Time Signatures: Tight Security and Optimal Tag Size
cites work: Structure-Preserving Signatures and Commitments to Group Elements
cites work: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
cites work: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
cites work: Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
cites work: Compact structure-preserving signatures with almost tight security
cites work: Q4249641
cites work: Get Shorty via Group Signatures without Encryption
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Short signatures from the Weil pairing
cites work: Efficient Structure-Preserving Signature Scheme from Standard Assumptions
cites work: Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
cites work: Advances in Cryptology – CRYPTO 2004
cites work: A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
cites work: Rerandomizable signatures under standard assumption
cites work: Type 2 Structure-Preserving Signature Schemes Revisited
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Commuting Signatures and Verifiable Encryption
cites work: Practical Round-Optimal Blind Signatures in the Standard Model
cites work: Pairings for cryptographers
cites work: More efficient (almost) tightly secure structure-preserving signatures
cites work: Dual Form Signatures: An Approach for Proving Security from Static Assumptions
cites work: Formalizing Group Blind Signatures and Practical Constructions without Random Oracles
cites work: Short Structure-Preserving Signatures
cites work: Efficient Round-Optimal Blind Signatures in the Standard Model
cites work: More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
cites work: How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
cites work: Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
cites work: Efficient Fully Structure-Preserving Signatures for Large Messages
cites work: Efficient Noninteractive Proof Systems for Bilinear Groups
cites work: Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
cites work: Structure-Preserving Signatures from Standard Assumptions, Revisited
cites work: Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
cites work: Attribute-Based Signatures
cites work: Cryptography and Coding
cites work: Q4035712
cites work: Short Randomizable Signatures
cites work: Reassessing security of randomizable signatures
cites work: Efficient Identity-Based Encryption Without Random Oracles
description: scientific article; zbMATH DE number 7493494