scientific article; zbMATH DE number 1256767
From MaRDI portal
Publication:4228503
Recommendations
Cited in
(48)- A proof of security of Yao's protocol for two-party computation
- Two-round MPC: information-theoretic and black-box
- Information-theoretic broadcast with dishonest majority for long messages
- All-but-many encryption
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Blazing fast OT for three-round UC OT extension
- Oblivious transfer is in MiniQCrypt
- On the round complexity of black-box secure MPC
- Everlasting UC commitments from fully malicious PUFs
- Round-optimal black-box protocol compilers
- Secure non-interactive reduction and spectral analysis of correlations
- Efficient, actively secure MPC with a dishonest majority: a survey
- On the power of secure two-party computation
- More efficient oblivious transfer extensions
- On the feasibility of extending oblivious transfer
- Adaptively code-correlation robustness functions and its applications to private set intersection
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Amortizing rate-1 OT and applications to PIR and PSI
- On the complexity of additively homomorphic UC commitments
- Network oblivious transfer
- On the Power of Secure Two-Party Computation
- The simplest protocol for oblivious transfer
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Secure multiparty RAM computation in constant rounds
- On complete primitives for fairness
- Founding Cryptography on Tamper-Proof Hardware Tokens
- OT-Combiners via Secure Computation
- Improved private set intersection against malicious adversaries
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Fully-secure MPC with minimal trust
- Oblivious transfer with constant computational overhead
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Batching base oblivious transfers
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
- Private computations on set intersection
- Lower-bounds on public-key operations in PIR
- Two-round maliciously-secure oblivious transfer with optimal rate
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- LR-OT: leakage-resilient oblivious transfer
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- QuietOT: lightweight oblivious transfer with a public-key setup
- Laconic cryptography with preprocessing
- Threshold signatures from one-way functions
- Updatable private set intersection from symmetric-key techniques
- Conditionally input-revealing 2PC and fuzzy password-authenticated key exchange
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228503)
