Two-round maliciously-secure oblivious transfer with optimal rate
From MaRDI portal
Publication:6637571
DOI10.1007/978-3-031-58751-1_10MaRDI QIDQ6637571FDOQ6637571
Authors: Pedro Branco, Nico Döttling, Akshayaram Srinivasan 
Publication date: 13 November 2024
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient oblivious transfer protocols
- Title not available (Why is that?)
- A Framework for Efficient and Composable Oblivious Transfer
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Founding Cryptography on Oblivious Transfer – Efficiently
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Vector commitments and their applications
- Constrained pseudorandom functions and their applications
- Title not available (Why is that?)
- Constant ciphertext-rate non-committing encryption from standard assumptions
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Spooky Encryption and Its Applications
- Efficient non-interactive secure computation
- Functional signatures and pseudorandom functions
- Trapdoor hash functions and their applications
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Efficient pseudorandom correlation generators from ring-LPN
- Two-round oblivious transfer from CDH or LPN
- Compressible FHE with applications to PIR
- Efficient pseudorandom correlation generators: silent OT extension and more
- Batch-OT with optimal rate
- Amortizing rate-1 OT and applications to PIR and PSI
- A framework for statistically sender private OT with optimal rate
This page was built for publication: Two-round maliciously-secure oblivious transfer with optimal rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637571)
