General Statistically Secure Computation with Bounded-Resettable Hardware Tokens

DOI10.1007/978-3-662-46494-6_14MaRDI QIDQ5261634zbMATHOpenAlexFDO

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

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)

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

Cited in

(12)

• Secure computation using leaky tokens
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Universally composable secure computation with corrupted tokens
• Unconditional UC-secure computation with (stronger-malicious) PUFs
• Lower Bounds in the Hardware Token Model
• Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens
• Interactive locking, zero-knowledge PCPs, and unconditional cryptography
• Everlasting UC commitments from fully malicious PUFs
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• Constant round adaptively secure protocols in the tamper-proof hardware model
• From stateful hardware to resettable hardware using symmetric assumptions
• Truly efficient string oblivious transfer using resettable tamper-proof tokens

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)