Secure computation using leaky tokens
From MaRDI portal
Publication:5167802
DOI10.1007/978-3-662-43948-7_75zbMATH Open1410.68131OpenAlexW2293084895MaRDI QIDQ5167802FDOQ5167802
Authors: Manoj Prabhakaran, Amit Sahai, Akshay Wadia
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_75
Recommendations
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Lower Bounds in the Hardware Token Model
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Weakening the isolation assumption of tamper-proof hardware tokens
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (6)
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Weakening the isolation assumption of tamper-proof hardware tokens
- Secure physical computation using disposable circuits
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Secure set intersection with untrusted hardware tokens
- How to construct a leakage-resilient (stateless) trusted party
This page was built for publication: Secure computation using leaky tokens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167802)