Abstract | ||
---|---|---|
Intel Software Guard Extensions (SGX) allows users to perform secure computation on platforms that run untrusted software. To validate that the computation is correctly initialized and that it executes on trusted hardware, SGX supports attestation providers that can vouch for the user’s computation. Communication with these attestation providers is based on the Extended Privacy ID (EPID) protocol, which not only validates the computation but is also designed to maintain the user’s privacy. In particular, EPID is designed to ensure that the attestation provider is unable to identify the host on which the computation executes. In this work we investigate the security of the Intel implementation of the EPID protocol. We identify an implementation weakness that leaks information via a cache side channel. We show that a malicious attestation provider can use the leaked information to break the unlinkability guarantees of EPID. We analyze the leaked information using a lattice-based approach for solving the hidden number problem, which we adapt to the zero-knowledge proof in the EPID scheme, extending prior attacks on signature schemes. |
Year | Venue | Field |
---|---|---|
2018 | IACR Trans. Cryptogr. Hardw. Embed. Syst. | Secure multi-party computation,Hidden number problem,Cache,Computer science,Parallel computing,Computer network,Software,Side channel attack,Guard (information security),Zero-knowledge proof,Computation |
DocType | Volume | Issue |
Journal | 2018 | 2 |
Citations | PageRank | References |
1 | 0.34 | 0 |
Authors | ||
7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Fergus Dall | 1 | 1 | 0.34 |
Gabrielle De Micheli | 2 | 1 | 0.68 |
Thomas Eisenbarth | 3 | 840 | 61.33 |
Daniel Genkin | 4 | 579 | 31.18 |
Nadia Heninger | 5 | 885 | 50.78 |
Ahmad Moghimi | 6 | 3 | 0.70 |
Yuval Yarom | 7 | 775 | 35.54 |