Pages that link to "Item:Q3650696"
From MaRDI portal
The following pages link to Secure Two-Party Computation Is Practical (Q3650696):
Displaying 41 items.
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← 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)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack (Q2195311) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks (Q2262421) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates (Q5854428) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- A new approach to garbled circuits (Q6535139) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- Breaking the size barrier: universal circuits meet lookup tables (Q6595671) (← links)
- Composable oblivious pseudo-random functions via garbled circuits (Q6619935) (← links)
- Efficient arithmetic in garbled circuits (Q6637536) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
- How to garble mixed circuits that combine Boolean and arithmetic computations (Q6637574) (← links)
