On the public citation graph

Batch verification with applications to cryptography and checking

https://doi.org/10.1007/bfb0054320
0 signed · 58 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-34805-0_37openalex-snapshot
Addition Chain Heuristics
inferredcites →https://doi.org/10.1007/3-540-38424-3_36openalex-snapshot
Fast Checkers for Cryptography
inferredcites →https://doi.org/10.1007/3-540-47555-9_15openalex-snapshot
Resource Requirements for the Application of Addition Chains in Modulo Exponentiation
inferredcites →https://doi.org/10.1007/3-540-47555-9_18openalex-snapshot
Fast Exponentiation with Precomputation
inferredcites →https://doi.org/10.1007/3-540-47555-9_19openalex-snapshot
Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications
inferredcites →https://doi.org/10.1007/3-540-48184-2_36openalex-snapshot
Secure Audio Teleconference
inferredcites →https://doi.org/10.1007/3-540-48658-5_11openalex-snapshot
More Flexible Exponentiation with Precomputation
inferredcites →https://doi.org/10.1007/bf01961540openalex-snapshot
Designing checkers for programs that run in parallel
inferredcites →https://doi.org/10.1007/bfb0053426openalex-snapshot
Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —
inferredcites →https://doi.org/10.1007/s001459900021openalex-snapshot
Batch RSA
inferredcites →https://doi.org/10.1016/0020-0190(92)90093-bopenalex-snapshot
Batch checking with applications to linear functions
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1109/sfcs.1985.64openalex-snapshot
Verifiable secret sharing and achieving simultaneity in the presence of faults
inferredcites →https://doi.org/10.1109/sfcs.1991.185352openalex-snapshot
Checking the correctness of memories
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1109/sfcs.1994.365686openalex-snapshot
On the robustness of functional equations
inferredcites →https://doi.org/10.1109/sfcs.1996.548518openalex-snapshot
Approximate checking of polynomials and functional equations
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/103418.103429openalex-snapshot
Self-testing/correcting for polynomials and for approximate functions
inferredcites →https://doi.org/10.1145/248052.248090openalex-snapshot
Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/73007.73015openalex-snapshot
Designing programs that check their work

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11596981_18openalex-snapshot
Batch Verification with DSA-Type Digital Signatures for Ubiquitous Computing
inferred← citeshttps://doi.org/10.1007/11802167_35openalex-snapshot
Efficient Batch Verification for RSA-Type Digital Signatures in a Ubiquitous Environment
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_19openalex-snapshot
Self-Testing/Correcting Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-59817-4_7openalex-snapshot
Subversion-Resistant Commitment Schemes: Definitions and Constructions
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_11openalex-snapshot
More Efficient Shuffle Argument from Unique Factorization
inferred← citeshttps://doi.org/10.1007/978-3-031-44469-2_19openalex-snapshot
Benchmarking the Setup of Updatable Zk-SNARKs
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_6openalex-snapshot
On Black-Box Verifiable Outsourcing
inferred← citeshttps://doi.org/10.1007/978-3-319-31517-1_10openalex-snapshot
Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_11openalex-snapshot
Removing the Strong RSA Assumption from Arguments over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-319-70697-9_4openalex-snapshot
An Efficient Pairing-Based Shuffle Argument
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_1openalex-snapshot
A Subversion-Resistant SNARK
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_19openalex-snapshot
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-319-99807-7_38openalex-snapshot
An Efficient and Provably Secure Private Polynomial Evaluation Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_25openalex-snapshot
On Memory-Bound Functions for Fighting Spam
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_3openalex-snapshot
Faster Addition and Doubling on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-02620-1_28openalex-snapshot
A Commitment-Consistent Proof of a Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-642-38980-1_32openalex-snapshot
Batch Proofs of Partial Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_28openalex-snapshot
A Shuffle Argument Secure in the Generic Model
inferred← citeshttps://doi.org/10.1007/bfb0054130openalex-snapshot
Fast batch verification for modular exponentiation and digital signatures
inferred← citeshttps://doi.org/10.1007/s00145-021-09379-yopenalex-snapshot
On Subversion-Resistant SNARKs
inferred← citeshttps://doi.org/10.1007/s00145-024-09505-6openalex-snapshot
Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience
inferred← citeshttps://doi.org/10.1007/s10207-022-00655-xopenalex-snapshot
Privacy in targeted advertising on mobile devices: a survey
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.08.005openalex-snapshot
Speeding-up verification of digital signatures
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.1.74openalex-snapshot
Efficient Identification of Bad Signatures in RSA-Type Batch Signature
inferred← citeshttps://doi.org/10.1109/tits.2025.3582595openalex-snapshot
An Enhanced Offline/Online Heterogeneous Signcryption Protocol With Batch Verification for Edge Computing-Based VANETs
inferred← citeshttps://doi.org/10.1109/tvt.2024.3457749openalex-snapshot
A Secure Pairing-Free Certificateless Online/Offline Signcryption Scheme With Batch Verification for Edge Computing-Based VANETs
inferred← citeshttps://doi.org/10.1145/2046707.2046784openalex-snapshot
Practical PIR for electronic commerce
inferred← citeshttps://doi.org/10.1145/276698.276757openalex-snapshot
Spot-checkers
inferred← citeshttps://doi.org/10.1145/586110.586121openalex-snapshot
Almost entirely correct mixing with applications to voting
inferred← citeshttps://doi.org/10.1504/ijes.2015.072372openalex-snapshot
A GAA-based batch authentication and key agreement for LTE networks
inferred← citeshttps://doi.org/10.36227/techrxiv.12952073openalex-snapshot
Privacy in targeted advertising: A survey
inferred← citeshttps://doi.org/10.36227/techrxiv.12952073.v1openalex-snapshot
Privacy in targeted advertising: A survey
inferred← citeshttps://doi.org/10.36227/techrxiv.12952073.v2openalex-snapshot
Privacy in targeted advertising: A survey
inferred← citeshttps://doi.org/10.5821/dissertation-2117-348913openalex-snapshot
Long-term privacy in electronic voting systems
inferred← citeshttps://doi.org/10.70675/adb74676z6fffz4da4zab28z0435fd4b6827openalex-snapshot
Zero-knowledge proofs for secure computation
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.