On the public citation graph

Multivariate Basic Function Secret Sharing from Oblivious Transfer

0 signed · 23 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-46766-1_34openalex-extracted

Efficient Multiparty Protocols Using Circuit Randomization

inferredcites →https://doi.org/10.1007/978-3-030-36030-6_14openalex-extracted

Secure Computation with Preprocessing via Function Secret Sharing

inferredcites →https://doi.org/10.1007/978-3-030-57990-6_11openalex-extracted

Efficient 3-Party Distributed ORAM

inferredcites →https://doi.org/10.1007/978-3-030-77886-6_30openalex-extracted

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation

inferredcites →https://doi.org/10.1007/978-3-031-06944-4_6openalex-extracted

Lightweight, Maliciously Secure Verifiable Function Secret Sharing

inferredcites →https://doi.org/10.1007/978-3-319-63688-7_6openalex-extracted

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited

inferredcites →https://doi.org/10.1007/978-3-540-45146-4_9openalex-extracted

Extending Oblivious Transfers Efficiently

inferredcites →https://doi.org/10.1007/978-3-540-85174-5_32openalex-extracted

Founding Cryptography on Oblivious Transfer – Efficiently

inferredcites →https://doi.org/10.1007/978-3-642-00457-5_18openalex-extracted

Secure Arithmetic Computation with No Honest Majority

inferredcites →https://doi.org/10.1007/978-3-642-36594-2_34openalex-extracted

On the Power of Correlated Randomness in Secure Computation

inferredcites →https://doi.org/10.1007/978-3-642-55220-5_35openalex-extracted

Distributed Point Functions and Their Applications

inferredcites →https://doi.org/10.1007/978-3-662-46803-6_12openalex-extracted

Function Secret Sharing

inferredcites →https://doi.org/10.1109/sfcs.1995.492461openalex-extracted

Private information retrieval

inferredcites →https://doi.org/10.1137/s0097539704383633openalex-extracted

Oblivious Polynomial Evaluation

inferredcites →https://doi.org/10.1145/237814.237996openalex-extracted

Correlated pseudorandomness and the complexity of private computations

inferredcites →https://doi.org/10.1145/293347.293350openalex-extracted

Private information retrieval

inferredcites →https://doi.org/10.1145/2976749.2978429openalex-extracted

Function Secret Sharing

inferredcites →https://doi.org/10.1145/3133956.3133967openalex-extracted

Scaling ORAM for Secure Computation

inferredcites →https://doi.org/10.1145/509907.509980openalex-extracted

Universally composable two-party and multi-party secure computation

inferredcites →https://doi.org/10.1515/popets-2018-0037openalex-extracted

PIR-PSI: Scaling Private Contact Discovery

inferredcites →https://doi.org/10.48550/arxiv.2012.13053openalex-extracted

Function Secret Sharing for PSI-CA:With Applications to Private Contact Tracing

inferredcites →https://doi.org/10.5555/365411.365502openalex-extracted

Efficient oblivious transfer protocols

inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_19openalex-snapshot

A Randomized Protocol for Signing Contracts

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.