KIT | KIT-Bibliothek | Impressum | Datenschutz
Open Access Logo
§
Volltext
URN: urn:nbn:de:swb:90-351008

Complete Primitives for Information-Theoretically Secure Two-Party Computation

Kraschewski, Daniel

Abstract:
This thesis contributes two results to the research area of secure two-party computation. The first result is a full combinatorial characterization of all cryptogates that are powerful enough to be used for implementation of arbitrary secure computations. The second result shows that any secure two-party computation can be based on a single reusable tamper-proof hardware token, although the receiver does not trust the token issuer.


Zugehörige Institution(en) am KIT Institut für Kryptographie und Sicherheit (IKS)
Publikationstyp Hochschulschrift
Jahr 2013
Sprache Englisch
Identifikator KITopen ID: 1000035100
Abschlussart Dissertation
Fakultät Fakultät für Informatik (INFORMATIK)
Institut Institut für Kryptographie und Sicherheit (IKS)
Prüfungsdaten 25.01.2013
Referent/Betreuer Prof. J. Müller-Quade
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page