The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
From MaRDI portal
Publication:1402372
DOI10.1007/s00145-002-0120-1zbMath1045.94012OpenAlexW2054482077WikidataQ56921345 ScholiaQ56921345MaRDI QIDQ1402372
Mihir Bellare, M. Semanko, Chanathip Namprempre, David Pointcheval
Publication date: 27 August 2003
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-002-0120-1
Related Items (58)
Two-round trip Schnorr multi-signatures via delinearized witnesses ⋮ MuSig2: simple two-round Schnorr multi-signatures ⋮ Toward RSA-OAEP Without Random Oracles ⋮ Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Structure-preserving signatures and commitments to group elements ⋮ A new universal designated verifier transitive signature scheme for big graph data ⋮ Practical Round-Optimal Blind Signatures in the Standard Model ⋮ The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Security of blind signatures revisited ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ 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 ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ Security analysis of RSA-BSSA ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ On tight security proofs for Schnorr signatures ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Better than advertised security for non-interactive threshold signatures ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Fully adaptive Schnorr threshold signatures ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ Practical Schnorr threshold signatures without the algebraic group model ⋮ Oblivious pseudorandom functions from isogenies ⋮ Multi-recastable e-bidding game with dual-blindness ⋮ User efficient recoverable off-line e-cash scheme with fast anonymity revoking ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ When e-th Roots Become Easier Than Factoring ⋮ Privacy protection in on-line shopping for electronic documents ⋮ A code-based group signature scheme ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Homomorphic Encryption and Signatures from Vector Decomposition ⋮ Private set-intersection with common set-up ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Another look at non-standard discrete log and Diffie-Hellman problems ⋮ Secure Data Deduplication with Reliable Data Deletion in Cloud ⋮ Transitive Signatures from Braid Groups ⋮ Separation Results on the “One-More” Computational Problems ⋮ Divisible On-Line/Off-Line Signatures ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment ⋮ On selective-opening security of deterministic primitives ⋮ Virtual Smart Cards: How to Sign with a Password and a Server ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Security proofs for identity-based identification and signature schemes ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Oblivious keyword search ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Cryptographic Voting — A Gentle Introduction ⋮ Anonymous tokens with private metadata bit ⋮ A provable secure pairing-free certificateless identification scheme ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
This page was built for publication: The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
