General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
From MaRDI portal
Publication:5261634
DOI10.1007/978-3-662-46494-6_14zbMath1354.94027OpenAlexW2186869461MaRDI QIDQ5261634
Daniel Kraschewski, Nico Döttling, Tobias Nilges, Jörn Müller-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
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
This page was built for publication: General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
