Universally Composable Oblivious Transfer with Low Communication
Source abstract
Abstract
In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communication is built. This protocol obtained full simulation security based on the modulo learning with rounding (Mod-LWR) assumption. It can achieve universally composable security in the random oracle machine (ROM) model by combining random OT based on the key exchange protocol with the authentication encryption algorithm. It can be proven to resist static adversary attacks by simulating all corruption cases. Based on computer simulation and detailed mathematical derivation, this protocol was practicable and had better efficiency and lower communication.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Privacy-Preserving Technologies in Data · Complexity and Algorithms in Graphs
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Digital Rights Management Research Center, Beijing Institute of Graphic Communication, Beijing 102600, China
Funding
National Natural Science Foundation of China · Beijing Municipal Education Commission Scientific Research Project · Beijing Municipal Education Commission Scientific Research Project Funding · Beijing Institute of Graphic Communication Doctoral Funding Project · BIGC · Intramural Discipline Construction Project of Beijing Institute of Graphic Communication · Key Educational Reform Project of Beijing Institute of Graphic Communication
References (27)
Show source-provided references
1. Cheetah: Lean and fast secure two-party deep neural network inference
2. Yang, J., Wang, T., Li, N., Cheng, X., and Su, S. (2020). Answering Multi-Dimensional Range Queries under Local Differential Privacy. arXiv.10.14778/3430915.3430927 ↗
3. Hong, C., Katz, J., Kolesnikov, V., Lu, W.-J., and Wang, X. (2019, January 19–23). Covert Security with Public Verifiability: Faster, Leaner, and Simpler. Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany.10.1007/978-3-030-17659-4_4 ↗
4. Using color QR codes for QR code secret sharing10.1007/s11042-022-12423-z ↗
5. An Efficient Fully Homomorphic Encryption Scheme for Private Information Retrieval in the Cloud10.1142/S0218001420550083 ↗
6. Rackoff, C., and Simon, D.R. (1992). Advances in Cryptology—CRYPTO ’91, Springer.
7. Chailloux, A., and Kerenidis, I. (2011, January 22–25). Optimal Bounds for Quantum Bit Commitment. Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Washington, DC, USA.10.1109/FOCS.2011.42 ↗
8. Pinkas, B., Schneider, T., Zohner, M., and Segev, G. (2012, January 10–12). Phasing: Private Set Intersection using Permutation-based Hashing. Proceedings of the 24th USENIX Security Symposium, Austin, TX, USA.
9. Secure Multi-party Computation of Spatial Relationship and Its Application
10. Rabin, M.O. (2005). How to Exchange Secrets with Oblivious Transfer. IACR Cryptol. ePrint Arch., 187. Available online: https://www.semanticscholar.org/paper/How-To-Exchange-Secrets-with-Oblivious-Transfer-Rabin/772cdcc8a67cc878b39409230cbf2488a1117e62.
11. A Randomized Protocol for Signing Contracts10.1145/3812.3818 ↗
12. Brassard, G., Crepeau, C., and Robert, J.-M. (1987). Advances in Cryptology—CRYPTO’ 86, Springer.
13. Tzeng, W.-G. (2002). Public Key Cryptography, Springer.
14. Naor, M., and Pinkas, B. (2022, August 05). Efficient Oblivious Transfer Protocols. Available online: https://xueshu.baidu.com/usercenter/paper/show?paperid=be727901097ac71cc01239a43ca4e160.
15. Damgård, I., Nielsen, J.B., and Orlandi, C. (2009). Information Security and Cryptology—ICISC 2008, Springer.
16. Lindell, A.Y. (2008). Topics in Cryptology—CT-RSA 2008, Springer.
17. Canetti, R. (2022, August 05). Universally Composable Security: A New Paradigm for Cryptographic Protocols. Cryptology ePrint Archive. Available online: https://eprint.iacr.org/2000/067.10.1109/SFCS.2001.959888 ↗
18. Peikert, C., Vaikuntanathan, V., and Waters, B. (2008). Advances in Cryptology—CRYPTO 2008, Springer.
19. Lai, Y.-F., Galbraith, S.D., and de Saint Guilhem, C.D. (2021). Advances in Cryptology—EUROCRYPT 2021, Springer.
20. Branco, P., Ding, J., Goulão, M., and Mateus, P. (2019). Cryptography and Coding, Springer.
21. The Simplest Protocol for Oblivious Transfer10.1007/978-3-319-22174-8_3 ↗
22. Universally composable oblivious transfer from ideal lattice10.1007/s11704-018-6507-4 ↗
23. An Efficient Implementation of the NewHope Key Exchange on FPGAs10.1109/TCSI.2019.2956651 ↗
24. Quach, W. (2020, January 14–16). UC-Secure OT from LWE, Revisited. Proceedings of the SCN 2020: Security and Cryptography for Networks, Amalfi, Italy.10.1007/978-3-030-57990-6_10 ↗
25. Couteau, G., Rindal, P., and Raghuraman, S. (2021). Advances in Cryptology—CRYPTO 2021, Springer.
26. D’Anvers, J.-P., Karmakar, A., Roy, S.S., and Vercauteren, F. (2018). Progress in Cryptology—AFRICACRYPT 2018, Springer.
27. Wu, H., and Preneel, B. (2014). Selected Areas in Cryptography—SAC 2013, Springer.