From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions

DOI10.1007/978-3-319-26059-4_2zbMath1388.94051OpenAlexW2402310410MaRDI QIDQ3467154

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

Publication date: 27 January 2016

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: http://eprint.iacr.org/2016/201

zbMATH Keywords

universal composabilitytamper-proof hardwareprotocol compilers

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Network protocols (68M12)

Related Items (3)

Pattern matching on encrypted streams ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Non-interactive secure computation from one-way functions

This page was built for publication: From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions