T3 combines SGX and a two-tree ORAM to give Bitcoin SPV clients privacy-preserving UTXO lookups with sub-millisecond to 2.4 ms reads in simulation, but its privacy argument has a multi-client linkability gap.
https://github.com/cinemast/libjson-rpc-cpp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CR 1years
2019 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains
T3 combines SGX and a two-tree ORAM to give Bitcoin SPV clients privacy-preserving UTXO lookups with sub-millisecond to 2.4 ms reads in simulation, but its privacy argument has a multi-client linkability gap.