Pages that link to "Item:Q5920168"

The following pages link to Low cost constant round MPC combining BMR and oblivious transfer (Q5920168):

Displaying 34 items.

• Oblivious TLS via multi-party computation (Q826241) (← links)
• An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
• On multiparty garbling of arithmetic circuits (Q1710662) (← links)
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
• What security can we achieve within 4 rounds? (Q2010586) (← links)
• High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
• Blazing fast OT for three-round UC OT extension (Q2055696) (← links)
• Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
• Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
• TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
• Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
• Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
• The price of active security in cryptographic protocols (Q2119012) (← links)
• Broadcast-optimal two-round MPC (Q2119034) (← links)
• Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
• Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
• The cost of IEEE arithmetic in secure computation (Q2146109) (← links)
• Practical witness-key-agreement for blockchain-based dark pools financial trading (Q2147265) (← links)
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
• Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
• On actively-secure elementary MPC reductions (Q2695655) (← links)
• Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
• Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
• Round-optimal secure multi-party computation (Q5918346) (← links)
• Multiparty generation of an RSA modulus (Q5918574) (← links)
• Multiparty generation of an RSA modulus (Q5970801) (← links)
• CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
• Le Mans: dynamic and fluid MPC for dishonest majority (Q6097268) (← links)
• Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
• \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s (Q6164395) (← links)
• A new approach to efficient and secure fixed-point computation (Q6547972) (← links)
• The price of active security in cryptographic protocols (Q6595846) (← links)
• Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
• Privacy-preserving Dijkstra (Q6653041) (← links)