scientific article; zbMATH DE number 3825707
From MaRDI portal
Publication:3671884
Cited in
(only showing first 100 items - show all)- Batch RSA signature scheme
- Improved low-computation partially blind signatures.
- A practical anonymous multi-authority e-cash scheme.
- Secure distributed storage and retrieval
- Multiparty quantum blind signature scheme based on graph states
- Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system
- A third-party E-payment protocol based on quantum group blind signature
- Blind quantum signature with controlled four-particle cluster states
- An improved quantum proxy blind signature scheme based on genuine seven-qubit entangled state
- Blind quantum signature with blind quantum computation
- An E-payment protocol based on quantum multi-proxy blind signature
- A trusted third-party E-payment protocol based on quantum blind signature without entanglement
- Offline arbitrated quantum blind dual-signature protocol with better performance in resisting existential forgery attack
- An arbitrated proxy blind signature based on hyper entanglement analysis
- An improved proxy blind signature scheme
- On the traceability on RSA-based partially signature with low computation
- Proxy blind multi-signature scheme without a secure channel
- Private set-intersection with common set-up
- Oblivious keyword search
- A practical anonymous payment scheme for electronic commerce
- A high capacity quantum weak blind signature based on logistic chaotic maps
- A multi-bank E-payment protocol based on quantum proxy blind signature
- An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
- Witness indistinguishability for any single-round argument with applications to access control
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Non-interactive anonymous router
- An efficient blind signature scheme based on SM2 signature algorithm
- On selective-opening security of deterministic primitives
- Quantum and semi-quantum blind signature schemes based on entanglement swapping
- A blind signature scheme based on bilinear pairings
- Anonymous tokens with private metadata bit
- Lattice-based blind signatures, revisited
- Quantum public-key designated verifier signature
- Quantum multi-proxy strong blind signature based on block blind coding
- Quantum multi-proxy blind signature based on cluster state
- Provably secure arbitrated-quantum signature
- Coin-based multi-party fair exchange
- On removing rejection conditions in practical lattice-based signatures
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- One-more unforgeability of blind ECDSA
- Black-box accumulation based on lattices
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- A correction to a code-based blind signature scheme
- Quantum \((t,n)\) threshold proxy blind signature scheme based on Bell states
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Efficient traceable ring signature scheme without pairings
- A trusted third-party E-payment protocol based on locally indistinguishable orthogonal product states
- Quantum blind signature scheme based on quantum walk
- Provably secure certificate-based proxy blind signature scheme from pairings
- Implementation of an E-payment security evaluation system based on quantum blind computing
- A new quantum payment protocol based on a set of local indistinguishable orthogonal product states
- 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
- Identity based blind signature scheme over NTRU lattices
- Security analysis of particular quantum proxy blind signature against the forgery attack
- A secure quantum voting scheme based on quantum group blind signature
- A quantum proxy blind signature scheme based on superdense coding
- A quantum proxy signature scheme by using random sequence to blind the message
- Cryptanalysis and improvement of some quantum proxy blind signature schemes
- A novel E-payment protocol implented by blockchain and quantum signature
- Quantum blind signature scheme with cluster states based on quantum walk cryptosystem
- Security issues in Sarkar's e-cash protocol
- A novel quantum proxy blind signature scheme
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- Security of blind signatures revisited
- A quantum multi-proxy multi-blind-signature scheme based on genuine six-qubit entangled state
- Lower bounds and impossibility results for concurrent self composition
- An attack on a payment scheme
- Efficient algorithms for anonymous Byzantine agreement
- Speeding up exponentiation using an untrusted computational resource
- Security of the design of time-stamped signatures
- Protection of mobile location privacy by using blind signature
- Fail-stop blind signature scheme design based on pairings
- Converting normal DLP-based signatures into blind
- Comment: A new blind signature based on the discrete logarithm problem for untraceability
- WOTS-S: a quantum secure compact signature scheme for distributed ledger
- Cryptography from one-way communication: on completeness of finite channels
- Lattice-based e-cash, revisited
- Oblivious pseudorandom functions from isogenies
- Scalable Divisible E-cash
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Structure-preserving signatures and commitments to group elements
- Efficient construction of vote-tags to allow open objection to the tally in electronic elections
- Majority is not enough: bitcoin mining is vulnerable
- Unconditionally secure quantum signatures
- Identity-based blind signature from lattices in standard model
- Deciding knowledge in security protocols under some e-voting theories
- Bug attacks
- Practical Range Proof for Cryptocurrency Monero with Provable Security
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- Fault-tolerant quantum blind signature protocols against collective noise
- Compact E-Cash and Simulatable VRFs Revisited
- Universally Composable Adaptive Priced Oblivious Transfer
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- An efficient privacy-preserving e-coupon system
- Attack and improvements of fair quantum blind signature schemes
- Privacy Preserving Data Mining within Anonymous Credential Systems
- One-Time Programs
- Security Enhancement of a Flexible Payment Scheme and Its Role-Based Access Control
- One-Round ID-Based Blind Signature Scheme without ROS Assumption
- Privacy and verifiability in voting systems: methods, developments and trends
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)
