scientific article; zbMATH DE number 1088232
From MaRDI portal
Publication:4364549
zbMath0886.94008MaRDI QIDQ4364549
Michael Luby, Ari Juels, Rafail Ostrowsky
Publication date: 17 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Structure-preserving signatures and commitments to group elements ⋮ An Efficient Privacy-Preserving E-coupon System ⋮ BlindOR: an efficient lattice-based blind signature scheme from OR-proofs ⋮ An efficient multi-receipt mechanism for uncoercible anonymous electronic voting ⋮ Security of blind signatures revisited ⋮ Provably secure randomized blind signature scheme based on bilinear pairing ⋮ Boosting the Security of Blind Signature Schemes ⋮ Security analysis of RSA-BSSA ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ DSH: Deniable Secret Handshake Framework ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ Two faces of blindness ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ The Abe-Okamoto partially blind signature scheme revisited ⋮ Provably secure certificate-based proxy blind signature scheme from pairings ⋮ Multi-recastable e-bidding game with dual-blindness ⋮ Private set-intersection with common set-up ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment ⋮ An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems ⋮ An efficient blind signature scheme based on SM2 signature algorithm ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Digital Signatures ⋮ A Practical Multivariate Blind Signature Scheme ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Lattice-based blind signatures, revisited
This page was built for publication: