2008
DOI: 10.1109/hpca.2008.4658636
|View full text |Cite
|
Sign up to set email alerts
|

Single-level integrity and confidentiality protection for distributed shared memory multiprocessors

Abstract: Multiprocessor computer systems are currently widely used in commercial settings to run critical applications. These applications often operate on sensitive data such as customer records, credit card numbers, and financial data. As a result, these systems are the frequent targets of attacks because of the potentially significant gain an attacker could obtain from stealing or tampering with such data. This provides strong motivation to protect the confidentiality and integrity of data in commercial multiprocess… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(11 citation statements)
references
References 17 publications
0
11
0
Order By: Relevance
“…There have been many designs for encrypting physical memory to counter physical attacks (e.g., [34,35,36,21,37,18,38,39,40,41]). Representation examples are: 1) protecting data privacy by performing decryption in parallel to memory access [21]; 2) protecting data privacy and integrity in distributed shared memory multi-processors systems [39] by adapting the Galois/Counter Mode of operation with the counter-mode encryption [38], or by using the address independent counter-mode encryption and Merkle tree built on top of the counters [42]; 3) preventing secret leakage against intrusive memory attack by integrating secret sharing and coding based schemes [40]; 4) a hybrid hardware-software approach to full system security named SecureME [41]. However, it is not clear at all how these solutions can be retrofitted to solve the problem we aim to tackle.…”
Section: Related Workmentioning
confidence: 99%
“…There have been many designs for encrypting physical memory to counter physical attacks (e.g., [34,35,36,21,37,18,38,39,40,41]). Representation examples are: 1) protecting data privacy by performing decryption in parallel to memory access [21]; 2) protecting data privacy and integrity in distributed shared memory multi-processors systems [39] by adapting the Galois/Counter Mode of operation with the counter-mode encryption [38], or by using the address independent counter-mode encryption and Merkle tree built on top of the counters [42]; 3) preventing secret leakage against intrusive memory attack by integrating secret sharing and coding based schemes [40]; 4) a hybrid hardware-software approach to full system security named SecureME [41]. However, it is not clear at all how these solutions can be retrofitted to solve the problem we aim to tackle.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed architectures are thus applicable to unmodified legacy code. Furthermore, we detect tampered instructions and data before they can cause harm to the system, unlike the architectures proposed in [27,[43][44]. Our approach offers high cryptographic strength with low performance and energy overhead.…”
Section: Related Workmentioning
confidence: 99%
“…This overhead may be artificially low as they use "non-precise integrity verification," which allows potentially harmful instructions to execute and retire before they are verified. Their research has also been extended into the multiprocessor domain [44].…”
Section: Related Workmentioning
confidence: 99%
“…A less conservative approach allows the memory controller to return unverified data to the core, assuming that the window of vulnerability between data use and verification is too short for attackers to exploit [6], [25], [27], [38], [47]. Shi et.al., close this vulnerability by stalling stores until all outstanding verifications complete ("authen-then-write") [32].…”
Section: Performance: Unsafe Speculationmentioning
confidence: 99%
“…It ensures confidentiality with encryption and ensures integrity with Merkle trees [4], [6], [10], [38]. Security adds overheads, motivating performance optimizations that cache metadata and speculate around safeguards [11], [26], [27], [33], [34], [37], [49]. We survey recent progress to motivate our solution, PoisonIvy, which builds atop best practices to address remaining performance challenges.…”
Section: Introductionmentioning
confidence: 99%