Round-optimal secure two-party computation
From MaRDI portal
Recommendations
Cited in
(77)- Parallel coin-tossing and constant-round secure two-party computation
- Perfect secure computation in two rounds
- Round optimal black-box ``commit-and-prove
- Pattern matching on encrypted streams
- On secure two-party computation in three rounds
- Round-optimal secure two-party computation from trapdoor permutations
- Non-interactive secure computation from one-way functions
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
- What security can we achieve within 4 rounds?
- Delayed-input cryptographic protocols
- Towards accountability in CRS generation
- Stacked garbling. Garbled circuit proportional to longest execution path
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Efficient two-party exponentiation from quotient transfer
- Succinct non-interactive secure computation
- On the round complexity of black-box secure MPC
- Round-optimal and communication-efficient multiparty computation
- Round-optimal black-box protocol compilers
- Round-optimal multi-party computation with identifiable abort
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- On the power of secure two-party computation
- On black-box complexity of universally composable security in the CRS model
- Rate-1 quantum fully homomorphic encryption
- Two-round maliciously secure computation with super-polynomial simulation
- Oblivious transfer from trapdoor permutations in minimal rounds
- One-round secure computation and secure autonomous mobile agents. (Extended abstract)
- Improved OR-composition of sigma-protocols
- On Adaptively Secure Multiparty Computation with a Short CRS
- The feasibility of outsourced database search in the plain model
- What Security Can We Achieve Within 4 Rounds?
- On the Power of Secure Two-Party Computation
- Spooky Encryption and Its Applications
- Concurrent non-malleable commitments (and more) in 3 rounds
- Two-message, oblivious evaluation of cryptographic functionalities
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- More efficient constant-round multi-party computation from BMR and SHE
- Round-optimal black-box two-party computation
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- Universally-Composable Two-Party Computation in Two Rounds
- A note on constant-round zero-knowledge proofs of knowledge
- On 2-round secure multiparty computation
- Parallel coin-tossing and constant-round secure two-party computation
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Efficient one-sided adaptively secure computation
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- On the exact round complexity of self-composable two-party computation
- The Exact Round Complexity of Secure Computation
- Round-optimal secure multi-party computation
- On the exact round complexity of secure three-party computation
- \(k\)-critical graphs in \(P_5\)-free graphs
- Round-optimal secure multi-party computation
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- Adaptively secure MPC with sublinear communication complexity
- Bounded Collusion ABE for TMs from IBE
- Maliciously-secure MrNISC in the plain model
- Statistical security in two-party computation revisited
- Round-optimal black-box secure computation from two-round malicious OT
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness
- Best of both worlds. Revisiting the spymasters double agent problem
- Round-optimal black-box MPC in the plain model
- Reusable secure computation in the plain model
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Broadcast-optimal four-round MPC in the plain model
- Universal composable transaction serialization with order fairness
- Improved black-box constructions of composable secure computation
- Black-box constant-round secure 2PC with succinct communication
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Towards accountability in CRS generation
- The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
- Broadcast-optimal secure computation from black-box oblivious transfer
- Quantum state secure transmission in network communications
- Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH
- Constant-round adaptive zero-knowledge proofs for NP
- Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms
This page was built for publication: Round-optimal secure two-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311543)
