OKVS原理介绍

OKVS（Oblivious Key-Value Store）是一种数据结构，用来隐藏数据中键值对的映射关系以及原始数据。换句话说，OKVS就像是一个魔术盒子，你可以给它一个键（ki），它会告诉你对应的值（vi），但是它会把生成这个值的具体键隐藏起来，即使你有很多值（vi），也很难逆推出原始的键（ki）是什么。

一.OKVS原理说明

数据存储方案：

OKVS

• 𝑆←𝐸𝑛𝑐𝑜𝑑𝑒(𝐼)：输入是 n 个 kv 对 𝐼={(𝑘1,𝑣1),...,(𝑘𝑛,𝑣𝑛)}，输出是编码 𝑆。
• 𝑣←𝐷𝑒𝑐𝑜𝑑𝑒(𝑆,𝑘)：输入是编码 𝑆 和一个 key 𝑘∈𝐾，输出是对应的 value 𝑣∈𝑉

OKVS 构建

其中，推导过程中可先忽略计算第5步，其主要作用是让v*随机化，这样便可以使输出P也是随机分布的。

性能说明，单条数据宽度为16byte（uint128），mac单核：

数据量	10KB	100KB	1MB	10MB	100MB	1GB
store大小	40KB	160KB	1.4MB	20.1MB	161MB	1.3GB
encode时间	0.1ms	1ms	7ms	1512ms	14s	1min51s
decode时间	0.1ms	1ms	32ms	417ms	2s	15s

参考文献

1. [RR22] Blazing Fast PSI from Improved OKVS and Subfield VOLE, CCS 2022：
2. okvs code reference GitHub - Visa-Research/volepsi: Efficient Private Set Intersection base on VOLE
3. Peter Rindal and Phillipp Schoppmann. VOLE-PSI: fast OPRF and circuit-psi from vector-ole. In Anne Canteaut and Fran¸cois-Xavier Standaert, editors, Advances in Cryptology - EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17-21, 2021, Proceedings, Part II, volume 12697 of Lecture Notes in Computer Science, pages 901– 930. Springer, 2021.
4. Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. Oblivious key-value stores and amplification for private set intersection. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II, volume 12826 of Lecture Notes in Computer Science, pages 395– 425. Springer, 2021.
5. Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. PSI from PaXoS: Fast, malicious private set intersection. In EUROCRYPT 2020, Part II, volume 12106 of LNCS, pages 739–767. Springer, Heidelberg, May 2020.
6. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," in IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 638-656, Feb 2001, doi: 10.1109/18.910579.
7. Couteau, G., Rindal, P., Raghuraman, S. (2021). Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In: Malkin, T., Peikert, C. (eds) Advances in Cryptology – CRYPTO 2021. CRYPTO 2021. Lecture Notes in Computer Science(), vol 12827. Springer, Cham.