Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
type: Item
instance of: scholarly article
title: Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
DOI: 10.1007/978-3-031-57718-5_6
author: Aikaterini Mitrokotsa
author: Sayantan Mukherjee
author: Mahdi Sedaghat
author: Daniel Slamanig
author: Q6107260
publication date: 2024-11-12T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7941487
MaRDI profile type: MaRDI publication profile
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: 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: Shorter QA-NIZK and SPS with tighter security
cites work: Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
cites work: Simplified Threshold RSA with Adaptive and Proactive Security
cites work: Computing on authenticated data: new privacy definitions and constructions
cites work: Policy-compliant signatures
cites work: Better than advertised security for non-interactive threshold signatures
cites work: The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
cites work: Achieving optimal anonymity in transferable e-cash with a judge
cites work: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
cites work: Q4474196
cites work: One round threshold ECDSA without roll call
cites work: Efficient Structure-Preserving Signature Scheme from Standard Assumptions
cites work: Composable and modular anonymous credentials: definitions and practical constructions
cites work: Q4228521
cites work: Q4941850
cites work: Malleable proof systems and applications
cites work: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
cites work: Threshold structure-preserving signatures
cites work: Fully adaptive Schnorr threshold signatures
cites work: Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
cites work: An algebraic framework for Diffie-Hellman assumptions
cites work: Commuting signatures and verifiable encryption
cites work: Practical Round-Optimal Blind Signatures in the Standard Model
cites work: The algebraic group model and its applications
cites work: More efficient (almost) tightly secure structure-preserving signatures
cites work: Short structure-preserving signatures
cites work: More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Tightly Secure Signatures and Public-Key Encryption
cites work: Q3374910
cites work: Improved (almost) tightly-secure structure-preserving signatures
cites work: Improved structure preserving signatures under standard bilinear assumptions
cites work: Structure-preserving signatures from standard assumptions, revisited
cites work: Quasi-adaptive NIZK for linear subspaces revisited
cites work: FROST: Flexible round-optimized Schnorr threshold signatures
cites work: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
cites work: Linearly Homomorphic Structure-Preserving Signatures and Their Applications
cites work: Short group signatures via structure-preserving signatures: standard model security from simple assumptions
cites work: Q4474183
cites work: The kernel matrix Diffie-Hellman assumption
cites work: Q4035712
cites work: Efficient signature generation by smart cards
cites work: How to share a secret
description: scientific article; zbMATH DE number 7941487