Pages that link to "Item:Q2849382"
From MaRDI portal
The following pages link to Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries (Q2849382):
Displaying 23 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- On Garbling Schemes with and Without Privacy (Q2827734) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Generalizing Efficient Multiparty Computation (Q2947520) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← 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)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← 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)
- Improved Private Set Intersection Against Malicious Adversaries (Q5738879) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
