Formal abstractions for attested execution secure processors
From MaRDI portal
Publication:5738880
Recommendations
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Steel: composable hardware-based stateful and randomised functional encryption
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- An Architecture for Provably Secure Computation
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete fairness in secure two-party computation
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- ECDH key-extraction via low-bandwidth electromagnetic attacks on PCs
- Formal abstractions for attested execution secure processors
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Functional encryption from (small) hardware tokens
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- scientific article; zbMATH DE number 2242582 (Why is no real title available?)
- One-Time Programs
- Programming Languages and Systems
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Theory of Cryptography
- Theory of Cryptography
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally Composable Security with Global Setup
- Universally composable symbolic security analysis
Cited in
(9)- Steel: composable hardware-based stateful and randomised functional encryption
- CryptHOL: game-based proofs in higher-order logic
- Dynamic measurement and protected execution: model and analysis
- Formal abstractions for attested execution secure processors
- Fully-secure MPC with minimal trust
- Fair delivery of decentralised randomness beacon
- Synchronizable fair exchange
- Practically efficient private set intersection from trusted hardware with side-channels
- Universal composable transaction serialization with order fairness
This page was built for publication: Formal abstractions for attested execution secure processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738880)