Shared OT and its applications
From MaRDI portal
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Authenticated garbling from simple correlations
- Communication-efficient unconditional MPC with guaranteed output delivery
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
- Correlated pseudorandomness from expand-accumulate codes
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Fuzzy private set intersection with large hyperballs
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- Improved OT extension for transferring short secrets
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- New protocols for secure equality test and comparison
- Perfect MPC over layered graphs
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Secure equality and greater-than tests with sublinear online complexity
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- SpOT-light: lightweight private set intersection from sparse OT extension
- Strong Conditional Oblivious Transfer and Computing on Intervals
- Theory of Cryptography
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
This page was built for publication: Shared OT and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346667)
