Two-round oblivious transfer from CDH or LPN
From MaRDI portal
Publication:2119032
DOI10.1007/978-3-030-45724-2_26zbMath1492.94091OpenAlexW2965686579MaRDI QIDQ2119032
Daniel Wichs, Mohammad Hajiabadi, Sanjam Garg, Nico Döttling, Daniel Masny
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_26
Related Items
Reusable Two-Round MPC from LPN, Two-Round Oblivious Linear Evaluation from Learning with Errors, Round-optimal oblivious transfer and MPC from computational CSIDH, Statistical security in two-party computation revisited, Round-optimal black-box secure computation from two-round malicious OT, Concurrently composable non-interactive secure computation, Knowledge encryption and its applications to simulatable protocols with low round-complexity, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Statistically sender-private OT from LPN and derandomization, A new framework for quantum oblivious transfer, Round-optimal black-box MPC in the plain model, A note on non-interactive zero-knowledge from CDH, Efficient and round-optimal oblivious transfer and commitment with adaptive security, Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers, Amortizing rate-1 OT and applications to PIR and PSI, Minicrypt primitives with algebraic structure and applications, Compact, efficient and UC-secure isogeny-based oblivious transfer, Breaking the circuit size barrier for secure computation under quasi-polynomial LPN, Zero-knowledge proofs for committed symmetric Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Two-message statistically sender-private OT from LWE
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Distinguisher-dependent simulation in two rounds and its applications
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- New constructions of reusable designated-verifier NIZKs
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Universally composable two-party and multi-party secure computation
- A Framework for Efficient and Composable Oblivious Transfer
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- Advances in Cryptology - CRYPTO 2003
- Classical hardness of learning with errors
- Theory of Cryptography
- Theory of Cryptography
