Formal Abstractions for Attested Execution Secure Processors (Q5738880): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2613137163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconciling two views of cryptography (The computational soundness of formal encryption) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Security with Global Setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable symbolic security analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Encryption from (Small) Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECDH Key-Extraction via Low-Bandwidth Electromagnetic Attacks on PCs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Fairness in Multi-party Computation without an Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Fairness in Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Tamper-Proof Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Multi-party Computation Using Tamper-Proof Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Abstractions for Attested Execution Secure Processors / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:43, 13 July 2024

scientific article; zbMATH DE number 6729668
Language Label Description Also known as
English
Formal Abstractions for Attested Execution Secure Processors
scientific article; zbMATH DE number 6729668

    Statements

    Formal Abstractions for Attested Execution Secure Processors (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references

    Identifiers