Provably-Secure Remote Memory Attestation for Heap Overflow Protection

DOI10.1007/978-3-319-44618-9_5zbMath1400.94123OpenAlexW2508820885MaRDI QIDQ2827711

Bogdan Warinschi, Richard J. Lipton, Alexandra Boldyreva, Tae Soo Kim

Publication date: 21 October 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research-information.bris.ac.uk/ws/files/81493541/Bogdan_Warinschi_Provably_Secure_Remote_Memory_Attestation_for_Heap_Overflow_Protection.pdf

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Provably-Secure Remote Memory Attestation for Heap Overflow Protection

Uses Software

• SWATT
• Flicker
• AddressSanitizer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Provably-Secure Remote Memory Attestation for Heap Overflow Protection
• Public Key Encryption against Related Key Attacks
• Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks
• Secure Message Authentication Against Related-Key Attack
• The random oracle methodology, revisited
• Cryptography Secure against Related-Key Attacks and Tampering
• Provably Secure Virus Detection: Using The Observer Effect Against Malware.
• RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures

This page was built for publication: Provably-Secure Remote Memory Attestation for Heap Overflow Protection