Efficient and tight oblivious transfer from PKE with tight multi-user security
From MaRDI portal
Publication:2096634
DOI10.1007/978-3-031-09234-3_31OpenAlexW4285295017MaRDI QIDQ2096634
Pratyay Mukherjee, Daniel Masny, Saikrishna Badrinarayanan
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_31
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ``The simplest protocol for oblivious transfer revisited
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Hybrid encryption in a multi-user setting, revisited
- Practical and tightly-secure digital signatures and authenticated key exchange
- Tightly-secure authenticated key exchange, revisited
- PSI from PaXoS: fast, malicious private set intersection
- Secure two-party computation in a quantum world
- Password-authenticated public-key encryption
- Worst-case to average-case reductions for module lattices
- Another look at tightness. II: Practical issues in cryptography
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Two-pass authenticated key exchange with explicit authentication and tight security
- (Leveled) fully homomorphic encryption without bootstrapping
- Optimal Security Proofs for Signatures from Identification Schemes
- Tightly Secure Signatures and Public-Key Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- The Simplest Protocol for Oblivious Transfer
- Efficient Non-interactive Secure Computation
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Solving Simultaneous Modular Equations of Low Degree
- 1-out-of-n Signatures from a Variety of Keys
- Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
- Tightly-Secure Authenticated Key Exchange
- Advances in Cryptology - CRYPTO 2003
- Oblivious Transfer Based on the McEliece Assumptions
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Efficient and tight oblivious transfer from PKE with tight multi-user security
