Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token

DOI10.1007/978-3-642-19571-6_11zbMath1295.94055OpenAlexW1552897331MaRDI QIDQ3000538

Daniel Kraschewski, Nico Döttling, Jörn Müller-Quade

Publication date: 19 May 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_11

zbMATH Keywords

Universal ComposabilityInformation-Theoretical SecuritySecure Two-Party ComputationTamper-Proof Hardware

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Pattern matching on encrypted streams ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Unclonable polymers and their cryptographic applications ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Non-interactive secure computation from one-way functions ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model

This page was built for publication: Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token