On the public citation graph

Searching for High-Value Rare Events with Uncheatable Grid Computing

0 signed · 50 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/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45022-x_39openalex-snapshot
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP
inferredcites →https://doi.org/10.1007/3-540-45353-9openalex-snapshot
Topics in Cryptology — CT-RSA 2001
inferredcites →https://doi.org/10.1007/3-540-45353-9_31openalex-snapshot
Uncheatable Distributed Computations
inferredcites →https://doi.org/10.1007/3-540-46088-8_23openalex-snapshot
Secure Distributed Computing in a Commercial Environment
inferredcites →https://doi.org/10.1007/3-540-48749-2openalex-snapshot
Secure Internet Programming: Security Issues for Mobile and Distributed Objects
inferredcites →https://doi.org/10.1007/3-540-48749-2_12openalex-snapshot
A Sanctuary for Mobile Agents
inferredcites →https://doi.org/10.1007/3-540-48910-xopenalex-snapshot
Advances in Cryptology — EUROCRYPT ’99
inferredcites →https://doi.org/10.1007/3-540-48910-x_28openalex-snapshot
Computationally Private Information Retrieval with Polylogarithmic Communication
inferredcites →https://doi.org/10.1007/3-540-62852-5openalex-snapshot
Mobile Object Systems Towards the Programmable Internet
inferredcites →https://doi.org/10.1007/3-540-68671-1openalex-snapshot
Mobile Agents and Security
inferredcites →https://doi.org/10.1007/3-540-68671-1_4openalex-snapshot
Protecting Mobile Agents Against Malicious Hosts
inferredcites →https://doi.org/10.1007/3-540-68671-1_6openalex-snapshot
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
inferredcites →https://doi.org/10.1016/s1571-0653(04)00310-5openalex-snapshot
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)
inferredcites →https://doi.org/10.1023/a:1006326723002openalex-snapshot
Logical Cryptanalysis as a SAT Problem
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/35.689634openalex-snapshot
Mobile agents and security
inferredcites →https://doi.org/10.1109/icdcs.2004.1281562openalex-snapshot
Uncheatable grid computing
inferredcites →https://doi.org/10.1109/mc.1986.1663102openalex-snapshot
1987 IEEE Symposium on Security and Privacy
inferredcites →https://doi.org/10.1109/secpri.2003.1199338openalex-snapshot
Hardening functions for large scale distributed computations
inferredcites →https://doi.org/10.1145/504450.504472openalex-snapshot
Cryptographic support for fault-tolerant distributed computing
inferredcites →https://doi.org/10.1145/992287.992293openalex-snapshot
Review of "Algorithm design

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.5508openalex-snapshot
A new analytical framework for network vulnerability on subway system
inferred← citeshttps://doi.org/10.1007/978-0-387-78448-9_31openalex-snapshot
Tackling the Collusion Threat in P2P-enhanced Internet Desktop Grids
inferred← citeshttps://doi.org/10.1007/978-1-4614-3296-8_1openalex-snapshot
An Overview of Issues and Recent Developments in Cloud Computing and Storage Security
inferred← citeshttps://doi.org/10.1007/978-3-030-01689-0_18openalex-snapshot
Privacy-Preserving SAT Solving Based on Projection-Equivalence CNF Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-319-11119-3_18openalex-snapshot
Cloud-Oriented SAT Solver Based on Obfuscating CNF Formula
inferred← citeshttps://doi.org/10.1007/978-3-642-36883-7_14openalex-snapshot
Data Leak Detection as a Service
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_28openalex-snapshot
Combinatorial Pair Testing: Distinguishing Workers from Slackers
inferred← citeshttps://doi.org/10.1016/j.cose.2018.01.004openalex-snapshot
Efficient and secure pattern matching with wildcards using lightweight cryptography
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.008openalex-snapshot
Pipelined algorithms to detect cheating in long-term grid computations
inferred← citeshttps://doi.org/10.1049/iet-ifs.2018.5496openalex-snapshot
Computation integrity assurance for emerging distributed computation outsourcing environments, the case of block withholding attack on Bitcoin pools
inferred← citeshttps://doi.org/10.1109/bdcloud.2018.00015openalex-snapshot
Solution Space Adjustable CNF Obfuscation for Privacy-Preserving SAT Solving
inferred← citeshttps://doi.org/10.1109/csf.2015.34openalex-snapshot
On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2017.81openalex-snapshot
Validating the Correctness of Outsourced Computational Tasks Using Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1109/icbc51069.2021.9461142openalex-snapshot
Off-chain Execution and Verification of Computationally Intensive Smart Contracts
inferred← citeshttps://doi.org/10.1109/icccn.2011.6006040openalex-snapshot
Detecting Opportunistic Cheaters in Volunteer Computing
inferred← citeshttps://doi.org/10.1109/incos.2013.30openalex-snapshot
Deceptive Detection and Security Reinforcement in Grid Computing
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536244openalex-snapshot
Distributed asymmetric verification in computational grids
inferred← citeshttps://doi.org/10.1109/memcod.2014.6961846openalex-snapshot
Structure-aware CNF obfuscation for privacy-preserving SAT solving
inferred← citeshttps://doi.org/10.1109/passat/socialcom.2011.13openalex-snapshot
Secure and Verifiable Outsourcing of Large-Scale Biometric Computations
inferred← citeshttps://doi.org/10.1109/pst.2008.12openalex-snapshot
Private and Cheating-Free Outsourcing of Algebraic Computations
inferred← citeshttps://doi.org/10.1109/sp.2013.47openalex-snapshot
Pinocchio: Nearly Practical Verifiable Computation
inferred← citeshttps://doi.org/10.1109/tr.2025.3600445openalex-snapshot
Secure Outsourcing Scheme for Boolean Formulas Truth Assignment Problem
inferred← citeshttps://doi.org/10.1145/1062261.1062280openalex-snapshot
Grid result checking
inferred← citeshttps://doi.org/10.1145/1755688.1755695openalex-snapshot
Securely outsourcing linear algebra computations
inferred← citeshttps://doi.org/10.1145/2535523openalex-snapshot
Secure and verifiable outsourcing of large-scale biometric computations
inferred← citeshttps://doi.org/10.1145/2856449openalex-snapshot
Pinocchio
inferred← citeshttps://doi.org/10.1201/9781584888215-c30openalex-snapshot
Uncheatable Grid Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1305.0110openalex-snapshot
Combinatorial Pair Testing: Distinguishing Workers from Slackers
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.