Information-theoretic two-server PIR requires (6 − o(1))log n bits of communication (Keewoo Lee) ia.cr/2026/1959
0 reposts1 like
Information-theoretic two-server PIR requires (6 − o(1))log n bits of communication (Keewoo Lee) ia.cr/2026/1959
0 reposts1 like
No replies yet.