General Statistically Secure Computation with Bounded-Resettable Hardware Tokens

DOI10.1007/978-3-662-46494-6_14zbMATH Open1354.94027OpenAlexW2186869461MaRDI QIDQ5261634FDOQ5261634

Daniel Kraschewski, Nico Döttling, Tobias Nilges, Joern Mueller-Quade

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_14

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (5)

• Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
• Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
• Everlasting UC commitments from fully malicious PUFs
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Lower Bounds in the Hardware Token Model

   Recommendations

• Resettably Secure Computation 👍 👎
• Universally composable secure computation with corrupted tokens 👍 👎
• Almost-Everywhere Secure Computation 👍 👎
• Resettable Statistical Zero Knowledge 👍 👎
• Lower Bounds in the Hardware Token Model 👍 👎
• Efficient perfectly secure computation with optimal resilience 👍 👎
• Efficient perfectly secure computation with optimal resilience 👍 👎
• Secure Computation Using Leaky Tokens 👍 👎
• Statistical security in two-party computation revisited 👍 👎

This page was built for publication: General Statistically Secure Computation with Bounded-Resettable Hardware Tokens

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261634)