On the public citation graph
Privacy and Communication Complexity
0 signed · 107 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.1016/0022-0000(84)90069-2openalex-snapshot
Communication complexity
inferredcites →https://doi.org/10.1109/sfcs.1982.38openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.3013openalex-snapshot
On Privacy and Partition Arguments
inferred← citeshttps://doi.org/10.1006/jcss.1997.1544openalex-snapshot
Characterizing Linear Size Circuits in Terms of Privacy
inferred← citeshttps://doi.org/10.1006/jcss.1999.1689openalex-snapshot
Protecting Data Privacy in Private Information Retrieval Schemes
inferred← citeshttps://doi.org/10.1007/11429647_4openalex-snapshot
On Private Computation in Incomplete Networks
inferred← citeshttps://doi.org/10.1007/11593447_7openalex-snapshot
Revealing Additional Information in Two-Party Computations
inferred← citeshttps://doi.org/10.1007/11889342_80openalex-snapshot
Multiparty Computations in Non-private Environments
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_12openalex-snapshot
Private Computations in Networks: Topology versus Randomness
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/3-540-45861-1_19openalex-snapshot
Private Computation with Shared Randomness over Broadcast Channel
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_6openalex-snapshot
The All-or-Nothing Nature of Two-Party Secure Computation
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_36openalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_67openalex-snapshot
Privacy for multi-party protocols
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_72openalex-snapshot
On the number of random bits in totally private computation
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_3openalex-snapshot
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_13openalex-snapshot
On Fully Secure MPC with Solitary Output
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_19openalex-snapshot
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_14openalex-snapshot
Cryptography with Weak Privacy
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_10openalex-snapshot
Exploring the Boundaries of Topology-Hiding Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_14openalex-snapshot
A Quantitative Approach to Reductions in Secure 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-70936-7_14openalex-snapshot
Weakly-Private Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_33openalex-snapshot
On Secure Multi-party Computation in Black-Box Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_14openalex-snapshot
Susceptible Two-Party Quantum Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_15openalex-snapshot
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_15openalex-snapshot
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_5openalex-snapshot
On the Power of Two-Party Quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_19openalex-snapshot
Founding Cryptography on Tamper-Proof Hardware Tokens
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_22openalex-snapshot
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_23openalex-snapshot
A Zero-One Law for Secure Multi-party Computation with Ternary Outputs
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_27openalex-snapshot
On the Black-Box Complexity of Optimally-Fair Coin Tossing
inferred← citeshttps://doi.org/10.1007/978-3-642-24829-0_6openalex-snapshot
On Communication Protocols That Compute Almost Privately
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_9openalex-snapshot
Completeness for Symmetric Two-Party Functionalities - Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_9openalex-snapshot
Computing (and Life) Is All about Tradeoffs
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_16openalex-snapshot
On the Communication Required for Unconditionally Secure Multiplication
inferred← citeshttps://doi.org/10.1007/bf00195209openalex-snapshot
On the structure of the privacy hierarchy
inferred← citeshttps://doi.org/10.1007/bf01277955openalex-snapshot
The privacy of dense symmetric functions
inferred← citeshttps://doi.org/10.1007/s00145-005-0419-9openalex-snapshot
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions
inferred← citeshttps://doi.org/10.1007/s00145-006-0346-4openalex-snapshot
Completeness in Two-Party Secure Computation: A Computational View
inferred← citeshttps://doi.org/10.1007/s00145-010-9056-zopenalex-snapshot
On d-Multiplicative Secret Sharing
inferred← citeshttps://doi.org/10.1007/s00145-017-9267-7openalex-snapshot
Completeness for Symmetric Two-Party Functionalities: Revisited
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.1007/s00446-006-0010-0openalex-snapshot
On private computation in incomplete networks
inferred← citeshttps://doi.org/10.1007/s00453-015-0104-9openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90120-xopenalex-snapshot
A communication-privacy tradeoff for modular addition
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.008openalex-snapshot
On communication protocols that compute almost privately
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.013openalex-snapshot
On the computational complexities of three problems related to a privacy measure for large networks under active attack
inferred← citeshttps://doi.org/10.1109/18.265501openalex-snapshot
Privacy, additional information and communication
inferred← citeshttps://doi.org/10.1109/focs.2010.14openalex-snapshot
The Limits of Two-Party Differential Privacy
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413592openalex-snapshot
Crypto-Oriented Neural Architecture Design
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341480openalex-snapshot
Lightweight Multi-robot Communication Protocols for Information Synchronization
inferred← citeshttps://doi.org/10.1109/isit.2014.6875091openalex-snapshot
The oblivious transfer capacity of the wiretapped binary erasure channel
inferred← citeshttps://doi.org/10.1109/isit.2015.7282595openalex-snapshot
Common randomness for secure computing
inferred← citeshttps://doi.org/10.1109/isit.2015.7282639openalex-snapshot
On the oblivious transfer capacity of the degraded wiretapped binary erasure channel
inferred← citeshttps://doi.org/10.1109/isit.2015.7282676openalex-snapshot
Private data transfer over a broadcast channel
inferred← citeshttps://doi.org/10.1109/isit.2015.7282954openalex-snapshot
On coding for secure computing
inferred← citeshttps://doi.org/10.1109/isit.2016.7541860openalex-snapshot
Secure computation of randomized functions
inferred← citeshttps://doi.org/10.1109/isit.2018.8437855openalex-snapshot
The Role of Interaction and Common Randomness in Two-User Secure Computation
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174453openalex-snapshot
Secure Computation to Hide Functions of Inputs
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619607openalex-snapshot
An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195360openalex-snapshot
An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction
inferred← citeshttps://doi.org/10.1109/itw.2012.6404773openalex-snapshot
On secure multiparty sampling for more than two parties
inferred← citeshttps://doi.org/10.1109/itw.2014.6970787openalex-snapshot
A new upperbound for the oblivious transfer capacity of discrete memoryless channels
inferred← citeshttps://doi.org/10.1109/itw.2014.6970828openalex-snapshot
On the oblivious transfer capacity region of the binary erasure broadcast channel
inferred← citeshttps://doi.org/10.1109/itwtpi.2005.1543952openalex-snapshot
Temporary assumptions - quantum and classical
inferred← citeshttps://doi.org/10.1109/jproc.2015.2438312openalex-snapshot
Wireless Network Security: Building on Erasures
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365743openalex-snapshot
Reducibility and completeness in multi-party private computations
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646132openalex-snapshot
Lower bounds for the signature size of incremental schemes
inferred← citeshttps://doi.org/10.1109/tit.2015.2483323openalex-snapshot
Private Interactive Communication Across an Adversarial Channel
inferred← citeshttps://doi.org/10.1109/tit.2016.2568207openalex-snapshot
Communication and Randomness Lower Bounds for Secure Computation
inferred← citeshttps://doi.org/10.1109/tit.2017.2653180openalex-snapshot
Wiretapped Oblivious Transfer
inferred← citeshttps://doi.org/10.1109/tit.2017.2746859openalex-snapshot
Information Complexity Density and Simulation of Protocols
inferred← citeshttps://doi.org/10.1109/tit.2020.2980789openalex-snapshot
Interactive Secure Function Computation
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/s0097539791194999openalex-snapshot
Private Computations over the Integers
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.1137/s089548019427634xopenalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1137/s0895480195288819openalex-snapshot
Computing Functions of a Shared Secret
inferred← citeshttps://doi.org/10.1137/s0895480196306130openalex-snapshot
Randomness in Private Computations
inferred← citeshttps://doi.org/10.1142/s0219749914500415openalex-snapshot
Quantifying the leakage of quantum protocols for classical two-party cryptography
inferred← citeshttps://doi.org/10.1145/1007352.1007395openalex-snapshot
Completeness in two-party secure computation
inferred← citeshttps://doi.org/10.1145/237814.237996openalex-snapshot
Correlated pseudorandomness and the complexity of private computations
inferred← citeshttps://doi.org/10.1145/2554797.2554812openalex-snapshot
Private interactive communication across an adversarial channel
inferred← citeshttps://doi.org/10.1145/2688073.2688074openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
inferred← citeshttps://doi.org/10.1145/2746539.2746548openalex-snapshot
An Interactive Information Odometer and Applications
inferred← citeshttps://doi.org/10.1145/2840728.2840754openalex-snapshot
Information Complexity Density and Simulation of Protocols
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.3929/ethz-a-005954517openalex-snapshot
Exploring the Limits of Multi-Party Computation
inferred← citeshttps://doi.org/10.48550/arxiv.0902.4036openalex-snapshot
On the Power of Two-Party Quantum Cryptography
inferred← citeshttps://doi.org/10.48550/arxiv.1001.3388openalex-snapshot
Approximate Privacy: PARs for Set Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1607.01438openalex-snapshot
On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack
inferred← citeshttps://doi.org/10.54237/profnet.2023.mwrtpidaopenalex-snapshot
The Right to Privacy in the Digital Age : Perspectives on Analysis of Certain Central European Countries’ Legislation and Practice
inferred← citeshttps://doi.org/10.54237/profnet.2023.mwrtpida_1openalex-snapshot
The Right to Privacy—General Considerations
inferred← citeshttps://doi.org/10.5772/intechopen.90909openalex-snapshot
A Review of Several Privacy Violation Measures for Large Networks under Active Attacks
inferred← citeshttps://doi.org/10.71781/9977openalex-snapshot
Quantum nonlocality, cryptography and complexity
inferred← citeshttps://doi.org/10.7916/d8k64r2wopenalex-snapshot
On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks
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.