Pages that link to "Item:Q3003395"
From MaRDI portal
The following pages link to Efficient Non-interactive Secure Computation (Q3003395):
Displayed 43 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Abuse resistant law enforcement access systems (Q2056806) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Cryptography with One-Way Communication (Q3457066) (← links)
- Round-Optimal Black-Box Two-Party Computation (Q3457073) (← links)
- No-Key Protocol for Deniable Encryption (Q5117270) (← links)
- Deniability of Symmetric Encryption Based on Computational Indistinguishability from Probabilistic Ciphering (Q5117282) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Black-box reusable NISC with random oracles (Q6061353) (← links)
- Privacy-preserving blueprints (Q6061376) (← links)
- (Q6062142) (← links)
- Private polynomial commitments and applications to MPC (Q6067356) (← links)
- Round-optimal oblivious transfer and MPC from computational CSIDH (Q6070767) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Authenticated garbling from simple correlations (Q6111541) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Verifiable private information retrieval (Q6169548) (← links)
- Reusable secure computation in the plain model (Q6186599) (← links)