Theory of Cryptography Conference

TCC 2010: Theory of Cryptography pp 327-342

Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens

  • Vladimir Kolesnikov
Conference paper

DOI: 10.1007/978-3-642-11799-2_20

Volume 5978 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kolesnikov V. (2010) Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens. In: Micciancio D. (eds) Theory of Cryptography. TCC 2010. Lecture Notes in Computer Science, vol 5978. Springer, Berlin, Heidelberg

Abstract

SFE requires expensive public key operations for each input bit of the function. This cost can be avoided by using tamper-proof hardware. However, all known efficient techniques require the hardware to have long-term secure storage and to be resistant to reset or duplication attacks. This is due to the intrinsic use of counters or erasures. Known techniques that use resettable tokens rely on expensive primitives, such as generic concurrent ZK, and are out of reach of practice.

We propose a truly efficient String Oblivious Transfer (OT) technique relying on resettable (actually, stateless) tamper-proof token. Our protocols require between 6 and 27 symmetric key operations, depending on the model. Our OT is secure against covert sender and malicious receiver, and is sequentially composable.

If the token is semi-honest (e.g. if it is provided by a trusted entity, but adversarily initialized), then our protocol is secure against malicious adversaries in concurrent execution setting.

Only one party is required to provide the token, which makes it appropriate for typical asymmetric client-server scenarios (banking, TV, etc.)

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Vladimir Kolesnikov
    • 1
  1. 1.Alcatel-Lucent Bell LaboratoriesMurray HillUSA