On the public citation graph
Correlated pseudorandomness and the complexity of private computations
0 signed · 243 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/0-387-34799-2_2openalex-snapshot
Limits on the Provable Consequences of One-way Permutations
inferredcites →https://doi.org/10.1007/0-387-34805-0_47openalex-snapshot
Minimum Resource Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/0-387-34805-0_48openalex-snapshot
Non-Interactive Oblivious Transfer and Applications
inferredcites →https://doi.org/10.1007/0-387-34805-0_51openalex-snapshot
Multiparty Computation with Faulty Majority
inferredcites →https://doi.org/10.1007/3-540-38424-3_6openalex-snapshot
Fair Computation of General Functions in Presence of Immoral Majority
inferredcites →https://doi.org/10.1007/3-540-44750-4_8openalex-snapshot
Precomputing Oblivious Transfer
inferredcites →https://doi.org/10.1007/3-540-46877-3_4openalex-snapshot
Oblivious transfer protecting secrecy
inferredcites →https://doi.org/10.1007/3-540-47721-7_16openalex-snapshot
Zero-Knowledge Simulation of Boolean Circuits
inferredcites →https://doi.org/10.1007/3-540-47721-7_17openalex-snapshot
All-or-Nothing Disclosure of Secrets
inferredcites →https://doi.org/10.1007/3-540-48184-2_30openalex-snapshot
Equivalence Between Two Flavours of Oblivious Transfers
inferredcites →https://doi.org/10.1007/3-540-48285-7_36openalex-snapshot
Global, Unpredictable Bit Generation Without Broadcast
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_31openalex-snapshot
Fair Games Against an All-Powerful Adversary
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_19openalex-snapshot
A Randomized Protocol for Signing Contracts
inferredcites →https://doi.org/10.1007/978-3-319-31515-7_5openalex-snapshot
Founding Cryptography on Oblivious Transfer
inferredcites →https://doi.org/10.1090/dimacs/002/03openalex-snapshot
Perfect privacy for two-party protocols
inferredcites →https://doi.org/10.1090/dimacs/013/09openalex-snapshot
Fair games against an all-powerful adversary
inferredcites →https://doi.org/10.1109/18.265501openalex-snapshot
Privacy, additional information and communication
inferredcites →https://doi.org/10.1109/sfcs.1982.72openalex-snapshot
How to generate cryptographically strong sequences of pseudo random bits
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.1986.26openalex-snapshot
Information theoretic reductions among disclosure problems
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1109/sfcs.1989.63512openalex-snapshot
Privacy and communication complexity
inferredcites →https://doi.org/10.1109/sfcs.1989.63520openalex-snapshot
Multiparty computation with faulty majority
inferredcites →https://doi.org/10.1109/sfcs.1989.63521openalex-snapshot
Minimum resource zero knowledge proofs
inferredcites →https://doi.org/10.1109/sfcs.1994.365743openalex-snapshot
Reducibility and completeness in multi-party private computations
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/103418.103475openalex-snapshot
A general completeness theorem for two party games
inferredcites →https://doi.org/10.1145/3335741.3335754openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1145/62212.62215openalex-snapshot
Founding crytpography on oblivious transfer
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
inferredcites →https://doi.org/10.1145/73007.73012openalex-snapshot
Limits on the provable consequences of one-way permutations
inferredcites →https://doi.org/10.1145/73007.73013openalex-snapshot
A zero-one law for Boolean privacy
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4493701openalex-extracted
Multivariate Basic Function Secret Sharing from Oblivious Transfer
inferred← citeshttps://doi.org/10.1002/ett.3484openalex-snapshot
Privacy‐preserving collision detection of moving objects
inferred← citeshttps://doi.org/10.1002/int.22843openalex-snapshot
SWMQ: Secure wildcard pattern matching with query
inferred← citeshttps://doi.org/10.1007/11599548_19openalex-snapshot
An Improved Secure Two-Party Computation Protocol
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_37openalex-snapshot
Compressing Cryptographic Resources
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_14openalex-snapshot
Information-Theoretic Broadcast with Dishonest Majority for Long Messages
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_5openalex-snapshot
Two-Round MPC: Information-Theoretic and Black-Box
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_13openalex-snapshot
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_14openalex-snapshot
Universally Composable Secure Computation with Corrupted Tokens
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_16openalex-snapshot
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_21openalex-snapshot
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_23openalex-snapshot
Scalable Private Set Union from Symmetric-Key Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_22openalex-snapshot
On Perfectly Secure 2PC in the OT-Hybrid Model
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_13openalex-snapshot
SoK: A Consensus Taxonomy in the Blockchain Era
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_26openalex-snapshot
Cut-and-Choose for Garbled RAM
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_11openalex-snapshot
Blazing Fast OT for Three-Round UC OT Extension
inferred← citeshttps://doi.org/10.1007/978-3-030-64840-4_1openalex-snapshot
$$\mathtt {MOTIF}$$: (Almost) Free Branching in GMW
inferred← citeshttps://doi.org/10.1007/978-3-030-65411-5_20openalex-snapshot
Linear Complexity Private Set Intersection for Secure Two-Party Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-68869-1_3openalex-snapshot
Efficient, Actively Secure MPC with a Dishonest Majority: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-77886-6_18openalex-snapshot
Oblivious Transfer Is in MiniQCrypt
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_8openalex-snapshot
On the Round Complexity of Black-Box Secure MPC
inferred← citeshttps://doi.org/10.1007/978-3-030-90456-2_5openalex-snapshot
Amortizing Rate-1 OT and Applications to PIR and PSI
inferred← citeshttps://doi.org/10.1007/978-3-030-92078-4_10openalex-snapshot
Batching Base Oblivious Transfers
inferred← citeshttps://doi.org/10.1007/978-3-031-01807-7_2openalex-snapshot
A Consensus Taxonomy in the Blockchain Era
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_8openalex-snapshot
Round-Optimal Black-Box Protocol Compilers
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_23openalex-snapshot
SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model
inferred← citeshttps://doi.org/10.1007/978-3-031-17143-7_16openalex-snapshot
PEA: Practical Private Epistasis Analysis Using MPC
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_17openalex-snapshot
Fully-Secure MPC with Minimal Trust
inferred← citeshttps://doi.org/10.1007/978-3-031-22368-6_4openalex-snapshot
Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions
inferred← citeshttps://doi.org/10.1007/978-3-031-30545-0_10openalex-snapshot
Oblivious Transfer with Constant Computational Overhead
inferred← citeshttps://doi.org/10.1007/978-3-031-30617-4_7openalex-snapshot
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_5openalex-snapshot
Private Computations on Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_10openalex-snapshot
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_3openalex-snapshot
Lower-Bounds on Public-Key Operations in PIR
inferred← citeshttps://doi.org/10.1007/978-3-031-71070-4_9openalex-snapshot
$$\textsf{LR}$$-$$\textsf{OT}$$: Leakage-Resilient Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-031-91098-2_10openalex-snapshot
Leap: A Fast, Lattice-Based OPRF with Application to Private Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-031-95140-4_3openalex-snapshot
Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-95761-1_12openalex-snapshot
Delayed-Input Multi-party Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-07089-0_2openalex-snapshot
Secure Computation: A Primer
inferred← citeshttps://doi.org/10.1007/978-3-032-07089-0_3openalex-snapshot
Silent Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-12296-4_12openalex-snapshot
Threshold Signatures from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-25317-0_13openalex-snapshot
Updatable Private Set Intersection from Symmetric-Key Techniques
inferred← citeshttps://doi.org/10.1007/978-3-032-25317-0_16openalex-snapshot
Conditionally Input-Revealing 2PC and Fuzzy Password-Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-032-35418-1_17openalex-snapshot
Post-quantum Public-Key Pseudorandom Correlation Functions for OT
inferred← citeshttps://doi.org/10.1007/978-3-319-16295-9_20openalex-snapshot
Extending Oblivious Transfer Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-319-22174-8_3openalex-snapshot
The Simplest Protocol for Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-319-52153-4_22openalex-snapshot
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_9openalex-snapshot
Improved Private Set Intersection Against Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_8openalex-snapshot
Secure Arithmetic Computation with Constant Computational Overhead
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_2openalex-snapshot
Laconic Oblivious Transfer and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-71045-7_4openalex-snapshot
When It’s All Just Too Much: Outsourcing MPC-Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_19openalex-snapshot
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs
inferred← citeshttps://doi.org/10.1007/978-3-319-93387-0_16openalex-snapshot
New Protocols for Secure Equality Test and Comparison
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_10openalex-snapshot
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_12openalex-snapshot
Limits on the Power of Garbling Techniques for Public-Key Encryption
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-3-319-96881-0_11openalex-snapshot
On Distributional Collision Resistant Hashing
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_10openalex-snapshot
Reducing Communication Channels in MPC
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_18openalex-snapshot
Actively Secure OT-Extension from q-ary Linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_14openalex-snapshot
A Quantitative Approach to Reductions in Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-30144-8_26openalex-snapshot
Universally Composable Secure Mobile Agent Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_9openalex-snapshot
Extending Oblivious Transfers Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_5openalex-snapshot
Revisiting the Efficiency of Malicious Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_16openalex-snapshot
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_22openalex-snapshot
OT-Combiners via Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_32openalex-snapshot
Founding Cryptography on Oblivious Transfer – Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_15openalex-snapshot
Secure Two-Party Computation Is Practical
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_19openalex-snapshot
Founding Cryptography on Tamper-Proof Hardware Tokens
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_7openalex-snapshot
On Complete Primitives for Fairness
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_38openalex-snapshot
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_11openalex-snapshot
Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_34openalex-snapshot
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_23openalex-snapshot
Efficient Non-interactive Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_15openalex-snapshot
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_14openalex-snapshot
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_29openalex-snapshot
On the Feasibility of Extending Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-38980-1_21openalex-snapshot
Fast and Maliciously Secure Two-Party Computation Using the GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_49openalex-snapshot
Robust Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_4openalex-snapshot
Improved OT Extension for Transferring Short Secrets
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_23openalex-snapshot
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_14openalex-snapshot
On the Cryptographic Complexity of the Worst Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_37openalex-snapshot
On the Complexity of UC Commitments
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_26openalex-snapshot
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-662-47989-6_35openalex-snapshot
Actively Secure OT Extension with Optimal Overhead
inferred← citeshttps://doi.org/10.1007/978-3-662-49096-9_23openalex-snapshot
On the Complexity of Additively Homomorphic UC Commitments
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_13openalex-snapshot
Network Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_14openalex-snapshot
On the Power of Secure Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_19openalex-snapshot
Secure Multiparty RAM Computation in Constant Rounds
inferred← citeshttps://doi.org/10.1007/978-3-662-58387-6_12openalex-snapshot
SWiM: Secure Wildcard Pattern Matching from OT Extension
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_8openalex-snapshot
Laconic Cryptography with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-981-95-6203-9_4openalex-snapshot
Adaptive Batched K-out-of-N Oblivious Transfers Extension
inferred← citeshttps://doi.org/10.1007/978-981-96-0888-1_7openalex-snapshot
QuietOT: Lightweight Oblivious Transfer with a Public-Key Setup
inferred← citeshttps://doi.org/10.1007/978-981-96-0938-3_3openalex-snapshot
FOLEAGE: F 4 OLE-Based Multi-Party Computation for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-981-97-8013-6_6openalex-snapshot
1-Out-of-N Oblivious Transfer from MLWE
inferred← citeshttps://doi.org/10.1007/s00145-008-9036-8openalex-snapshot
A Proof of Security of Yao’s Protocol for Two-Party Computation
inferred← citeshttps://doi.org/10.1007/s00145-016-9236-6openalex-snapshot
More Efficient Oblivious Transfer Extensions
inferred← citeshttps://doi.org/10.1007/s00145-017-9269-5openalex-snapshot
On the Feasibility of Extending Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/s00145-019-09314-2openalex-snapshot
On the Power of Secure Two-Party Computation
inferred← citeshttps://doi.org/10.1007/s00145-021-09403-1openalex-snapshot
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/s00145-022-09432-4openalex-snapshot
Everlasting UC Commitments from Fully Malicious PUFs
inferred← citeshttps://doi.org/10.1007/s11227-026-08842-6openalex-snapshot
A novel FPGA-based mixed garbled circuit hardware accelerator (MixGCAcc)
inferred← citeshttps://doi.org/10.1007/s12095-025-00824-4openalex-snapshot
LR-OT: Leakage-resilient oblivious transfer
inferred← citeshttps://doi.org/10.1016/j.cjph.2026.08.005openalex-snapshot
Two-server quantum message oblivious transfer based on entanglement swapping
inferred← citeshttps://doi.org/10.1049/qtc2.12010openalex-snapshot
Quantum and classical oblivious transfer: A comparative analysis
inferred← citeshttps://doi.org/10.1051/sands/2021001openalex-snapshot
Concretely efficient secure multi-party computation protocols: survey and more
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf043openalex-snapshot
Secure multi-party shuffling with optimal communication
inferred← citeshttps://doi.org/10.1109/access.2020.3014165openalex-snapshot
Post-Quantum Universal Composable OT Based on Key Exchange
inferred← citeshttps://doi.org/10.1109/aina.2005.281openalex-snapshot
PICC: A Secure Mobile Agent Framework Based on Garbled Circuit
inferred← citeshttps://doi.org/10.1109/ainit59027.2023.10212517openalex-snapshot
A new ciphertext based OT protocol in cloud computing
inferred← citeshttps://doi.org/10.1109/blockchain.2019.00021openalex-snapshot
Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1109/dsc61021.2023.10354193openalex-snapshot
SepMM: A General Matrix Multiplication Optimization Approach for Privacy-Preserving Machine Learning
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254012openalex-snapshot
Efficient and Scalable Privacy-Preserving Similar Document Detection
inferred← citeshttps://doi.org/10.1109/icton71309.2026.11704884openalex-snapshot
Oblivious Transfer from Continuous-Variables QKD with Heterodyne Detection
inferred← citeshttps://doi.org/10.1109/incos.2015.77openalex-snapshot
Two-Dimensional Private Set Intersection in Big Data
inferred← citeshttps://doi.org/10.1109/iscas66217.2026.11561937openalex-snapshot
Bridging Trust and Efficiency: TEE-Accelerated Nonlinear Evaluation in Multiparty Computing
inferred← citeshttps://doi.org/10.1109/isit.2004.1365084openalex-snapshot
Rates for bit commitment and coin tossing from noisy correlation
inferred← citeshttps://doi.org/10.1109/isit.2010.5513743openalex-snapshot
Assisted common information
inferred← citeshttps://doi.org/10.1109/isit.2011.6034098openalex-snapshot
Assisted common information: Further results
inferred← citeshttps://doi.org/10.1109/itcc.2005.253openalex-snapshot
Securely utilizing external computing power
inferred← citeshttps://doi.org/10.1109/itw.2012.6404657openalex-snapshot
An information-theoretic protocol compiler
inferred← citeshttps://doi.org/10.1109/jiot.2025.3540465openalex-snapshot
A Scalable Private Data Alignment Scheme for Arbitrary Participants Using Oblivious PRF
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892119openalex-snapshot
Lower bounds on the efficiency of generic cryptographic constructions
inferred← citeshttps://doi.org/10.1109/sp.2018.00036openalex-snapshot
Secure Two-party Threshold ECDSA from ECDSA Assumptions
inferred← citeshttps://doi.org/10.1109/sp.2019.00024openalex-snapshot
Threshold ECDSA from ECDSA Assumptions: The Multiparty Case
inferred← citeshttps://doi.org/10.1109/sp40000.2020.00016openalex-snapshot
Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179345openalex-snapshot
FLUTE: Fast and Secure Lookup Table Evaluations
inferred← citeshttps://doi.org/10.1109/tdsc.2023.3322397openalex-snapshot
Maliciously Secure MPC From Semi-Honest 2PC in the Server-Aided Model
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3561472openalex-snapshot
Enabling Two-Party Secure Computation on Set Intersection
inferred← citeshttps://doi.org/10.1109/tifs.2017.2721360openalex-snapshot
Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity
inferred← citeshttps://doi.org/10.1109/tifs.2023.3282134openalex-snapshot
Low Communication Secure Computation From Semi-Trusted Hardware
inferred← citeshttps://doi.org/10.1109/tit.2008.921674openalex-snapshot
New Monotones and Lower Bounds in Unconditional Two-Party Computation
inferred← citeshttps://doi.org/10.1109/tit.2014.2314467openalex-snapshot
On the Efficiency of Classical and Quantum Secure Function Evaluation
inferred← citeshttps://doi.org/10.1109/tit.2014.2316011openalex-snapshot
Assisted Common Information With an Application to Secure Two-Party Sampling
inferred← citeshttps://doi.org/10.1109/tnse.2025.3566140openalex-snapshot
Secure Multi-Party Learning: Fundamentals, Frameworks, State of the Art, Trends, and Challenges
inferred← citeshttps://doi.org/10.1109/tvt.2020.3031063openalex-snapshot
Efficient and Secure Location-Based Services Scheme in VANET
inferred← citeshttps://doi.org/10.1109/wicom.2008.1147openalex-snapshot
Constructing a Pure-Software-Based Sanctuary for Mobile Agents
inferred← citeshttps://doi.org/10.1137/s0097539704383633openalex-snapshot
Oblivious Polynomial Evaluation
inferred← citeshttps://doi.org/10.1137/s0097539704443276openalex-snapshot
Bounds on the Efficiency of Generic Cryptographic Constructions
inferred← citeshttps://doi.org/10.1145/1374376.1374438openalex-snapshot
Cryptography with constant computational overhead
inferred← citeshttps://doi.org/10.1145/2508859.2516701openalex-snapshot
When private set intersection meets big data
inferred← citeshttps://doi.org/10.1145/2508859.2516738openalex-snapshot
More efficient oblivious transfer and extensions for faster secure computation
inferred← citeshttps://doi.org/10.1145/2810103.2813725openalex-snapshot
Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance
inferred← citeshttps://doi.org/10.1145/2976749.2978347openalex-snapshot
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
inferred← citeshttps://doi.org/10.1145/2976749.2978410openalex-snapshot
Garbling Gadgets for Boolean and Arithmetic Circuits
inferred← citeshttps://doi.org/10.1145/3154794openalex-snapshot
Scalable Private Set Intersection Based on OT Extension
inferred← citeshttps://doi.org/10.1145/3196494.3196541openalex-snapshot
Large-Scale Privacy-Preserving Statistical Computations for Distributed Genome-Wide Association Studies
inferred← citeshttps://doi.org/10.1145/3243734.3278521openalex-snapshot
Removing the Bottleneck for Practical 2PC
inferred← citeshttps://doi.org/10.1145/3321705.3329800openalex-snapshot
EPISODE: Efficient Privacy-PreservIng Similar Sequence Queries on Outsourced Genomic DatabasEs
inferred← citeshttps://doi.org/10.1145/3372297.3417274openalex-snapshot
CrypTFlow2: Practical 2-Party Secure Inference
inferred← citeshttps://doi.org/10.1145/3427228.3427248openalex-snapshot
Privacy-Preserving Production Process Parameter Exchange
inferred← citeshttps://doi.org/10.1145/3460120.3484778openalex-snapshot
Compact and Malicious Private Set Intersection for Small Sets
inferred← citeshttps://doi.org/10.1145/3460120.3484806openalex-snapshot
A PKI-based Framework for Establishing Efficient MPC Channels
inferred← citeshttps://doi.org/10.1145/3490354.3494400openalex-snapshot
Privacy-preserving portfolio pricing
inferred← citeshttps://doi.org/10.1145/3501817openalex-snapshot
Improving Availability of Vertical Federated Learning: Relaxing Inference on Non-overlapping Data
inferred← citeshttps://doi.org/10.1145/3503045openalex-snapshot
A Survey of Oblivious Transfer Protocol
inferred← citeshttps://doi.org/10.1145/3576915.3623131openalex-snapshot
Efficient Set Membership Encryption and Applications
inferred← citeshttps://doi.org/10.1145/3579375.3579389openalex-snapshot
Demystifying Threshold Elliptic Curve Digital Signature Algorithm for MultiParty Applications
inferred← citeshttps://doi.org/10.1145/3584684openalex-snapshot
Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
inferred← citeshttps://doi.org/10.1145/3584684.3597273openalex-snapshot
Invited Paper: Oblivious Transfer Protocol without Physical Transfer of Hardware Root-of-Trust
inferred← citeshttps://doi.org/10.1145/3719027.3765050openalex-snapshot
Correlation-Aware Secure Sorting and Permutation for Iterative Two-Party Graph Analysis
inferred← citeshttps://doi.org/10.1145/3719027.3765225openalex-snapshot
From OT to OLE with Subquadratic Communication
inferred← citeshttps://doi.org/10.1145/3729234openalex-snapshot
Privacy-Preserving Machine Learning Based on Cryptography: A Survey
inferred← citeshttps://doi.org/10.1145/3749096.3750036openalex-snapshot
Quantum-Enabled Secure Computation Medical Service
inferred← citeshttps://doi.org/10.1145/3806015openalex-snapshot
QualitEye: Public and Privacy-preserving Gaze Data Quality Verification ETRA001
inferred← citeshttps://doi.org/10.1145/3819804.3819810openalex-snapshot
SIGACT News Complexity Theory Column 129 Compressing Correlated Randomness
inferred← citeshttps://doi.org/10.1155/2020/8847487openalex-snapshot
An Efficient Outsourced Oblivious Transfer Extension Protocol and Its Applications
inferred← citeshttps://doi.org/10.1155/2023/6039034openalex-snapshot
Efficient Secure Computation from SM Series Cryptography
inferred← citeshttps://doi.org/10.1360/ssi-2022-0434openalex-snapshot
Privacy-preserving cryptographic algorithms and protocols: a survey on designs and applications
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.2013.053433openalex-snapshot
Secure computation of functionalities based on Hamming distance and its application to computing document similarity
inferred← citeshttps://doi.org/10.17760/d20560783openalex-snapshot
Three useful threshold cryptography problems with efficient solutions
inferred← citeshttps://doi.org/10.23919/cje.2025.00.148openalex-snapshot
Private Set Intersection: A Systematic Review
inferred← citeshttps://doi.org/10.26421/qic11.1-2-4openalex-snapshot
Non-local box complexity and secure function evaluation
inferred← citeshttps://doi.org/10.32657/10356/2491openalex-snapshot
Protocols for unconditionally computationally secure circuit computation obfuscation
inferred← citeshttps://doi.org/10.3390/cryptography10040043openalex-snapshot
Near-Bent Boolean Functions Are Insufficient for Correlation-Robust Hashing: A Spectral Obstruction and an Information-Theoretic Frontier
inferred← citeshttps://doi.org/10.3390/cryptography9040062openalex-snapshot
A Survey of Post-Quantum Oblivious Protocols
inferred← citeshttps://doi.org/10.3929/ethz-a-007339443openalex-snapshot
Classical and Quantum Secure Two-Party Computation
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2009.2322openalex-snapshot
Non-Local Box Complexity and Secure Function Evaluation
inferred← citeshttps://doi.org/10.46991/psyu:a/2016.50.1.040openalex-snapshot
EXTENDING WHITE-BOX CRYPTOGRAPHY BASED OBLIVIOUS TRANSFER PROTOCOL
inferred← citeshttps://doi.org/10.48550/arxiv.0903.2179openalex-snapshot
Non-Local Box Complexity and Secure Function Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.1002.1916openalex-snapshot
Assisted Common Information with Applications to Secure Two-Party Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1801.03239openalex-snapshot
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1902.07342openalex-snapshot
XONN: XNOR-based Oblivious Deep Neural Network Inference
inferred← citeshttps://doi.org/10.48550/arxiv.2011.14980openalex-snapshot
Oblivious Transfer is in MiniQCrypt
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03386openalex-snapshot
SoK: Training Machine Learning Models over Multiple Sources with Privacy Preservation
inferred← citeshttps://doi.org/10.48550/arxiv.2105.10794openalex-snapshot
AOT: Anonymization by Oblivious Transfer
showing the first 200 of 206 · page through all 206
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.