An Architecture for Provably Secure Computation

DOI10.1007/11682462_10MaRDI QIDQ3525747zbMATH OpenOpenAlexFDO

Authors Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_10

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A tamper and leakage resilient von Neumann architecture
• A verified information-flow architecture
• Trusted computing with addition machines. I
• scientific article; zbMATH DE number 176562
• scientific article; zbMATH DE number 1304184

Cited in

(8)

• scientific article; zbMATH DE number 1950354 (Why is no real title available?)
• Efficient constructions for almost-everywhere secure computation
• Trusted computing with addition machines. II
• Provably-secure remote memory attestation for heap overflow protection
• An algebraic framework for silent preprocessing with trustless setup and active security
• A protocol for provably secure authentication of a tiny entity to a high performance computing one
• Formal abstractions for attested execution secure processors
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

This page was built for publication: An Architecture for Provably Secure Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525747)