On the public citation graph
Forecasting Run-Times of Secure Two-Party Computation
0 signed · 38 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.1007/11496618_9openalex-snapshot
On Private Scalar Product Computation for Privacy-Preserving Data Mining
inferredcites →https://doi.org/10.1007/3-540-45539-6_22openalex-snapshot
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
inferredcites →https://doi.org/10.1007/3-540-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1007/978-0-387-09699-5_2openalex-snapshot
Practical Privacy-Preserving Benchmarking
inferredcites →https://doi.org/10.1007/978-3-322-94711-6openalex-snapshot
Effiziente Algorithmen für grundlegende Funktionen
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_16openalex-snapshot
Secure Computation of the Mean and Related Statistics
inferredcites →https://doi.org/10.1007/978-3-642-03549-4_20openalex-snapshot
Secure Multiparty Computation Goes Live
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_15openalex-snapshot
Secure Two-Party Computation Is Practical
inferredcites →https://doi.org/10.1007/978-3-642-14423-3_17openalex-snapshot
Linear, Constant-Rounds Bit-Decomposition
inferredcites →https://doi.org/10.1007/s00145-001-0009-4openalex-snapshot
Selecting Cryptographic Key Sizes
inferredcites →https://doi.org/10.1016/j.ejor.2010.08.018openalex-snapshot
Secure collaborative supply chain planning and inverse optimization – The JELS model
inferredcites →https://doi.org/10.1109/2.869367openalex-snapshot
SPEC CPU2000: measuring CPU performance in the New Millennium
inferredcites →https://doi.org/10.1109/compsac.2011.46openalex-snapshot
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
inferredcites →https://doi.org/10.1109/dexa.2009.37openalex-snapshot
Performance Comparison of Secure Comparison Protocols
inferredcites →https://doi.org/10.1109/dexa.2009.84openalex-snapshot
Multiparty Computation of Fixed-Point Multiplication and Reciprocal
inferredcites →https://doi.org/10.1109/mc.2007.296openalex-snapshot
A New Era of Performance Evaluation
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1145/100216.100287openalex-snapshot
The round complexity of secure protocols
inferredcites →https://doi.org/10.1145/1029179.1029204openalex-snapshot
Private collaborative forecasting and benchmarking
inferredcites →https://doi.org/10.1145/1315245.1315306openalex-snapshot
Secure two-party k-means clustering
inferredcites →https://doi.org/10.1145/1529282.1529730openalex-snapshot
On the practical importance of communication complexity for secure multi-party computation protocols
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.5555/365411.365502openalex-snapshot
Efficient oblivious transfer protocols
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_33openalex-snapshot
Automatic Protocol Selection in Secure Two-Party Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-54069-1_3openalex-snapshot
Privacy-Preserving Computation
inferred← citeshttps://doi.org/10.1109/desec.2017.8073825openalex-snapshot
Multiparty computations in varying contexts
inferred← citeshttps://doi.org/10.1109/eurosp.2019.00043openalex-snapshot
EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning
inferred← citeshttps://doi.org/10.1109/eurosp53844.2022.00017openalex-snapshot
CostCO: An automatic cost modeling framework for secure multi-party computation
inferred← citeshttps://doi.org/10.1109/spw.2015.9openalex-snapshot
Choose Wisely: A Comparison of Secure Two-Party Computation Frameworks
inferred← citeshttps://doi.org/10.1145/2435349.2435356openalex-snapshot
Expression rewriting for optimizing secure computation
inferred← citeshttps://doi.org/10.1145/2517872.2517873openalex-snapshot
Efficient secure computation optimization
inferred← citeshttps://doi.org/10.1145/2998392.2998403openalex-snapshot
SecureScala: Scala embedding of secure computations
inferred← citeshttps://doi.org/10.1145/3626232.3653258openalex-snapshot
Estimating the Runtime and Global Network Traffic of SMPC Protocols
inferred← citeshttps://doi.org/10.14722/ndss.2015.23113openalex-snapshot
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
inferred← citeshttps://doi.org/10.14778/3746405.3746425openalex-snapshot
Alchemy: A Query Optimization Framework for Oblivious SQL
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.