On the public citation graph

Two-round Multiparty Secure Computation from Minimal Assumptions

0 signed · 58 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/0-387-34799-2_15openalex-snapshot
How To Sign Given Any Trapdoor Function
inferredcites →https://doi.org/10.1007/11535218_22openalex-snapshot
Secure Computation Without Authentication
inferredcites →https://doi.org/10.1007/3-540-44647-8_1openalex-snapshot
On the (Im)possibility of Obfuscating Programs
inferredcites →https://doi.org/10.1007/3-540-44647-8_2openalex-snapshot
Universally Composable Commitments
inferredcites →https://doi.org/10.1007/3-540-44987-6_8openalex-snapshot
Priced Oblivious Transfer: How to Sell Digital Goods
inferredcites →https://doi.org/10.1007/978-3-030-03807-6_5openalex-snapshot
Two-Round MPC: Information-Theoretic and Black-Box
inferredcites →https://doi.org/10.1007/978-3-030-03807-6_6openalex-snapshot
Perfect Secure Computation in Two Rounds
inferredcites →https://doi.org/10.1007/978-3-030-17656-3_18openalex-snapshot
Degree 2 is Complete for the Round-Complexity of Malicious MPC
inferredcites →https://doi.org/10.1007/978-3-030-17656-3_19openalex-snapshot
Two Round Information-Theoretic MPC with Malicious Security
inferredcites →https://doi.org/10.1007/978-3-030-64378-2_12openalex-snapshot
Reusable Two-Round MPC from DDH
inferredcites →https://doi.org/10.1007/978-3-030-64378-2_13openalex-snapshot
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation
inferredcites →https://doi.org/10.1007/978-3-319-56614-6_6openalex-snapshot
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
inferredcites →https://doi.org/10.1007/978-3-319-78375-8_16openalex-snapshot
Two-Round Multiparty Secure Computation from Minimal Assumptions
inferredcites →https://doi.org/10.1007/978-3-319-78375-8_17openalex-snapshot
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits
inferredcites →https://doi.org/10.1007/978-3-319-96881-0_14openalex-snapshot
Round-Optimal Secure Multiparty Computation with Honest Majority
inferredcites →https://doi.org/10.1007/978-3-319-96881-0_16openalex-snapshot
Promise Zero Knowledge and Its Applications to Round Optimal MPC
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_25openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_31openalex-snapshot
A Framework for Efficient and Composable Oblivious Transfer
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_32openalex-snapshot
Founding Cryptography on Oblivious Transfer – Efficiently
inferredcites →https://doi.org/10.1007/978-3-642-29011-4_29openalex-snapshot
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
inferredcites →https://doi.org/10.1007/978-3-642-54242-8_4openalex-snapshot
Two-Round Secure MPC from Indistinguishability Obfuscation
inferredcites →https://doi.org/10.1007/978-3-662-48000-7_31openalex-snapshot
Multi-identity and Multi-key Leveled FHE from Learning with Errors
inferredcites →https://doi.org/10.1007/978-3-662-48000-7_4openalex-snapshot
Constant-Round MPC with Fairness and Guarantee of Output Delivery
inferredcites →https://doi.org/10.1007/978-3-662-49896-5_26openalex-snapshot
Two Round Multiparty Computation via Multi-key FHE
inferredcites →https://doi.org/10.1007/978-3-662-53018-4_8openalex-snapshot
Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
inferredcites →https://doi.org/10.1007/978-3-662-53644-5_9openalex-snapshot
Multi-key FHE from LWE, Revisited
inferredcites →https://doi.org/10.1007/s00145-008-9036-8openalex-snapshot
A Proof of Security of Yao’s Protocol for Two-Party Computation
inferredcites →https://doi.org/10.1007/s00145-010-9092-8openalex-snapshot
Smooth Projective Hashing and Two-Message Oblivious Transfer
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1109/ccc.2005.9openalex-snapshot
Computationally Private Randomizing Polynomials and Their Applications
inferredcites →https://doi.org/10.1109/csfw.2004.24openalex-snapshot
Universally composable signature, certification, and authentication
inferredcites →https://doi.org/10.1109/focs.2010.86openalex-snapshot
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
inferredcites →https://doi.org/10.1109/focs.2013.13openalex-snapshot
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
inferredcites →https://doi.org/10.1109/focs.2017.60openalex-snapshot
Garbled Protocols and Two-Round MPC from Bilinear Maps
inferredcites →https://doi.org/10.1109/sfcs.1998.743500openalex-snapshot
Oblivious transfer with a memory-bounded receiver
inferredcites →https://doi.org/10.1109/sfcs.2000.892118openalex-snapshot
Randomizing polynomials: A new representation with applications to round-efficient secure computation
inferredcites →https://doi.org/10.1109/sfcs.2001.959888openalex-snapshot
Universally composable security: a new paradigm for cryptographic protocols
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1145/1060590.1060603openalex-snapshot
On lattices, learning with errors, random linear codes, and cryptography
inferredcites →https://doi.org/10.1145/2382196.2382279openalex-snapshot
Foundations of garbled circuits
inferredcites →https://doi.org/10.1145/2488608.2488667openalex-snapshot
Witness encryption and its applications
inferredcites →https://doi.org/10.1145/352600.352639openalex-snapshot
Composition and integrity preservation of secure reactive systems
inferredcites →https://doi.org/10.1145/509907.509980openalex-snapshot
Universally composable two-party and multi-party secure computation
inferredcites →https://doi.org/10.4230/lipics.itcs.2018.21openalex-snapshot
Foundations of Homomorphic Secret Sharing
inferredcites →https://doi.org/10.4230/lipics.itcs.2020.71openalex-snapshot
Separating Two-Round Secure Computation From Oblivious Transfer

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-031-78017-2_4openalex-snapshot
Cryptography in the Common Haar State Model: Feasibility Results and Separations
inferred← citeshttps://doi.org/10.1007/978-3-031-78023-3_1openalex-snapshot
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants
inferred← citeshttps://doi.org/10.1007/978-3-031-91098-2_8openalex-snapshot
Exponent-VRFs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_24openalex-snapshot
On the Message Complexity of Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_17openalex-snapshot
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_19openalex-snapshot
On the Round Complexity of OT Extension
inferred← citeshttps://doi.org/10.1007/978-981-92-3381-6_3openalex-snapshot
HAS-B Tree: An Efficient Utility-Preserving Index for Anonymized Data Management
inferred← citeshttps://doi.org/10.1016/j.jisa.2025.104293openalex-snapshot
Protocol design of non-linear function in secure multi-party computation based on secret sharing
inferred← citeshttps://doi.org/10.1109/tnse.2026.3664315openalex-snapshot
ParallelGSE: Efficient and Secure Shortest Path Search on Encrypted Graphs
inferred← citeshttps://doi.org/10.1145/3662158.3662815openalex-snapshot
On the Communication Complexity of Secure Multi-Party Computation With Aborts
inferred← citeshttps://doi.org/10.1145/3748254openalex-snapshot
Expected Constant Round Byzantine Broadcast under Dishonest Majority
inferred← citeshttps://doi.org/10.1186/s13677-023-00586-5openalex-snapshot
Cloud-SMPC: two-round multilinear maps secure multiparty computation based on LWE assumption
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.