On the public citation graph

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

0 signed · 195 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-38424-3_5openalex-snapshot
Security with Low Communication Overhead
inferredcites →https://doi.org/10.1007/3-540-39200-9_36openalex-snapshot
Round Efficiency of Multi-party Computation with a Dishonest Majority
inferredcites →https://doi.org/10.1007/3-540-44647-8_6openalex-snapshot
Robustness for Free in Unconditional Multi-party Computation
inferredcites →https://doi.org/10.1007/3-540-44647-8_7openalex-snapshot
Secure Distributed Linear Algebra in a Constant Number of Rounds
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-45022-x_43openalex-snapshot
One-Round Secure Computation and Secure Autonomous Mobile Agents
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-45708-9_12openalex-snapshot
On 2-Round Secure Multiparty Computation
inferredcites →https://doi.org/10.1007/3-540-48405-1_37openalex-snapshot
Compressing Cryptographic Resources
inferredcites →https://doi.org/10.1007/3-540-48910-x_22openalex-snapshot
Efficient Multiparty Computations Secure Against an Adaptive Adversary
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_1openalex-snapshot
Notions of Reducibility between Cryptographic Primitives
inferredcites →https://doi.org/10.1007/978-3-540-28628-8_21openalex-snapshot
Round-Optimal Secure Two-Party Computation
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_19openalex-snapshot
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1007/s00037-006-0211-8openalex-snapshot
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS
inferredcites →https://doi.org/10.1007/s00145-002-0143-7openalex-snapshot
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1109/ccc.2005.9openalex-snapshot
Computationally Private Randomizing Polynomials and Their Applications
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
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.1109/sfcs.2003.1238214openalex-snapshot
Bounded-concurrent secure two-party computation in a constant number of rounds
inferredcites →https://doi.org/10.1137/s0097539790187084openalex-snapshot
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100287openalex-snapshot
The round complexity of secure protocols
inferredcites →https://doi.org/10.1145/1007352.1007393openalex-snapshot
Bounded-concurrent secure multi-party computation with a dishonest majority
inferredcites →https://doi.org/10.1145/195058.195408openalex-snapshot
A minimal model for secure computation (extended abstract)
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/336992.337028openalex-snapshot
Privacy preserving auctions and mechanism design
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/380752.380853openalex-snapshot
The round complexity of verifiable secret sharing and secure multicast
inferredcites →https://doi.org/10.1145/380752.380855openalex-snapshot
Communication preserving protocols for secure function evaluation
inferredcites →https://doi.org/10.1145/571825.571859openalex-snapshot
Sequential composition of protocols without simultaneous termination
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62215openalex-snapshot
Founding crytpography on oblivious transfer
inferredcites →https://doi.org/10.1145/72981.72995openalex-snapshot
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
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.73014openalex-snapshot
Verifiable secret sharing and multiparty protocols with honest majority

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.1684openalex-snapshot
A cryptographicallyt‐private auction system
inferred← citeshttps://doi.org/10.1007/11681878_28openalex-snapshot
Threshold and Proactive Pseudo-Random Permutations
inferred← citeshttps://doi.org/10.1007/11818175_27openalex-snapshot
On Expected Constant-Round Protocols for Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/11818175_29openalex-snapshot
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/11818175_30openalex-snapshot
Scalable Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/11889663_24openalex-snapshot
Efficient Correlated Action Selection
inferred← citeshttps://doi.org/10.1007/978-0-387-09699-5_2openalex-snapshot
Practical Privacy-Preserving Benchmarking
inferred← citeshttps://doi.org/10.1007/978-3-030-01446-9_5openalex-snapshot
Secure Outsourcing of Cryptographic Circuits Manufacturing
inferred← citeshttps://doi.org/10.1007/978-3-030-03332-3_3openalex-snapshot
Secure Computation with Low Communication from Cross-Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_6openalex-snapshot
Perfect Secure Computation in Two Rounds
inferred← citeshttps://doi.org/10.1007/978-3-030-03810-6_10openalex-snapshot
Best Possible Information-Theoretic MPC
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_18openalex-snapshot
Degree 2 is Complete for the Round-Complexity of Malicious MPC
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_19openalex-snapshot
Two Round Information-Theoretic MPC with Malicious Security
inferred← citeshttps://doi.org/10.1007/978-3-030-21568-2_26openalex-snapshot
Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-030-25283-0_16openalex-snapshot
Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_2openalex-snapshot
Adaptively Secure MPC with Sublinear Communication Complexity
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-45388-6_8openalex-snapshot
Topology-Hiding Computation for Networks with Unknown Delays
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_20openalex-snapshot
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_23openalex-snapshot
Black-Box Transformations from Passive to Covert Security with Public Verifiability
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_24openalex-snapshot
MPC with Friends and Foes
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_25openalex-snapshot
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_18openalex-snapshot
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More
inferred← citeshttps://doi.org/10.1007/978-3-030-84242-0_17openalex-snapshot
One-Way Functions Imply Secure Computation in a Quantum World
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_1openalex-snapshot
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_4openalex-snapshot
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
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-84259-8_2openalex-snapshot
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_21openalex-snapshot
Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_24openalex-snapshot
On Actively-Secure Elementary MPC Reductions
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_14openalex-snapshot
Secure Multiparty Computation with Free Branching
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_13openalex-snapshot
Two-Round MPC Without Round Collapsing Revisited – Towards Efficient Malicious Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_18openalex-snapshot
Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round
inferred← citeshttps://doi.org/10.1007/978-3-031-15985-5_16openalex-snapshot
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_4openalex-snapshot
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security
inferred← citeshttps://doi.org/10.1007/978-3-031-25538-0_43openalex-snapshot
PREFHE, PREFHE-AES and PREFHE-SGX: Secure Multiparty Computation Protocols from Fully Homomorphic Encryption and Proxy ReEncryption with AES and Intel SGX
inferred← citeshttps://doi.org/10.1007/978-3-031-29371-9_10openalex-snapshot
Reputation at Stake! A Trust Layer over Decentralized Ledger for Multiparty Computation and Reputation-Fair Lottery
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_6openalex-snapshot
Succinct Arguments for RAM Programs via Projection Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-38557-5_12openalex-snapshot
Perfect MPC over Layered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49099-6_14openalex-snapshot
Security and Privacy in Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-54776-8_13openalex-snapshot
Time Is Money, Friend! Timing Side-Channel Attack Against Garbled Circuit Constructions
inferred← citeshttps://doi.org/10.1007/978-3-031-56235-8_4openalex-snapshot
Distributed Protocols for Oblivious Transfer and Polynomial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-031-78023-3_8openalex-snapshot
Secure Computation with Parallel Calls to 2-Ary Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_16openalex-snapshot
$$\omega (1/\lambda)$$-Rate Boolean Garbling Scheme from Generic Groups
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_2openalex-snapshot
Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_3openalex-snapshot
Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_1openalex-snapshot
Honest Majority Constant-Round MPC with Linear Communication from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-25324-8_11openalex-snapshot
Information-Theoretic Network-Agnostic MPC with Polynomial Communication
inferred← citeshttps://doi.org/10.1007/978-3-032-25324-8_19openalex-snapshot
Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph
inferred← citeshttps://doi.org/10.1007/978-3-032-25324-8_5openalex-snapshot
Non-interactive Secure Computation with Constant Communication Overhead
inferred← citeshttps://doi.org/10.1007/978-3-032-35418-1_18openalex-snapshot
Breaking the $$\varOmega (|C|\kappa )$$ Barrier on Garbled Circuit Size in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-032-35418-1_3openalex-snapshot
Achieving Guaranteed Output Delivery MPC with Constant Rounds and Linear Communication in Minicrypt
inferred← citeshttps://doi.org/10.1007/978-3-319-11212-1_8openalex-snapshot
What’s the Gist? Privacy-Preserving Aggregation of User Profiles
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_27openalex-snapshot
Secure $$(M+1)$$ st-Price Auction with Automatic Tie-Break
inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_7openalex-snapshot
On Adaptively Secure Multiparty Computation with a Short CRS
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_14openalex-snapshot
The Price of Low Communication in Secure Multi-party Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-66402-6_8openalex-snapshot
Server-Aided Secure Computation with Off-line Parties
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_25openalex-snapshot
Round Optimal Concurrent MPC via Strong Simulation
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_18openalex-snapshot
Equational Security Proofs of Oblivious Transfer Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_9openalex-snapshot
Must the Communication Graph of MPC Protocols be an Expander?
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_14openalex-snapshot
Round-Optimal Secure Multiparty Computation with Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_17openalex-snapshot
Round-Optimal Secure Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_7openalex-snapshot
Perfect NIZK with Adaptive Soundness
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_44openalex-snapshot
t-Private and Secure Auctions
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_18openalex-snapshot
Round-Efficient Secure Computation in Point-to-Point Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_6openalex-snapshot
Efficient Two-Party Secure Computation on Committed Inputs
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_16openalex-snapshot
Privacy-Preserving Set Union
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_20openalex-snapshot
Secure Multiparty Computation of DNF
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_17openalex-snapshot
Efficient Two Party and Multi Party Computation Against Covert Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_14openalex-snapshot
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
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-00457-5_24openalex-snapshot
Black-Box Constructions of Two-Party Protocols from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_16openalex-snapshot
Secure Multi-party Computation Minimizing Online Rounds
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_31openalex-snapshot
Secure Multiparty Computation with Minimal Interaction
inferred← citeshttps://doi.org/10.1007/978-3-642-24861-0_18openalex-snapshot
Round-Efficient Oblivious Database Manipulation
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_9openalex-snapshot
On Efficient Zero-Knowledge PCPs
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_29openalex-snapshot
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
inferred← citeshttps://doi.org/10.1007/978-3-642-30428-6_9openalex-snapshot
A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_11openalex-snapshot
Functional Encryption with Bounded Collusions via Multi-party Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_27openalex-snapshot
Black-Box Constructions of Composable Protocols without Set-Up
inferred← citeshttps://doi.org/10.1007/978-3-642-37682-5_15openalex-snapshot
Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_11openalex-snapshot
Fair and Efficient Secure Multiparty Computation with Reputation Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_29openalex-snapshot
Efficient Three-Party Computation from Cut-and-Choose
inferred← citeshttps://doi.org/10.1007/978-3-662-45472-5_13openalex-snapshot
Scaling Private Set Intersection to Billion-Element Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_7openalex-snapshot
A Little Honesty Goes a Long Way
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_17openalex-snapshot
Round-Optimal Black-Box Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_4openalex-snapshot
Constant-Round MPC with Fairness and Guarantee of Output Delivery
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_9openalex-snapshot
Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_16openalex-snapshot
The Exact Round Complexity of Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_9openalex-snapshot
Probabilistic Termination and Composability of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_14openalex-snapshot
Binary AMD Circuits from Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_2openalex-snapshot
Fast Pseudorandom Functions Based on Expander Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_33openalex-snapshot
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_1openalex-snapshot
Randomized Agreement, Verifiable Secret Sharing and Multi-party Computation in Granular Synchrony
inferred← citeshttps://doi.org/10.1007/978-981-96-0938-3_6openalex-snapshot
Dishonest Majority Constant-Round MPC with Linear Communication from DDH
inferred← citeshttps://doi.org/10.1007/978-981-97-9053-1_14openalex-snapshot
Efficient Large-Scale Multi-party Computation Based on Garbled Circuit
inferred← citeshttps://doi.org/10.1007/s00145-015-9222-4openalex-snapshot
Efficient One-Sided Adaptively Secure Computation
inferred← citeshttps://doi.org/10.1007/s00145-018-9279-yopenalex-snapshot
Probabilistic Termination and Composability of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/s00145-019-09322-2openalex-snapshot
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
inferred← citeshttps://doi.org/10.1007/s00145-021-09377-0openalex-snapshot
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/s00145-021-09382-3openalex-snapshot
Round-Optimal Secure Multi-party Computation
inferred← citeshttps://doi.org/10.1007/s00145-023-09446-6openalex-snapshot
Adaptively Secure MPC with Sublinear Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00145-023-09460-8openalex-snapshot
Must the Communication Graph of MPC Protocols be an Expander?
inferred← citeshttps://doi.org/10.1007/s00145-023-09465-3openalex-snapshot
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model
inferred← citeshttps://doi.org/10.1007/s00145-023-09484-0openalex-snapshot
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
inferred← citeshttps://doi.org/10.1007/s11390-008-9174-3openalex-snapshot
t-Private and t-Secure Auctions
inferred← citeshttps://doi.org/10.1007/s42979-022-01073-5openalex-snapshot
Communicationless Evaluation of Quadratic Functions over Secret Shared Dynamic Database
inferred← citeshttps://doi.org/10.1016/j.csi.2021.103552openalex-snapshot
Generic server-aided secure multi-party computation in cloud computing
inferred← citeshttps://doi.org/10.1016/j.csi.2021.103570openalex-snapshot
Mixed-protocol multi-party computation framework towards complex computation tasks with malicious security
inferred← citeshttps://doi.org/10.1016/j.jisa.2023.103650openalex-snapshot
More efficient constant-round secure multi-party computation based on optimized Tiny-OT and half-gate
inferred← citeshttps://doi.org/10.1081/e-ecst2-120054076openalex-snapshot
Privacy Preserving Cryptographic Protocols
inferred← citeshttps://doi.org/10.1109/eurosp57164.2023.00049openalex-snapshot
Recurring Contingent Service Payment
inferred← citeshttps://doi.org/10.1109/focs.2010.87openalex-snapshot
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00121openalex-snapshot
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency
inferred← citeshttps://doi.org/10.1109/iisa.2018.8633690openalex-snapshot
Using Sharemind as a Tool to Develop an Internet Voting System with Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1109/isit.2014.6875092openalex-snapshot
Single-use ot combiners with near-optimal resilience
inferred← citeshttps://doi.org/10.1109/nss.2009.41openalex-snapshot
A Cryptographically t-Private Auction System
inferred← citeshttps://doi.org/10.1109/pst.2008.12openalex-snapshot
Private and Cheating-Free Outsourcing of Algebraic Computations
inferred← citeshttps://doi.org/10.1109/sp.2006.14openalex-snapshot
Deterring voluntary trace disclosure in re-encryption mix networks
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00106openalex-snapshot
Scalable Mixed-Mode MPC
inferred← citeshttps://doi.org/10.1109/tc.2016.2543220openalex-snapshot
A Privacy-Preserving Outsourced Functional Computation Framework Across Large-Scale Multiple Encrypted Domains
inferred← citeshttps://doi.org/10.1109/tencon.2007.4429049openalex-snapshot
Anonymity enabled secure multi-party computation for indian BPO
inferred← citeshttps://doi.org/10.1109/tencon.2009.5395855openalex-snapshot
Malicious computation prevention protocol for secure multi-party computation
inferred← citeshttps://doi.org/10.1109/tifs.2013.2288131openalex-snapshot
Efficiently Outsourcing Multiparty Computation Under Multiple Keys
inferred← citeshttps://doi.org/10.1111/j.1937-5956.2010.01188.xopenalex-snapshot
Outsourcing Manufacturing: Secure Price‐Masking Mechanisms for Purchasing Component Parts
inferred← citeshttps://doi.org/10.1137/080725398openalex-snapshot
Zero-Knowledge Proofs from Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1137/100790537openalex-snapshot
Black-Box Constructions of Protocols for Secure Computation
inferred← citeshttps://doi.org/10.1145/1132516.1132531openalex-snapshot
Black-box constructions for secure computation
inferred← citeshttps://doi.org/10.1145/1250790.1250794openalex-snapshot
Zero-knowledge from secure multiparty computation
inferred← citeshttps://doi.org/10.1145/1455770.1455804openalex-snapshot
FairplayMP
inferred← citeshttps://doi.org/10.1145/1698750.1698758openalex-snapshot
Deterring voluntary trace disclosure in re-encryption mix-networks
inferred← citeshttps://doi.org/10.1145/1741866.1741884openalex-snapshot
Privacy-preserving computation of benchmarks on item-level data using RFID
inferred← citeshttps://doi.org/10.1145/1755688.1755695openalex-snapshot
Securely outsourcing linear algebra computations
inferred← citeshttps://doi.org/10.1145/2382196.2382280openalex-snapshot
Salus
inferred← citeshttps://doi.org/10.1145/2611462.2611494openalex-snapshot
Fast and unconditionally secure anonymous channel
inferred← citeshttps://doi.org/10.1145/2810103.2813624openalex-snapshot
Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data
inferred← citeshttps://doi.org/10.1145/2810103.2813705openalex-snapshot
Fast and Secure Three-party Computation
inferred← citeshttps://doi.org/10.1145/3133956.3134100openalex-snapshot
Efficient, Constant-Round and Actively Secure MPC
inferred← citeshttps://doi.org/10.1145/3288599.3288600openalex-snapshot
Round efficient computationally secure multi-party computation revisited
inferred← citeshttps://doi.org/10.1145/3319535.3345657openalex-snapshot
Fast Actively Secure Five-Party Computation with Security Beyond Abort
inferred← citeshttps://doi.org/10.1145/3319535.3354238openalex-snapshot
HoneyBadgerMPC and AsynchroMix
inferred← citeshttps://doi.org/10.1145/3319535.3354258openalex-snapshot
LevioSA
inferred← citeshttps://doi.org/10.1145/3465084.3467897openalex-snapshot
Breaking the O(√ n)-Bit Barrier
inferred← citeshttps://doi.org/10.1145/3576915.3623132openalex-snapshot
Scalable Multiparty Garbling
inferred← citeshttps://doi.org/10.1145/3658644.3690207openalex-snapshot
Secure Multiparty Computation with Lazy Sharing
inferred← citeshttps://doi.org/10.1201/9781420052183.ch3openalex-snapshot
Privacy-Preserving Cryptographic Protocols
inferred← citeshttps://doi.org/10.1201/9781584888215-c14openalex-snapshot
Secure Multiparty Computation
inferred← citeshttps://doi.org/10.12794/metadc68060openalex-snapshot
Exploring Privacy in Location-based Services Using Cryptographic Protocols
inferred← citeshttps://doi.org/10.1515/popets-2016-0006openalex-snapshot
Efficient Server-Aided 2PC for Mobile Phones
inferred← citeshttps://doi.org/10.18130/v39j78openalex-snapshot
New Designs of Encryption Schemes
inferred← citeshttps://doi.org/10.3929/ethz-a-005781789openalex-snapshot
Efficient multi-party computation with information-theoretic security
inferred← citeshttps://doi.org/10.5120/ijca2015907146openalex-snapshot
A Survey of Cryptographic and Non-cryptographic Techniques for Privacy Preservation
inferred← citeshttps://doi.org/10.5445/ir/1000019077openalex-snapshot
A Privacy-Preserving Benchmarking Platform
inferred← citeshttps://doi.org/10.6100/ir637269openalex-snapshot
Secure and fair two-party computation
inferred← citeshttps://doi.org/10.62056/ab3wa0l5vtopenalex-snapshot
A New Paradigm for Server-Aided MPC
inferred← citeshttps://doi.org/10.7916/d8k64r2wopenalex-snapshot
On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks
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.