Formal Abstractions for Attested Execution Secure Processors
From MaRDI portal
Publication:5738880
DOI10.1007/978-3-319-56620-7_10zbMath1411.94082OpenAlexW2613137163MaRDI QIDQ5738880
Rafael Pass, Elaine Shi, Florian Tramèr
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_10
Related Items (4)
CryptHOL: game-based proofs in higher-order logic ⋮ Fully-secure MPC with minimal trust ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Steel: composable hardware-based stateful and randomised functional encryption
Uses Software
Cites Work
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Universally composable symbolic security analysis
- ECDH Key-Extraction via Low-Bandwidth Electromagnetic Attacks on PCs
- Functional Encryption from (Small) Hardware Tokens
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Universally Composable Security with Global Setup
- One-Time Programs
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Programming Languages and Systems
- Complete Fairness in Secure Two-Party Computation
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Formal Abstractions for Attested Execution Secure Processors
- Theory of Cryptography
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Formal Abstractions for Attested Execution Secure Processors
