2010 | OriginalPaper | Buchkapitel
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
verfasst von : Vladimir Kolesnikov
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.)