Cryptographic assumptions regarding tamper proof hardware tokens have gained increasing attention. Even if the tamper-proof hardware is issued by one of the parties, and hence not necessarily trusted by the other, many tasks become possible: Tamper proof hardware is sufficient for universally composable protocols, for information-theoretically secure protocols, and even allow to create software which can only be used once (One-Time-Programs). However, all known protocols employing tamper-proof hardware are either indirect, i.e., additional computational assumptions must be used to obtain general two party computations or a large number of devices must be used. In this work we present the first protocol realizing universally composable two-party computations (and even trusted One-Time-Programs) with information-theoretic security using only one single tamper-proof device issued by one of the mutually distrusting parties. © 2011 International Association for Cryptologic Research.
CITATION STYLE
Döttling, N., Kraschewski, D., & Müller-Quade, J. (2011). Unconditional and composable security using a single stateful tamper-proof hardware token. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6597 LNCS, pp. 164–181). Springer Verlag. https://doi.org/10.1007/978-3-642-19571-6_11
Mendeley helps you to discover research relevant for your work.