scientific article; zbMATH DE number 3825707

zbMATH Open0521.94012MaRDI QIDQ3671884FDOQ3671884

Authors: David Chaum 

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

blind signatureanonymity in bank-proof protocolscryptographic protocol extensionsextension of public kec cryptographypayee anonymitypayer anonymityuntraceable payments

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (only showing first 100 items - show all)

• Balancing privacy and accountability in blockchain identity management
• A secure quantum voting scheme based on quantum group blind signature
• Boosting the Security of Blind Signature Schemes
• Privacy and verifiability in voting systems: methods, developments and trends
• A multi-bank E-payment protocol based on quantum proxy blind signature
• On the (in)security of ROS
• Attack and improvements of fair quantum blind signature schemes
• Reexamining the security of fair quantum blind signature schemes
• Security of a sessional blind signature based on quantum cryptograph
• Cryptanalysis and improvement of some quantum proxy blind signature schemes
• New receipt-free voting scheme using double-trapdoor commitment
• Multiparty quantum blind signature scheme based on graph states
• One-Round ID-Based Blind Signature Scheme without ROS Assumption
• Threshold-directed signature scheme based on hybrid number theoretic problems
• Improved low-computation partially blind signatures.
• A new blind signature based on the discrete logarithm problem for untraceability
• On the unlinkability of randomization-enhanced Chaum's blind signature scheme
• Collective Signature Protocols for Signing Groups
• Coin-based multi-party fair exchange
• Structure-preserving signatures and commitments to group elements
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• A novel quantum proxy blind signature scheme
• Arbitrated quantum signature with Hamiltonian algorithm based on blind quantum computation
• Efficient construction of vote-tags to allow open objection to the tally in electronic elections
• Unconditionally secure quantum signatures
• Equivocal Blind Signatures and Adaptive UC-Security
• Security of blind signatures revisited
• On the design of time-stamped signatures
• Blind Identity-Based Encryption and Simulatable Oblivious Transfer
• Efficient traceable ring signature scheme without pairings
• Majority Is Not Enough: Bitcoin Mining Is Vulnerable
• A dynamic quantum group blind signature scheme based on four-particle cluster state
• Identity-based partially blind signature in the standard model for electronic cash
• User efficient recoverable off-line e-cash scheme with fast anonymity revoking
• Bug attacks
• An improved quantum proxy blind signature scheme based on genuine seven-qubit entangled state
• Secure distributed storage and retrieval
• Batch RSA signature scheme
• Fault-tolerant quantum blind signature protocols against collective noise
• Separation Results on the “One-More” Computational Problems
• Comment on ``The enhanced quantum blind signature protocol
• A new quantum blind signature with unlinkability
• Blind quantum signature with controlled four-particle cluster states
• An improved E-payment protocol based on quantum blind signature without entanglement
• Multi-proxy strong blind quantum signature scheme
• A weak quantum blind signature with entanglement permutation
• Conditional e-payments with transferability
• Cryptocash, cryptocurrencies, and cryptocontracts
• A practical anonymous multi-authority e-cash scheme.
• Quantum multi-proxy blind signature based on cluster state
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Fail-stop blind signature scheme design based on pairings
• Proxy blind multi-signature scheme without a secure channel
• Quantum blind signature scheme with cluster states based on quantum walk cryptosystem
• Quantum and semi-quantum blind signature schemes based on entanglement swapping
• Identity-Based Blind Signature from Lattices in Standard Model
• Provably secure randomized blind signature scheme based on bilinear pairing
• Black-box accumulation based on lattices
• An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
• Blind quantum signature with blind quantum computation
• Deciding knowledge in security protocols under some e-voting theories
• Oblivious keyword search
• A quantum multi-proxy multi-blind-signature scheme based on genuine six-qubit entangled state
• Privacy preserving electronic data gathering
• Efficient algorithms for anonymous Byzantine agreement
• A correction to a code-based blind signature scheme
• Quantum multi-proxy strong blind signature based on block blind coding
• A third-party E-payment protocol based on quantum group blind signature
• An E-payment protocol based on quantum multi-proxy blind signature
• A Practical Multivariate Blind Signature Scheme
• A high capacity quantum weak blind signature based on logistic chaotic maps
• Security analysis of particular quantum proxy blind signature against the forgery attack
• Provably secure arbitrated-quantum signature
• Quantum blind signature scheme based on quantum walk
• An arbitrated proxy blind signature based on hyper entanglement analysis
• An improved proxy blind signature scheme
• Offline arbitrated quantum blind dual-signature protocol with better performance in resisting existential forgery attack
• On removing rejection conditions in practical lattice-based signatures
• A practical anonymous payment scheme for electronic commerce
• Security of the design of time-stamped signatures
• Speeding up exponentiation using an untrusted computational resource
• A new quantum payment protocol based on a set of local indistinguishable orthogonal product states
• Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
• A quantum proxy signature scheme by using random sequence to blind the message
• Efficient Round-Optimal Blind Signatures in the Standard Model
• Compact E-Cash and Simulatable VRFs Revisited
• Witness indistinguishability for any single-round argument with applications to access control
• Efficient lattice-based blind signatures via Gaussian one-time signatures
• Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system
• On the traceability on RSA-based partially signature with low computation
• Cryptography from one-way communication: on completeness of finite channels
• S-money: virtual tokens for a relativistic economy
• Identity-based blind signature from lattices
• BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Cryptanalysis of an oblivious PRF from supersingular isogenies
• Private set-intersection with common set-up
• Quantum public-key designated verifier signature
• Blind digital signature calculation algorithms based on the ukrainian national digital signature standard DSTU 4145-2002 and Russian digital signature standard GOST R 34.10-2001
• Lattice-based e-cash, revisited

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671884)