On the public citation graph

A Handy Multi-coupon System

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/0-387-34799-2_25openalex-snapshot

Untraceable Electronic Cash

inferredcites →https://doi.org/10.1007/0-387-34805-0_22openalex-snapshot

Efficient Identification and Signatures for Smart Cards

inferredcites →https://doi.org/10.1007/11426639_18openalex-snapshot

Compact E-Cash

inferredcites →https://doi.org/10.1007/11507840_12openalex-snapshot

A Privacy-Protecting Coupon System

inferredcites →https://doi.org/10.1007/11889663_22openalex-snapshot

Privacy-Protecting Coupon System Revisited

inferredcites →https://doi.org/10.1007/3-540-36413-7_20openalex-snapshot

A Signature Scheme with Efficient Protocols

inferredcites →https://doi.org/10.1007/3-540-44456-4_10openalex-snapshot

Unlinkable Divisible Electronic Cash

inferredcites →https://doi.org/10.1007/3-540-44598-6_16openalex-snapshot

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

inferredcites →https://doi.org/10.1007/3-540-45067-x_21openalex-snapshot

On Fair E-cash Systems Based on Group Signature Schemes

inferredcites →https://doi.org/10.1007/3-540-45539-6_30openalex-snapshot

Efficient Concurrent Zero-Knowledge in the Auxiliary String Model

inferredcites →https://doi.org/10.1007/3-540-45539-6_31openalex-snapshot

Efficient Proofs that a Committed Number Lies in an Interval

inferredcites →https://doi.org/10.1007/3-540-46416-6_42openalex-snapshot

Self-certified public keys

inferredcites →https://doi.org/10.1007/3-540-46766-1_9openalex-snapshot

Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

inferredcites →https://doi.org/10.1007/3-540-46877-3_44openalex-snapshot

An identity-based identification scheme based on discrete logarithms modulo a composite number

inferredcites →https://doi.org/10.1007/3-540-46885-4_68openalex-snapshot

Efficient Identification and Signatures for Smart Cards

inferredcites →https://doi.org/10.1007/3-540-47555-9_32openalex-snapshot

Transferred Cash Grows in Size

inferredcites →https://doi.org/10.1007/3-540-48071-4_7openalex-snapshot

Wallet Databases with Observers

inferredcites →https://doi.org/10.1007/3-540-48329-2_26openalex-snapshot

Untraceable Off-line Cash in Wallet with Observers

inferredcites →https://doi.org/10.1007/3-540-48405-1openalex-snapshot

Advances in Cryptology — CRYPTO’ 99

inferredcites →https://doi.org/10.1007/3-540-48658-5_19openalex-snapshot

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

inferredcites →https://doi.org/10.1007/3-540-48910-x_8openalex-snapshot

Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes

inferredcites →https://doi.org/10.1007/3-540-49162-7_22openalex-snapshot

Decision Oracles are Equivalent to Matching Oracles

inferredcites →https://doi.org/10.1007/3-540-69053-0_33openalex-snapshot

Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees

inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_18openalex-snapshot

Blind Signatures for Untraceable Payments

inferredcites →https://doi.org/10.1007/978-3-540-24676-3_4openalex-snapshot

Short Signatures Without Random Oracles

inferredcites →https://doi.org/10.1007/978-3-540-28628-8_3openalex-snapshot

Short Group Signatures

inferredcites →https://doi.org/10.1007/978-3-540-28628-8_4openalex-snapshot

Signature Schemes and Anonymous Credentials from Bilinear Maps

inferredcites →https://doi.org/10.1007/978-3-540-30144-8_31openalex-snapshot

An Efficient Online Electronic Cash with Unlinkable Exact Payments

inferredcites →https://doi.org/10.1007/978-3-540-30580-4_28openalex-snapshot

A Verifiable Random Function with Short Proofs and Keys

inferredcites →https://doi.org/10.1007/978-3-540-45146-4_8openalex-snapshot

Practical Verifiable Encryption and Decryption of Discrete Logarithms

inferredcites →https://doi.org/10.1007/bfb0052225openalex-snapshot

Statistical zero knowledge protocols to prove modular polynomial relations

inferredcites →https://doi.org/10.1007/bfb0054143openalex-snapshot

Security analysis of a practical “on the fly” authentication and signature generation

inferredcites →https://doi.org/10.1007/bfb0054154openalex-snapshot

