Pages that link to "Item:Q3611777"
From MaRDI portal
The following pages link to LEGO for Two-Party Secure Computation (Q3611777):
Displayed 22 items.
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Abuse resistant law enforcement access systems (Q2056806) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- Mixed-technique multi-party computations composed of two-party computations (Q6109459) (← links)