On the public citation graph

L1 - An Intermediate Language for Mixed-Protocol Secure Computation

0 signed · 70 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/11496618_9openalex-snapshot
On Private Scalar Product Computation for Privacy-Preserving Data Mining
inferredcites →https://doi.org/10.1007/3-540-44586-2_9openalex-snapshot
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
inferredcites →https://doi.org/10.1007/3-540-44987-6_18openalex-snapshot
Multiparty Computation from Threshold Homomorphic Encryption
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-540-24676-3_3openalex-snapshot
Secure Computation of the k th -Ranked Element
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-14577-3_6openalex-snapshot
Secure Computation with Fixed-Point Numbers
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/dexa.2009.32openalex-snapshot
Improving Practical Performance on Secure and Private Collaborative Linear Programming
inferredcites →https://doi.org/10.1109/dexa.2009.37openalex-snapshot
Performance Comparison of Secure Comparison Protocols
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/1255329.1255333openalex-snapshot
A domain-specific programming language for secure multiparty computation
inferredcites →https://doi.org/10.1145/1315245.1315306openalex-snapshot
Secure two-party k-means clustering
inferredcites →https://doi.org/10.1145/1455770.1455804openalex-snapshot
FairplayMP
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/1536414.1536440openalex-snapshot
Fully homomorphic encryption using ideal lattices
inferredcites →https://doi.org/10.1145/1764873.1764876openalex-snapshot
Dummynet revisited
inferredcites →https://doi.org/10.1145/1866307.1866358openalex-snapshot
TASTY
inferredcites →https://doi.org/10.1145/259380.259405openalex-snapshot
Multi party computations
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation

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-030-17138-4_5openalex-snapshot
$$\textsc {Wys}^\star $$ : A DSL for Verified Secure Multi-party Computations
inferred← citeshttps://doi.org/10.1007/978-3-030-78375-4_5openalex-snapshot
LLVM-Based Circuit Compilation for Practical Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-06749-0_4openalex-snapshot
Privacy by Encrypted Databases
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-319-24177-7_5openalex-snapshot
Privacy-Preserving Observation in Public Spaces
inferred← citeshttps://doi.org/10.1007/978-3-319-50011-9_32openalex-snapshot
Optimizing Secure Computation Programs with Private Conditionals
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_2openalex-snapshot
Background
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_3openalex-snapshot
Compiling ANSI-C Code into Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_4openalex-snapshot
Compiling Size-Optimized Circuits for Constant-Round MPC Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_5openalex-snapshot
Compiling Parallel Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_6openalex-snapshot
Compiling Depth-Optimized Circuits for Multi-Round MPC Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_7openalex-snapshot
Towards Scalable and Optimizing Compilation for MPC
inferred← citeshttps://doi.org/10.1007/978-3-642-54069-1_3openalex-snapshot
Privacy-Preserving Computation
inferred← citeshttps://doi.org/10.1007/s10703-017-0300-0openalex-snapshot
On compiling Boolean circuits optimized for secure multi-party computation
inferred← citeshttps://doi.org/10.1109/csf.2018.00017openalex-snapshot
Enforcing Ideal-World Leakage Bounds in Real-World Secret Sharing MPC Frameworks
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/mc.2011.224openalex-snapshot
Secure Collaborative Supply-Chain Management
inferred← citeshttps://doi.org/10.1109/qest.2011.33openalex-snapshot
Forecasting Run-Times of Secure Two-Party Computation
inferred← citeshttps://doi.org/10.1109/sp.2013.30openalex-snapshot
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
inferred← citeshttps://doi.org/10.1109/sp.2013.40openalex-snapshot
Circuit Structures for Improving Efficiency of Security and Privacy Tools
inferred← citeshttps://doi.org/10.1109/sp.2014.48openalex-snapshot
Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations
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.1109/wifs.2016.7823913openalex-snapshot
Scalable secure computation from ANSI-C
inferred← citeshttps://doi.org/10.1145/2046707.2046786openalex-snapshot
Automatically optimizing secure computation
inferred← citeshttps://doi.org/10.1145/2046707.2093509openalex-snapshot
Demo
inferred← citeshttps://doi.org/10.1145/2435349.2435356openalex-snapshot
Expression rewriting for optimizing secure computation
inferred← citeshttps://doi.org/10.1145/2484313.2484364openalex-snapshot
An information-flow type-system for mixed protocol secure computation
inferred← citeshttps://doi.org/10.1145/2508859.2516752openalex-snapshot
PICCO
inferred← citeshttps://doi.org/10.1145/2517872.2517873openalex-snapshot
Efficient secure computation optimization
inferred← citeshttps://doi.org/10.1145/2637113.2637119openalex-snapshot
Domain-Polymorphic Programming of Privacy-Preserving Applications
inferred← citeshttps://doi.org/10.1145/2810103.2813664openalex-snapshot
A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols
inferred← citeshttps://doi.org/10.1145/3292500.3330920openalex-snapshot
PrivPy
inferred← citeshttps://doi.org/10.1145/3448414openalex-snapshot
Clustering-based Efficient Privacy-preserving Face Recognition Scheme without Compromising Accuracy
inferred← citeshttps://doi.org/10.1145/3579856.3590340openalex-snapshot
FUSE – Flexible File Format and Intermediate Representation for Secure Multi-Party Computation
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.1504/ijact.2014.062738openalex-snapshot
Encrypted integer division and secure comparison
inferred← citeshttps://doi.org/10.17760/d20253796openalex-snapshot
Privacy preserving computations accelerated using FPGA overlays
inferred← citeshttps://doi.org/10.18130/v3cz8dopenalex-snapshot
Demystifying Secure Computation: Familiar Abstractions for Efficient Protocols
inferred← citeshttps://doi.org/10.3233/jcs-130464openalex-snapshot
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design
inferred← citeshttps://doi.org/10.48550/arxiv.1711.06467openalex-snapshot
WYS*: A DSL for Verified Secure Multi-party Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1801.10117openalex-snapshot
PrivPy: Enabling Scalable and General Privacy-Preserving Machine Learning
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.