Efficient Two-Party Secure Computation on Committed Inputs
From MaRDI portal
Recommendations
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Secure two-party computation via cut-and-choose oblivious transfer
- Secure two-party computation via cut-and-choose oblivious transfer
- Two-output secure computation with malicious adversaries
Cited in
(36)- Actively secure garbled circuits with constant communication overhead in the plain model
- Secure two-party computation via cut-and-choose oblivious transfer
- Constant-round maliciously secure two-party computation in the RAM model
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Security against covert adversaries: Efficient protocols for realistic adversaries
- On the power of secure two-party computation
- Two-party ECDSA from hash proof systems and efficient instantiations
- Secure linear system computation in the presence of malicious adversaries
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient set intersection with simulation-based security
- On the Power of Secure Two-Party Computation
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Secure two-party computation with low communication
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Efficient computations over encrypted data blocks
- Generalizing efficient multiparty computation
- Efficient non-interactive secure computation
- Constant-round maliciously secure two-party computation in the RAM model
- Cross and clean: amortized garbled circuits with constant overhead
- Rate-limited secure function evaluation
- Compact E-Cash and Simulatable VRFs Revisited
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Fair Traceable Multi-Group Signatures
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Rate-limited secure function evaluation: definitions and constructions
- MiniLEGO: efficient secure two-party computation from general assumptions
- Removing the strong RSA assumption from arguments over the integers
- Secure computation of the median (and other elements of specified ranks)
- Actively secure garbled circuits with constant communication overhead in the plain model
- Accountable storage
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Two-factor authentication can harden servers against offline password search
This page was built for publication: Efficient Two-Party Secure Computation on Committed Inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429385)
