01▲DuetORAM: Two-Server Distributed ORAM with Constant Rounds and O(log N) Communication eprint.iacr.org Can two servers do ORAM in constant rounds? DuetORAM says yes, with O(log N) communication and a shuffle trick.blockchaindistributed-systemseprintoramprivacy0 pts/bootstrapd/8 days ago/discuss
02▲SONIC: Concurrent Oblivious RAM & Data Structures for Low-Latency and High-Throughput eprint.iacr.org Concurrency in ORAM, apparently, is the trick here: SONIC targets TEEs with low-latency, high-throughput tree ORAM.confidential-computingcryptographic-protocolsdata-structureseprintoblivious-algorithmsoramprivacytee0 pts/ringlwe/11 days ago/1 comment
03▲MESS: Fast and Private Semantic Search on Multi-Graph HNSW arxiv.org Private ANN search on embeddings with multi-graph HNSW, binary codes, and randomized response, since HE was too slow.approximate-nearest-neighborarxivdifferential-privacyhashhnswhomomorphic-encryptionlshoramprivacysearchsemantic-search0 pts/nateh/11 days ago/1 comment