On the public citation graph
Circuit Structures for Improving Efficiency of Security and Privacy Tools
0 signed · 102 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/11745853_30openalex-snapshot
Efficiency Tradeoffs for Malicious Two-Party Computation
inferredcites →https://doi.org/10.1007/3-540-36577-x_40openalex-snapshot
Generalized Symbolic Execution for Model Checking and Testing
inferredcites →https://doi.org/10.1007/3-540-48910-x_23openalex-snapshot
Distributed Pseudo-random Functions and KDCs
inferredcites →https://doi.org/10.1007/978-1-4899-5327-8_25openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_1openalex-snapshot
Efficient Private Matching and Set Intersection
inferredcites →https://doi.org/10.1007/978-3-540-70583-3_40openalex-snapshot
Improved Garbled Circuit: Free XOR Gates and Applications
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_52openalex-snapshot
A Decision Procedure for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_28openalex-snapshot
Demand-Driven Compositional Symbolic Execution
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-04694-0_6openalex-snapshot
State Joining and Splitting for the Symbolic Execution of Binaries
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-10433-6_1openalex-snapshot
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_2openalex-snapshot
Fully Homomorphic Encryption over the Integers
inferredcites →https://doi.org/10.1007/978-3-642-19571-6_20openalex-snapshot
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
inferredcites →https://doi.org/10.1007/978-3-642-24372-1_34openalex-snapshot
Efficient Loop Navigation for Symbolic Execution
inferredcites →https://doi.org/10.1007/978-3-642-32009-5_40openalex-snapshot
A New Approach to Practical Active-Secure Two-Party Computation
inferredcites →https://doi.org/10.1007/978-3-642-32946-3_5openalex-snapshot
Deploying Secure Multi-Party Computation for Financial Data Analysis
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/bf01366920openalex-snapshot
The complexity of the realization of symmetrical functions by formulae
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.1109/compsac.2011.46openalex-snapshot
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
inferredcites →https://doi.org/10.1109/sfcs.1982.38openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1985.5openalex-snapshot
Amplification of probabilistic boolean formulas
inferredcites →https://doi.org/10.1109/sp.2012.43openalex-snapshot
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution
inferredcites →https://doi.org/10.1109/t-aiee.1938.5057767openalex-snapshot
A symbolic analysis of relay and switching circuits
inferredcites →https://doi.org/10.1145/1190215.1190226openalex-snapshot
Compositional dynamic test generation
inferredcites →https://doi.org/10.1145/1390630.1390635openalex-snapshot
Combining unit-level symbolic execution and system-level concrete execution for testing nasa software
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/1572272.1572299openalex-snapshot
Loop-extended symbolic execution on binary programs
inferredcites →https://doi.org/10.1145/1706299.1706307openalex-snapshot
Compositional may-must program analysis
inferredcites →https://doi.org/10.1145/1707801.1706307openalex-snapshot
Compositional may-must program analysis
inferredcites →https://doi.org/10.1145/2254064.2254088openalex-snapshot
Efficient state merging in symbolic execution
inferredcites →https://doi.org/10.1145/2382196.2382251openalex-snapshot
Secure two-party computation in sublinear (amortized) time
inferredcites →https://doi.org/10.1145/2382196.2382278openalex-snapshot
Secure two-party computations in ANSI C
inferredcites →https://doi.org/10.1145/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferredcites →https://doi.org/10.1145/3335741.3335755openalex-snapshot
How to play any mental game, or a completeness theorem for protocols with honest majority
inferredcites →https://doi.org/10.1145/503209.503230openalex-snapshot
Using symbolic execution for verifying safety-critical systems
inferredcites →https://doi.org/10.1145/503271.503230openalex-snapshot
Using symbolic execution for verifying safety-critical systems
inferredcites →https://doi.org/10.1145/512529.512558openalex-snapshot
Extended static checking for Java
inferredcites →https://doi.org/10.1145/543552.512558openalex-snapshot
Extended static checking for Java
inferredcites →https://doi.org/10.1145/772862.772865openalex-snapshot
Cryptographic techniques for privacy-preserving data mining
inferredcites →https://doi.org/10.18130/v3hj5copenalex-snapshot
Faster Secure Two-Party Computation Using Garbled Circuits
inferredcites →https://doi.org/10.35011/fmvtr.2011-1openalex-snapshot
Lingeling and Friends at the SAT Competition 2011
inferredcites →https://doi.org/10.48550/arxiv.1107.1398openalex-snapshot
Efficient Loop Navigation for Symbolic Execution
inferredcites →https://doi.org/10.5555/1855741.1855756openalex-snapshot
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
inferredcites →https://doi.org/10.5555/1873601.1873702openalex-snapshot
Randomized Shellsort: a simple oblivious sorting algorithm
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-71522-9_1552openalex-snapshot
Oblivious Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-91859-0_4openalex-snapshot
Efficient Permutation Protocol for MPC in the Head
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_1openalex-snapshot
EpiGRAM: Practical Garbled RAM
inferred← citeshttps://doi.org/10.1007/978-3-031-30545-0_16openalex-snapshot
NanoGRAM: Garbled RAM with $$\widetilde{O}(\log N)$$ Overhead
inferred← citeshttps://doi.org/10.1007/978-3-031-70890-9_12openalex-snapshot
Privacy-Preserving Regular Expression Matching Using TNFA
inferred← citeshttps://doi.org/10.1007/978-3-032-01913-4_8openalex-snapshot
PicoGRAM: Practical Garbled RAM from Decisional Diffie-Hellman
inferred← citeshttps://doi.org/10.1007/978-3-319-40253-6_11openalex-snapshot
Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database
inferred← citeshttps://doi.org/10.1007/978-3-319-45741-3_5openalex-snapshot
Compiling Low Depth Circuits for Practical Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-98989-1_21openalex-snapshot
Towards Practical RAM Based Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_1552-1openalex-snapshot
Oblivious Data Structures
inferred← citeshttps://doi.org/10.1016/j.cose.2016.11.012openalex-snapshot
Efficient outsourcing of secure k -nearest neighbour query over encrypted database
inferred← citeshttps://doi.org/10.1049/iet-com.2016.0782openalex-snapshot
Efficient privacy‐preserving dot‐product computation for mobile big data
inferred← citeshttps://doi.org/10.1109/csf.2016.26openalex-snapshot
A Certified Compiler for Verifiable Computing
inferred← citeshttps://doi.org/10.1109/edoc.2015.28openalex-snapshot
A Domain Specific Language for Secure Outsourcing of Computation to the Cloud
inferred← citeshttps://doi.org/10.1109/sp.2014.46openalex-snapshot
Automating Efficient RAM-Model Secure Computation
inferred← citeshttps://doi.org/10.1109/sp.2015.30openalex-snapshot
GraphSC: Parallel Secure Computation Made Easy
inferred← citeshttps://doi.org/10.1109/sp.2015.32openalex-snapshot
TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits
inferred← citeshttps://doi.org/10.1109/sp.2016.21openalex-snapshot
Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation
inferred← citeshttps://doi.org/10.1109/sp.2016.22openalex-snapshot
Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation
inferred← citeshttps://doi.org/10.1145/2517349openalex-snapshot
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
inferred← citeshttps://doi.org/10.1145/2517349.2522733openalex-snapshot
Verifying computations with state
inferred← citeshttps://doi.org/10.1145/2660267.2660291openalex-snapshot
Controlled Functional Encryption
inferred← citeshttps://doi.org/10.1145/2940343.2948717openalex-snapshot
Efficient privacy-preserving schemes for dot-product computation in mobile computing
inferred← citeshttps://doi.org/10.1145/2976749.2978373openalex-snapshot
Secure Stable Matching at Scale
inferred← citeshttps://doi.org/10.1145/3133956.3133984openalex-snapshot
Full Accounting for Verifiable Outsourcing
inferred← citeshttps://doi.org/10.1145/3154600openalex-snapshot
Implementing Support for Pointers to Private Data in a General-Purpose Secure Multi-Party Compiler
inferred← citeshttps://doi.org/10.1145/3319535.3354256openalex-snapshot
Securely Sampling Biased Coins with Applications to Differential Privacy
inferred← citeshttps://doi.org/10.1145/3474123.3486760openalex-snapshot
Private Hierarchical Clustering and Efficient Approximation
inferred← citeshttps://doi.org/10.1145/3563297openalex-snapshot
Tower: data structures in Quantum superposition
inferred← citeshttps://doi.org/10.1145/3576915.3616664openalex-snapshot
Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs)
inferred← citeshttps://doi.org/10.1145/3658644.3690352openalex-snapshot
Oblivious Single Access Machines - A New Model for Oblivious Computation
inferred← citeshttps://doi.org/10.1145/3839537openalex-snapshot
Validating Optimizing SMT Solvers via Cross-Theory Approximation
inferred← citeshttps://doi.org/10.1186/s13635-015-0025-9openalex-snapshot
Private function evaluation by local two-party computation
inferred← citeshttps://doi.org/10.14722/laser-ndss.2021.23056openalex-snapshot
On Building the Data-Oblivious Virtual Environment
inferred← citeshttps://doi.org/10.14722/ndss.2019.23061openalex-snapshot
Data Oblivious ISA Extensions for Side Channel-Resistant and High Performance Computing
inferred← citeshttps://doi.org/10.14722/ndss.2021.23056openalex-snapshot
DOVE: A Data-Oblivious Virtual Environment
inferred← citeshttps://doi.org/10.14778/3407790.3407814openalex-snapshot
Efficient oblivious database joins
inferred← citeshttps://doi.org/10.1515/popets-2015-0011openalex-snapshot
Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1561/3300000019openalex-snapshot
A Pragmatic Introduction to Secure Multi-Party Computation
inferred← citeshttps://doi.org/10.18130/v3cz8dopenalex-snapshot
Demystifying Secure Computation: Familiar Abstractions for Efficient Protocols
inferred← citeshttps://doi.org/10.2478/popets-2021-0068openalex-snapshot
SoK: Efficient Privacy-preserving Clustering
inferred← citeshttps://doi.org/10.3390/cryptography9040062openalex-snapshot
A Survey of Post-Quantum Oblivious Protocols
inferred← citeshttps://doi.org/10.3390/s24154826openalex-snapshot
Hierarchical Clustering via Single and Complete Linkage Using Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.48550/arxiv.1907.01727openalex-snapshot
Uncovering Information Flow Policy Violations in C Programs
inferred← citeshttps://doi.org/10.70675/02e964afz3bb1z45dbz99a4z982ee83ecc25openalex-snapshot
On the security of authentication protocols on the web
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.