Easy come — Easy go divisible cash

inferredcites →https://doi.org/10.1109/sfcs.1994.365745openalex-snapshot

On monotone formula closure of SZK

inferredcites →https://doi.org/10.1145/266420.266439openalex-snapshot

Verifiable partial key escrow

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-14234-6_36openalex-snapshot

Privacy-Preserving Remote User Authentication with k-Times Untraceability

inferred← citeshttps://doi.org/10.1007/978-3-319-09885-2_18openalex-snapshot

Privacy on Mobile Coupons Booklets

inferred← citeshttps://doi.org/10.1007/978-3-319-16745-9_1openalex-snapshot

An Efficient Privacy-Preserving E-coupon System

inferred← citeshttps://doi.org/10.1007/978-3-319-29968-6_5openalex-snapshot

Guided Specification and Analysis of a Loyalty Card System

inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_28openalex-snapshot

Divisible E-Cash Systems Can Be Truly Anonymous

inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_8openalex-snapshot

Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use

inferred← citeshttps://doi.org/10.1007/978-3-540-77366-5_4openalex-snapshot

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_3openalex-snapshot

Secure Multi-Coupons for Federated Environments: Privacy-Preserving and Customer-Friendly

inferred← citeshttps://doi.org/10.1007/978-3-540-85230-8_19openalex-snapshot

Improvement of Efficiency in (Unconditional) Anonymous Transferable E-Cash

inferred← citeshttps://doi.org/10.1007/978-3-540-85893-5_22openalex-snapshot

Recent Advances in Electronic Cash Design

inferred← citeshttps://doi.org/10.1007/978-3-642-04474-8_24openalex-snapshot

Fair E-Cash: Be Compact, Spend Faster

inferred← citeshttps://doi.org/10.1007/978-3-642-15152-1_11openalex-snapshot

Untraceability and Profiling Are Not Mutually Exclusive

inferred← citeshttps://doi.org/10.1007/978-3-642-25206-8_19openalex-snapshot

Selectively Traceable Anonymous and Unlinkable Token-Based Transactions

inferred← citeshttps://doi.org/10.1007/978-3-642-28496-0_5openalex-snapshot

Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources

inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_8openalex-snapshot

A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN

inferred← citeshttps://doi.org/10.1007/978-3-642-36334-4_20openalex-snapshot

Divisible E-Cash in the Standard Model

inferred← citeshttps://doi.org/10.1007/978-3-642-53997-8_4openalex-snapshot

New Results for the Practical Use of Range Proofs

inferred← citeshttps://doi.org/10.1007/s10207-018-0404-6openalex-snapshot

Deployment and performance evaluation of mobile multicoupon solutions

inferred← citeshttps://doi.org/10.1007/s11235-016-0201-3openalex-snapshot

Efficient E-coupon systems with strong user privacy

inferred← citeshttps://doi.org/10.1007/s12095-026-00902-1openalex-snapshot

A quantum-resistant unlinkable and strongly-unsplittable multi-coupon system

inferred← citeshttps://doi.org/10.1109/csae.2011.5953263openalex-snapshot

Concurrent-secure anonymous fingerprinting scheme supporting batch verification

inferred← citeshttps://doi.org/10.1109/icicisys.2009.5358199openalex-snapshot

Practical compact multi-coupon systems

inferred← citeshttps://doi.org/10.1109/sp54263.2024.00054openalex-snapshot

SwiftRange: A Short and Efficient Zero-Knowledge Range Argument For Confidential Transactions and More

inferred← citeshttps://doi.org/10.1109/trustcom.2011.84openalex-snapshot

A Secure Multicoupon Solution for Multi-merchant Scenarios

inferred← citeshttps://doi.org/10.1145/3387940.3391500openalex-snapshot

An overview of blockchain-based systems and smart contracts for digital coupons

inferred← citeshttps://doi.org/10.1145/3556223.3556264openalex-snapshot

Design and Implementation of a Secure and Distributed Electronic Voucher Management System

inferred← citeshttps://doi.org/10.70675/1318aa16zaa04z47eez9a72z9266c7fcbcfbopenalex-snapshot

Outils cryptographiques pour la protection des contenus et de la vie privée des utilisateurs

inferred← citeshttps://doi.org/10.70675/3cbbcbc0zb601z4d6ezba67zff14f02ec404openalex-snapshot

The GNU Taler system : practical and provably secure electronic payments

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.