Scalable Multiparty Computation with Nearly Optimal Work and Resilience is a research paper published in Lecture Notes in Computer Science. On theSindex it has a DataRank of 5.2. It has been cited 123 times, with 107 citing works in its 1-hop citation network.
Scored on demand from live citation data
Linked data & code
DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
We only score data papers we can read in full — never from an abstract alone.
Base Score Contribution
0.723
From this paper's citation signal
Citation Network Contribution
4.5
From 85 citing papers with measurable signal
Ranked by each citer's contribution to N(p) — log1p(Cq) divided by its reference count — out of 107 citers.
FWCI
3.02
Citation Percentile
0.9%
Citation Trend
Fields of Study
Keywords
Fast Bounded-Independence Functions and Their Duals
MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More
Interaction-Preserving Compilers for Secure Computation