On the public citation graph

Efficient anonymous multicast and reception

https://doi.org/10.1007/bfb0052251
0 signed · 33 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-39568-7_23openalex-snapshot
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
inferredcites →https://doi.org/10.1007/3-540-46885-4_69openalex-snapshot
The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability
inferredcites →https://doi.org/10.1007/978-3-642-76462-2_32openalex-snapshot
ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead
inferredcites →https://doi.org/10.1007/bf00206326openalex-snapshot
The dining cryptographers problem: Unconditional sender and recipient untraceability
inferredcites →https://doi.org/10.1016/0167-4048(87)90087-3openalex-snapshot
Networks without user observability
inferredcites →https://doi.org/10.1038/scientificamerican0892-96openalex-snapshot
Achieving Electronic Privacy
inferredcites →https://doi.org/10.1109/secpri.1997.601314openalex-snapshot
Anonymous connections and onion routing
inferredcites →https://doi.org/10.1109/sfcs.1993.366820openalex-snapshot
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
inferredcites →https://doi.org/10.1109/sfcs.1994.365743openalex-snapshot
Reducibility and completeness in multi-party private computations
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1145/100216.100270openalex-snapshot
Pseudo-random generators under uniform assumptions
inferredcites →https://doi.org/10.1145/167088.167260openalex-snapshot
Cryptographic defense against traffic analysis
inferredcites →https://doi.org/10.1145/237814.238015openalex-snapshot
Adaptively secure multi-party computation
inferredcites →https://doi.org/10.1145/25048.1059521openalex-snapshot
How to implement ISDNs without user observability---Someremarks
inferredcites →https://doi.org/10.1145/259380.259416openalex-snapshot
Randomness vs. fault-tolerance
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/358549.358563openalex-snapshot
Untraceable electronic mail, return addresses, and digital pseudonyms
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44702-4_2openalex-snapshot
Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_15openalex-snapshot
Using Approximation Hardness to Achieve Dependable Computation
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_194openalex-snapshot
DC Network
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_194openalex-snapshot
Dining Cryptographers (DC) Network
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_194-2openalex-snapshot
Dining Cryptographers (DC) Network
inferred← citeshttps://doi.org/10.1007/s10207-016-0318-0openalex-snapshot
Broadcast anonymous routing (BAR): scalable real-time anonymous communication
inferred← citeshttps://doi.org/10.1007/s44291-026-00191-1openalex-snapshot
Privacy and security threats and protection in machine learning
inferred← citeshttps://doi.org/10.1007/springerreference_197openalex-snapshot
Data encryption standard (DES)
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.12.011openalex-snapshot
Technical challenges of network anonymity
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.11.009openalex-snapshot
Survey on anonymous communications in computer networks
inferred← citeshttps://doi.org/10.1016/j.jss.2007.08.037openalex-snapshot
Recursive protocol for group-oriented authentication with key distribution
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004362openalex-snapshot
P/sup 5/ : a protocol for scalable anonymous communication
inferred← citeshttps://doi.org/10.1145/288090.288098openalex-snapshot
The design, implementation and operation of an email pseudonym server
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.