Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
From MaRDI portal
Recommendations
- The simplest protocol for oblivious transfer
- Efficient adaptive oblivious transfer without q-type assumptions in UC framework
- More efficient oblivious transfer extensions with security for malicious adversaries
- More efficient oblivious transfer extensions
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
Cites work
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- A Framework for Efficient and Composable Oblivious Transfer
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- Blazing fast OT for three-round UC OT extension
- Efficient oblivious transfer protocols
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Physically uncloneable functions in the universal composition framework
- The simplest protocol for oblivious transfer
- The wonderful world of global random oracles
- Theory of Cryptography
- Two-round oblivious transfer from CDH or LPN
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally composable oblivious transfer based on a variant of LPN
- Universally composable oblivious transfer from lossy encryption and the MceEliece assumptions
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
- Weakening the isolation assumption of tamper-proof hardware tokens
Cited in
(9)- Generic construction of UC-secure oblivious transfer
- Extending white-box cryptography based oblivious transfer protocol
- The simplest protocol for oblivious transfer
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Round Optimal Universally Composable Oblivious Transfer Protocols
- Efficient adaptive oblivious transfer without q-type assumptions in UC framework
- Topics in Cryptology – CT-RSA 2006
- Endemic oblivious transfer via random oracles, revisited
This page was built for publication: Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488035)