On the public citation graph
Characterizing Linear Size Circuits in Terms of Privacy
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1007/3-540-60084-1_72openalex-snapshot
On the number of random bits in totally private computation
inferredcites →https://doi.org/10.1016/0304-3975(83)90029-4openalex-snapshot
A Boolean function requiring 3n network size
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.1989.63512openalex-snapshot
Privacy and communication complexity
inferredcites →https://doi.org/10.1109/sfcs.1994.365743openalex-snapshot
Reducibility and completeness in multi-party private computations
inferredcites →https://doi.org/10.1137/0206030openalex-snapshot
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
inferredcites →https://doi.org/10.1137/s0097539791194999openalex-snapshot
Private Computations over the Integers
inferredcites →https://doi.org/10.1137/s089548019427634xopenalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferredcites →https://doi.org/10.1145/129712.129780openalex-snapshot
Communication complexity of secure computation (extended abstract)
inferredcites →https://doi.org/10.1145/195058.195408openalex-snapshot
A minimal model for secure computation (extended abstract)
inferredcites →https://doi.org/10.1145/248052.248089openalex-snapshot
Randomness in private computations
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/72981.72995openalex-snapshot
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11599371_21openalex-snapshot
A Novel Method to Maintain Privacy in Mobile Agent Applications
inferred← citeshttps://doi.org/10.1007/11750321_52openalex-snapshot
Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_13openalex-snapshot
Private Computation — k-Connected versus 1-Connected Networks
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_27openalex-snapshot
On Quantum and Approximate Privacy
inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_15openalex-snapshot
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
inferred← citeshttps://doi.org/10.1007/978-3-031-22963-3_15openalex-snapshot
Random Sources in Private Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_11openalex-snapshot
Privacy in Non-private Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_44openalex-snapshot
t-Private and Secure Auctions
inferred← citeshttps://doi.org/10.1007/s00145-005-0329-xopenalex-snapshot
Private Computation: k-Connected versus 1-Connected Networks
inferred← citeshttps://doi.org/10.1007/s001459910005openalex-snapshot
Randomness versus Fault-Tolerance
inferred← citeshttps://doi.org/10.1007/s00224-003-1113-7openalex-snapshot
Quantum and Approximate Privacy
inferred← citeshttps://doi.org/10.1007/s00224-009-9243-1openalex-snapshot
Privacy in Non-private Environments
inferred← citeshttps://doi.org/10.1137/20m1314197openalex-snapshot
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
inferred← citeshttps://doi.org/10.1137/s0097539701385296openalex-snapshot
A Theorem on Sensitivity and Applications in Private Computation
inferred← citeshttps://doi.org/10.1137/s0097539703432785openalex-snapshot
$\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
inferred← citeshttps://doi.org/10.1137/s0097539797321742openalex-snapshot
Reducibility and Completeness in Private Computations
inferred← citeshttps://doi.org/10.1137/s089548010135274xopenalex-snapshot
Amortizing Randomness in Private Multiparty Computations
inferred← citeshttps://doi.org/10.1142/s0218126607003605openalex-snapshot
AN APPLICATION OF ESOP EXPRESSIONS TO SECURE COMPUTATIONS
inferred← citeshttps://doi.org/10.1145/248052.248089openalex-snapshot
Randomness in private computations
inferred← citeshttps://doi.org/10.1145/277697.277710openalex-snapshot
Amortizing randomness in private multiparty computations
inferred← citeshttps://doi.org/10.1145/301250.301313openalex-snapshot
Secure computation with honest-looking parties (extended abstract)
inferred← citeshttps://doi.org/10.1145/301250.301340openalex-snapshot
A theorem on sensitivity and applications in private computation
inferred← citeshttps://doi.org/10.1145/780542.780638openalex-snapshot
Lower bounds on the amount of randomness in private computation
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.64openalex-snapshot
A New Approach to Multi-Party Peer-to-Peer Communication Complexity
inferred← citeshttps://doi.org/10.5753/ctd.2021.15761openalex-snapshot
Sunflower Theorems in Monotone Circuit Complexity
inferred← citeshttps://doi.org/10.70675/f8c855caz7b02z4f11zb87az8d5e6e60e6f0openalex-snapshot
Countermeasures to side-channel attacks and secure multi-party 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.