Two-round maliciously-secure oblivious transfer with optimal rate

DOI10.1007/978-3-031-58751-1_10MaRDI QIDQ6637571zbMATH OpenFDO

Authors Pedro Branco, Nico Döttling, Akshayaram Srinivasan

Publication date 13 November 2024

zbMATH Keywords

quadratic residuositylearning parity with noise

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Two-round oblivious transfer from CDH or LPN
• Batch-OT with optimal rate
• Round-optimal black-box secure computation from two-round malicious OT
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Batching base oblivious transfers

Cites work

• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 1256767 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• A framework for statistically sender private OT with optimal rate
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Amortizing rate-1 OT and applications to PIR and PSI
• Batch-OT with optimal rate
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Compressible FHE with applications to PIR
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Constrained pseudorandom functions and their applications
• Efficient non-interactive secure computation
• Efficient oblivious transfer protocols
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient pseudorandom correlation generators: silent OT extension and more
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• Founding Cryptography on Oblivious Transfer – Efficiently
• Functional signatures and pseudorandom functions
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On lattices, learning with errors, random linear codes, and cryptography
• Spooky Encryption and Its Applications
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Trapdoor hash functions and their applications
• Two-round multiparty secure computation from minimal assumptions
• Two-round oblivious transfer from CDH or LPN
• Vector commitments and their applications
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

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)