scientific article
From MaRDI portal
Publication:3671884
zbMath0521.94012MaRDI QIDQ3671884
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
blind signatureanonymity in bank-proof protocolscryptographic protocol extensionsextension of public kec cryptographypayee anonymitypayer anonymityuntraceable payments
Related Items (only showing first 100 items - show all)
A Pairing-Less Identity-Based Blind Signature with Message Recovery Scheme for Cloud-Assisted Services ⋮ Untraceability of Partial Blind and Blind Signature Schemes ⋮ Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems ⋮ An Efficient Privacy-Preserving E-coupon System ⋮ Off-line electronic cash based on secret-key certificates ⋮ Majority Is Not Enough: Bitcoin Mining Is Vulnerable ⋮ Boosting the Security of Blind Signature Schemes ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ A dynamic quantum group blind signature scheme based on four-particle cluster state ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ On the (im)possibility of secure ElGamal blind signatures ⋮ Privacy-preserving blueprints ⋮ Security analysis of RSA-BSSA ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT ⋮ 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 ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity ⋮ Anonymous tokens with stronger metadata bit hiding from algebraic MACs ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Cryptanalysis of an oblivious PRF from supersingular isogenies ⋮ Security analysis and improvement of a blind semi-quantum signature ⋮ The Abe-Okamoto partially blind signature scheme revisited ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ Cryptography from one-way communication: on completeness of finite channels ⋮ Lattice-based e-cash, revisited ⋮ Oblivious pseudorandom functions from isogenies ⋮ Collective Signature Protocols for Signing Groups ⋮ The Fractal Nature of Bitcoin: Evidence from Wavelet Power Spectra ⋮ Identity-Based Blind Signature from Lattices in Standard Model ⋮ Privacy Preserving Data Mining within Anonymous Credential Systems ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Practical Range Proof for Cryptocurrency Monero with Provable Security ⋮ Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols ⋮ Identity-based blind signature from lattices ⋮ S-money: virtual tokens for a relativistic economy ⋮ Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash ⋮ 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 ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Scalable Divisible E-cash ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Secure Data Deduplication with Reliable Data Deletion in Cloud ⋮ Separation Results on the “One-More” Computational Problems ⋮ On the (in)security of ROS ⋮ On the (in)security of ROS ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ Deciding knowledge in security protocols under some e-voting theories ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Threshold-directed signature scheme based on hybrid number theoretic problems ⋮ An improved E-payment protocol based on quantum blind signature without entanglement ⋮ Blinding for Unanticipated Signatures ⋮ Digital Signatures ⋮ A Practical Multivariate Blind Signature Scheme ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Decentralized Anonymous Micropayments ⋮ Multiparty quantum blind signature scheme based on graph states ⋮ A practical anonymous payment scheme for electronic commerce ⋮ A novel quantum proxy blind signature scheme ⋮ Balancing privacy and accountability in blockchain identity management ⋮ Structure-preserving signatures and commitments to group elements ⋮ Efficient construction of vote-tags to allow open objection to the tally in electronic elections ⋮ Unconditionally secure quantum signatures ⋮ Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system ⋮ Bug attacks ⋮ One-more unforgeability of blind ECDSA ⋮ Black-box accumulation based on lattices ⋮ BlindOR: an efficient lattice-based blind signature scheme from OR-proofs ⋮ Fault-tolerant quantum blind signature protocols against collective noise ⋮ An efficient multi-receipt mechanism for uncoercible anonymous electronic voting ⋮ A correction to a code-based blind signature scheme ⋮ Attack and improvements of fair quantum blind signature schemes ⋮ Security of blind signatures revisited ⋮ Quantum \((t,n)\) threshold proxy blind signature scheme based on Bell states ⋮ A quantum multi-proxy multi-blind-signature scheme based on genuine six-qubit entangled state ⋮ More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ On the design of time-stamped signatures ⋮ Provably secure randomized blind signature scheme based on bilinear pairing ⋮ Efficient traceable ring signature scheme without pairings ⋮ WOTS-S: a quantum secure compact signature scheme for distributed ledger ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ A third-party E-payment protocol based on quantum group blind signature ⋮ A trusted third-party E-payment protocol based on locally indistinguishable orthogonal product states ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Quantum blind signature scheme based on quantum walk ⋮ Provably secure certificate-based proxy blind signature scheme from pairings ⋮ Blind quantum signature with controlled four-particle cluster states ⋮ An improved quantum proxy blind signature scheme based on genuine seven-qubit entangled state ⋮ Conditional e-payments with transferability
This page was built for publication:
