scientific article; zbMATH DE number 3825707
From MaRDI portal
Publication:3671884
Cited in
(only showing first 100 items - show all)- Efficient algorithms for anonymous Byzantine agreement
- A new quantum blind signature with unlinkability
- Equivocal Blind Signatures and Adaptive UC-Security
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Blind quantum signature with controlled four-particle cluster states
- Quantum blind signature scheme with cluster states based on quantum walk cryptosystem
- A third-party E-payment protocol based on quantum group blind signature
- Provably secure randomized blind signature scheme based on bilinear pairing
- Quantum multi-proxy blind signature based on cluster state
- An improved E-payment protocol based on quantum blind signature without entanglement
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- A new blind signature based on the discrete logarithm problem for untraceability
- An E-payment protocol based on quantum multi-proxy blind signature
- On the unlinkability of randomization-enhanced Chaum's blind signature scheme
- Cryptanalysis and improvement of some quantum proxy blind signature schemes
- Multi-proxy strong blind quantum signature scheme
- Quantum and semi-quantum blind signature schemes based on entanglement swapping
- Coin-based multi-party fair exchange
- Cryptocash, cryptocurrencies, and cryptocontracts
- A practical anonymous multi-authority e-cash scheme.
- New receipt-free voting scheme using double-trapdoor commitment
- Balancing privacy and accountability in blockchain identity management
- Batch RSA signature scheme
- Fail-stop blind signature scheme design based on pairings
- Privacy and verifiability in voting systems: methods, developments and trends
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Multiparty quantum blind signature scheme based on graph states
- A secure quantum voting scheme based on quantum group blind signature
- Deciding knowledge in security protocols under some e-voting theories
- A multi-bank E-payment protocol based on quantum proxy blind signature
- Collective signature protocols for signing groups
- Attack and improvements of fair quantum blind signature schemes
- A novel quantum proxy blind signature scheme
- Proxy blind multi-signature scheme without a secure channel
- Efficient traceable ring signature scheme without pairings
- Majority is not enough: bitcoin mining is vulnerable
- Security of blind signatures revisited
- Reexamining the security of fair quantum blind signature schemes
- Security of a sessional blind signature based on quantum cryptograph
- A correction to a code-based blind signature scheme
- Boosting the Security of Blind Signature Schemes
- A quantum multi-proxy multi-blind-signature scheme based on genuine six-qubit entangled state
- Arbitrated quantum signature with Hamiltonian algorithm based on blind quantum computation
- One-Round ID-Based Blind Signature Scheme without ROS Assumption
- Oblivious keyword search
- Threshold-directed signature scheme based on hybrid number theoretic problems
- Blind quantum signature with blind quantum computation
- On the (in)security of ROS
- Bug attacks
- A practical multivariate blind signature scheme
- Black-box accumulation based on lattices
- A weak quantum blind signature with entanglement permutation
- Fault-tolerant quantum blind signature protocols against collective noise
- Quantum multi-proxy strong blind signature based on block blind coding
- Separation Results on the “One-More” Computational Problems
- Identity-based blind signature from lattices in standard model
- Efficient construction of vote-tags to allow open objection to the tally in electronic elections
- An improved quantum proxy blind signature scheme based on genuine seven-qubit entangled state
- Improved low-computation partially blind signatures.
- Unconditionally secure quantum signatures
- A dynamic quantum group blind signature scheme based on four-particle cluster state
- Structure-preserving signatures and commitments to group elements
- Secure distributed storage and retrieval
- Conditional e-payments with transferability
- Privacy preserving electronic data gathering
- Comment on ``The enhanced quantum blind signature protocol
- On the design of time-stamped signatures
- Identity-based partially blind signature in the standard model for electronic cash
- User efficient recoverable off-line e-cash scheme with fast anonymity revoking
- Anonymous tokens with private metadata bit
- Compact E-Cash and Simulatable VRFs Revisited
- On selective-opening security of deterministic primitives
- 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
- WOTS-S: a quantum secure compact signature scheme for distributed ledger
- Oblivious pseudorandom functions from isogenies
- Provably secure certificate-based proxy blind signature scheme from pairings
- Universally Composable Adaptive Priced Oblivious Transfer
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Cryptography from one-way communication: on completeness of finite channels
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Witness indistinguishability for any single-round argument with applications to access control
- Lattice-based e-cash, revisited
- On removing rejection conditions in practical lattice-based signatures
- A quantum proxy blind signature scheme based on superdense coding
- Quantum blind signature scheme based on quantum walk
- Speeding up exponentiation using an untrusted computational resource
- A high capacity quantum weak blind signature based on logistic chaotic maps
- An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
- Non-interactive anonymous router
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- An efficient blind signature scheme based on SM2 signature algorithm
- On the traceability on RSA-based partially signature with low computation
- Implementation of an E-payment security evaluation system based on quantum blind computing
- A blind signature scheme based on bilinear pairings
- Efficient round-optimal blind signatures in the standard model
- A novel E-payment protocol implented by blockchain and quantum signature
- Security analysis of particular quantum proxy blind signature against the forgery attack
- Provably secure arbitrated-quantum signature
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
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)
