Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
From MaRDI portal
Publication:4414696
DOI10.1007/3-540-36288-6_3zbMath1033.94552OpenAlexW2167882086MaRDI QIDQ4414696
Publication date: 27 July 2003
Published in: Public Key Cryptography — PKC 2003 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36288-6_3
Related Items (92)
Two-round trip Schnorr multi-signatures via delinearized witnesses ⋮ MuSig2: simple two-round Schnorr multi-signatures ⋮ Round Optimal Secure Multisignature Schemes from Lattice with Public Key Aggregation and Signature Compression ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles ⋮ Fast isomorphic state channels ⋮ Adaptively secure threshold symmetric-key encryption ⋮ Robust subgroup multi-signatures for consensus ⋮ Security of blind signatures revisited ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Short pairing-free blind signatures with exponential security ⋮ Provably secure randomized blind signature scheme based on bilinear pairing ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Boosting the Security of Blind Signature Schemes ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ Plumo: an ultralight blockchain client ⋮ A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Security analysis of RSA-BSSA ⋮ New results and applications for multi-secret sharing schemes ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ Certificateless threshold signature scheme from bilinear maps ⋮ Locally verifiable signature and key aggregation ⋮ Multi-signatures for ECDSA and its applications in blockchain ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Better than advertised security for non-interactive threshold signatures ⋮ Threshold signatures with private accountability ⋮ Non-interactive multisignatures in the plain public-key model with efficient verification ⋮ Fully adaptive Schnorr threshold signatures ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ Practical Schnorr threshold signatures without the algebraic group model ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Oblivious pseudorandom functions from isogenies ⋮ OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss ⋮ Efficient oblivious transfers with access control ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Non-interactive identity-based threshold signature scheme without random oracles ⋮ Hybrid proxy multisignature: a new type multi-party signature ⋮ Indifferentiable deterministic hashing to elliptic and hyperelliptic curves ⋮ Verifiable threshold quantum secret sharing with sequential communication ⋮ Non-Interactive Key Exchange ⋮ Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies ⋮ Rogue-key attacks on the multi-designated verifiers signature scheme ⋮ New identity-based society oriented signature schemes from pairings on elliptic curves ⋮ Security Analysis of the Strong Diffie-Hellman Problem ⋮ Sequential Aggregate Signatures and Multisignatures Without Random Oracles ⋮ One-Round ID-Based Blind Signature Scheme without ROS Assumption ⋮ Private set-intersection with common set-up ⋮ Re-Encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-Encryption ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ Protection of mobile location privacy by using blind signature ⋮ An enhanced \((t,n)\) threshold directed signature scheme ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Another look at non-standard discrete log and Diffie-Hellman problems ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Efficient Sequential Aggregate Signed Data ⋮ Separation Results on the “One-More” Computational Problems ⋮ On the (in)security of ROS ⋮ On the (in)security of ROS ⋮ ID-Based Blind Signature and Proxy Blind Signature without Trusted PKG ⋮ Threshold ring signatures: new definitions and post-quantum security ⋮ Aggregatable distributed key generation ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ An efficient blind signature scheme based on SM2 signature algorithm ⋮ Two-party adaptor signatures from identification schemes ⋮ BETA: biometric-enabled threshold authentication ⋮ Identity-based encryption with security against the KGC: a formal model and its instantiations ⋮ Virtual Smart Cards: How to Sign with a Password and a Server ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Public Verifiability from Pairings in Secret Sharing Schemes ⋮ Security proofs for identity-based identification and signature schemes ⋮ Threshold-directed signature scheme based on hybrid number theoretic problems ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Round-Optimal Blind Signatures from Waters Signatures ⋮ Forward-secure multisignature and blind signature schemes ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users ⋮ Anonymous tokens with private metadata bit ⋮ Lattice-based blind signatures, revisited ⋮ Sequential aggregate signatures with short public keys without random oracles ⋮ A strong designated verifier signature scheme tightly related to the LRSW assumption ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
This page was built for publication: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
