Two-round oblivious transfer from CDH or LPN
From MaRDI portal
Recommendations
- Universally composable oblivious transfer based on a variant of LPN
- Two-round multiparty secure computation from minimal assumptions
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Founding Cryptography on Oblivious Transfer – Efficiently
Cites work
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- Advances in Cryptology - CRYPTO 2003
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Classical hardness of learning with errors
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient oblivious transfer protocols
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- How to simulate it -- a tutorial on the simulation proof technique
- New constructions of reusable designated-verifier NIZKs
- Smooth projective hashing and two-message oblivious transfer
- Theory of Cryptography
- Theory of Cryptography
- Two-message statistically sender-private OT from LWE
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Two-round multiparty secure computation from minimal assumptions
- Universally composable two-party and multi-party secure computation
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Cited in
(37)- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Weak zero-knowledge via the Goldreich-Levin theorem
- Universally composable oblivious transfer based on a variant of LPN
- Reusable two-round MPC from LPN
- Round-optimal black-box secure computation from two-round malicious OT
- Zero-knowledge proofs for committed symmetric Boolean functions
- Towards topology-hiding computation from oblivious transfer
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Minicrypt primitives with algebraic structure and applications
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer
- A new framework for quantum oblivious transfer
- Endemic oblivious transfer via random oracles, revisited
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Round-optimal black-box MPC in the plain model
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Composable oblivious pseudo-random functions via garbled circuits
- A note on non-interactive zero-knowledge from CDH
- Concurrently composable non-interactive secure computation
- Statistically sender-private OT from LPN and derandomization
- Two-round oblivious linear evaluation from learning with errors
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Two-round maliciously-secure oblivious transfer with optimal rate
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Amortizing rate-1 OT and applications to PIR and PSI
- Lossy cryptography from code-based assumptions
- Non-interactive zero-knowledge from LPN and MQ
- Obfuscation of pseudo-deterministic quantum circuits
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Two-message, oblivious evaluation of cryptographic functionalities
- Statistical security in two-party computation revisited
This page was built for publication: Two-round oblivious transfer from CDH or LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119032)
