Pages that link to "Item:Q5429385"
From MaRDI portal
The following pages link to Efficient Two-Party Secure Computation on Committed Inputs (Q5429385):
Displaying 23 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Rate-limited secure function evaluation (Q329720) (← 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)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Secure linear system computation in the presence of malicious adversaries (Q2335946) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Generalizing Efficient Multiparty Computation (Q2947520) (← 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)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Fair Traceable Multi-Group Signatures (Q3603011) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Rate-Limited Secure Function Evaluation: Definitions and Constructions (Q4916025) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
