scientific article; zbMATH DE number 1024065
From MaRDI portal
Publication:4341756
zbMath0878.68061MaRDI QIDQ4341756
Publication date: 14 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
A practical anonymous payment scheme for electronic commerce ⋮ A fair e-cash payment scheme based on credit ⋮ Anonymous Communication and Anonymous Cash ⋮ An Efficient Privacy-Preserving E-coupon System ⋮ Anonymous Authentication with Spread Revelation ⋮ Efficient traceable ring signature scheme without pairings ⋮ Secure electronic bills of lading: Blind counts and digital signatures ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Improved algebraic MACs and practical keyed-verification anonymous credentials ⋮ Conditional e-payments with transferability ⋮ Cryptocash, cryptocurrencies, and cryptocontracts ⋮ A practical anonymous multi-authority e-cash scheme. ⋮ Prepaid electronic cheques using public-key certificates ⋮ Leakage-resilient ring signature schemes ⋮ User efficient recoverable off-line e-cash scheme with fast anonymity revoking ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ A synchronous quantum blind signature scheme with entanglement swapping ⋮ Security of a sessional blind signature based on quantum cryptograph ⋮ A blind signature protocol with exchangeable signature sequence ⋮ An escrow electronic cash system with limited traceability ⋮ Unclonable Group Identification ⋮ David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware ⋮ On the (in)security of ROS ⋮ On the (in)security of ROS ⋮ Transferable e-cash: a cleaner model and the first practical instantiation ⋮ Towards a security model for computational puzzle schemes ⋮ Access with pseudonyms ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Converting normal DLP-based signatures into blind ⋮ Comment: A new blind signature based on the discrete logarithm problem for untraceability ⋮ Lattice-based blind signatures, revisited ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
This page was built for publication:
