(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

DOI10.1007/978-3-642-54242-8_27MaRDI QIDQ5746357zbMATH OpenOpenAlexFDO

Authors Seung Geol Choi, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou, Jonathan Katz

Publication date 18 February 2014

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54242-8_27

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2006
• Round Optimal Universally Composable Oblivious Transfer Protocols
• A framework for universally composable oblivious transfer from one-round key-exchange
• Universally Composable Adaptive Oblivious Transfer
• A Framework for Efficient and Composable Oblivious Transfer
• Universally composable oblivious transfer from lossy encryption and the MceEliece assumptions
• Universally composable oblivious transfer based on a variant of LPN

Cited in

(12)

• Pattern matching on encrypted streams
• Non-interactive secure computation from one-way functions
• Topology-hiding computation for networks with unknown delays
• UC-secure multiparty computation from one-way functions using stateless tokens
• A framework for universally composable oblivious transfer from one-round key-exchange
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• Weakening the isolation assumption of tamper-proof hardware tokens
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• Constant round adaptively secure protocols in the tamper-proof hardware model
• Theory of Cryptography
• Fully-secure MPC with minimal trust

This page was built for publication: (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

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