Pages that link to "Item:Q3655178"
From MaRDI portal
The following pages link to Secure Multiparty Computation Goes Live (Q3655178):
Displayed 39 items.
- Rate-limited secure function evaluation (Q329720) (← links)
- A distributed protocol for privacy preserving aggregation with non-permanent participants (Q497109) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP (Q2128571) (← links)
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation (Q2145391) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Private liquidity matching using MPC (Q2152152) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- A formal treatment of the role of verified compilers in secure computation (Q2669248) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- Efficient Computations over Encrypted Data Blocks (Q2946399) (← links)
- A Secure and Efficient Protocol for Electronic Treasury Auctions (Q2947111) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Efficient Secure Two-Party Exponentiation (Q3073692) (← links)
- Privacy Assurances in Multiple Data-Aggregation Transactions (Q3193250) (← links)
- When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- PoW-Based Distributed Cryptography with No Trusted Setup (Q3457075) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Rate-Limited Secure Function Evaluation: Definitions and Constructions (Q4916025) (← links)
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer (Q5025956) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- Practically Efficient Secure Single-Commodity Multi-market Auctions (Q5857771) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Kicking-the-bucket: fast privacy-preserving trading using buckets (Q6045188) (← links)
- TIDE: a novel approach to constructing timed-release encryption (Q6108784) (← links)
- Amortizing division and exponentiation (Q6134018) (← links)