A framework for universally composable oblivious transfer from one-round key-exchange

DOI10.1007/978-3-030-35199-1_5MaRDI QIDQ2177655zbMATH OpenOpenAlexFDO

Authors Pedro Branco, Jintai Ding, Manuel Goulão, Paulo Mateus

Publication date 6 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-35199-1_5

zbMATH Keywords

key exchangeoblivious transferuniversal composability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Framework for Efficient and Composable Oblivious Transfer
• Topics in Cryptology – CT-RSA 2006
• Theory of Cryptography
• Round Optimal Universally Composable Oblivious Transfer Protocols
• Universally composable oblivious transfer from lossy encryption and the MceEliece assumptions
• Universally Composable Adaptive Oblivious Transfer
• Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

Cited in

(4)

• Efficient and tight oblivious transfer from PKE with tight multi-user security
• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
• Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
• Simple two-message OT in the explicit isogeny model

This page was built for publication: A framework for universally composable oblivious transfer from one-round key-exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177655)