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

DOI10.1007/978-3-642-54242-8_27zbMath1326.94081OpenAlexW2911809826MaRDI QIDQ5746357

Arkady Yerukhimovich, Seung Geol Choi, Dominique Schröder, Hong-Sheng Zhou, Jonathan N. 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

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

Related Items (7)

Pattern matching on encrypted streams ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Fully-secure MPC with minimal trust ⋮ Non-interactive secure computation from one-way functions ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Topology-hiding computation for networks with unknown delays

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