2007
DOI: 10.1109/micro.2007.4408255
|View full text |Cite
|
Sign up to set email alerts
|

Using Address Independent Seed Encryption and Bonsai Merkle Trees to Make Secure Processors OS- and Performance-Friendly

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
82
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 40 publications
(82 citation statements)
references
References 0 publications
0
82
0
Order By: Relevance
“…Secure processor has been extensively studied during the last decade [18], [19], [20], [41], [42], [43], [44], [45], [46], [47], [22], [21]. For example, Bastion [22] and SecureME [21] also leverage secure processor to protect against hardware attacks.…”
Section: Secure Processormentioning
confidence: 99%
See 2 more Smart Citations
“…Secure processor has been extensively studied during the last decade [18], [19], [20], [41], [42], [43], [44], [45], [46], [47], [22], [21]. For example, Bastion [22] and SecureME [21] also leverage secure processor to protect against hardware attacks.…”
Section: Secure Processormentioning
confidence: 99%
“…In contrast, Kite retains OS and application transparency by leveraging the VM-Shim mechanism. For secure processor designs, we adapt two major techniques: AISE (Address Independent Seed Encryption) based data encryption and Bonsai Merkle Tree (BMT) [45] to secure off-chip data. Briefly, AISE and BMT are used to ensure privacy and integrity accordingly.…”
Section: Secure Processormentioning
confidence: 99%
See 1 more Smart Citation
“…If an attacker has physical access to hardware (e.g., a malicious cloud operator), we have already seen that data encryption is an important first step. Even with data encryption, the attacker can still engage in replay attacks [29] (returning the old encrypted value of data to disrupt the application) or gather sensitive information [13], [17] by snooping on the address trace (note that addresses are still sent out in plain text). To address these vulnerabilities, researchers have constructed solutions, Merkle trees [12] and oblivious RAM [40], respectively, that organize memory blocks into a logical tree structure and require fetching all the blocks in a given subtree.…”
Section: Securitymentioning
confidence: 99%
“…Additional optimizations have been proposed to further reduce the overheads. Using GMAC in place of a hash function lowers the overheads to around 5% even with encryption [33] and Bonsai Merkle Trees report the overhead of 2% using small trees [27].…”
Section: Cached Hash Treesmentioning
confidence: 99%