Round Optimal Universally Composable Oblivious Transfer Protocols
From MaRDI portal
Recommendations
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Oblivious transfer from trapdoor permutations in minimal rounds
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- A Framework for Efficient and Composable Oblivious Transfer
- Efficient adaptive oblivious transfer without q-type assumptions in UC framework
Cites work
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- Advances in Cryptology - CRYPTO 2003
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Computationally secure oblivious transfer
- Efficient Fully-Simulatable Oblivious Transfer
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Simulatable Adaptive Oblivious Transfer
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Universally composable two-party and multi-party secure computation
Cited in
(6)- Low cost constant round MPC combining BMR and oblivious transfer
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
- Theory of Cryptography
- A framework for universally composable oblivious transfer from one-round key-exchange
- Oblivious transfer from trapdoor permutations in minimal rounds
This page was built for publication: Round Optimal Universally Composable Oblivious Transfer Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505480)
