A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
IACR Cryptology ePrint Archive
We propose a new garbled RAM construction called NanoGRAM, which achieves an amortized cost of O(λ•(W log N +log 3 N )) bits per memory access, where λ is the security parameter, W is the block size, and N is the total number of blocks, and O(•) hides poly log log factors. For sufficiently large blocks where W = Ω(log 2 N ), our scheme achieves O(λ • W log N ) cost per memory access, where the dependence on N is optimal (barring poly log log factors), in terms of the evaluator's runtime. Ourdblp:journals/iacr/ParkLS22 fatcat:nm7oxobdjzhepjp3bnifv34lv4