Geodesic
Extending white-box cryptography based oblivious transfer protocol
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2016), pp. 40-44.

Voir la notice de l'article provenant de la source Math-Net.Ru

Secure computation platforms are becoming one of the most demanded cryptographic tools utilized in diverse applications, where the performance is critical. This point makes important the optimization of every component of secure computation systems. Oblivious Transfer (OT) is a fundamental cryptographic primitive heavily used in such protocols. Most of the OT protocols used today are based on public-key cryptography, hence their efficiency suffers heavily from the number of modular exponentiation operations done. OT extensions were introduced to reduce the number of basic OT protocol execution rounds requiring public-key cryptography operations. Recently a white-box cryptography based OT protocol (WBOT) was introduced that avoids using expensive public-key operations. In this article extension protocols for WBOT are presented, that further improve the novel approach by dramatically decreasing the protocol invocation count required.
Keywords: secure multi-party computations, oblivious transfer extensions, white-box oblivious transfer. 
@article{UZERU_2016_1_a6,
     author = {D. H. Danoyan},
     title = {Extending white-box cryptography based oblivious transfer protocol},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {40--44},
     publisher = {mathdoc},
     number = {1},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/UZERU_2016_1_a6/}
}
TY  - JOUR
AU  - D. H. Danoyan
TI  - Extending white-box cryptography based oblivious transfer protocol
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 2016
SP  - 40
EP  - 44
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/UZERU_2016_1_a6/
LA  - en
ID  - UZERU_2016_1_a6
ER  - 
%0 Journal Article
%A D. H. Danoyan
%T Extending white-box cryptography based oblivious transfer protocol
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2016
%P 40-44
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/UZERU_2016_1_a6/
%G en
%F UZERU_2016_1_a6
D. H. Danoyan. Extending white-box cryptography based oblivious transfer protocol. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2016), pp. 40-44. http://geodesic.mathdoc.fr/item/UZERU_2016_1_a6/

[1] S. Chow, P. Eisen, H. Johnson, P.C. van Oorschot, “White-Box Cryptography and an AES Implementation”, Selected Areas in Cryptography, Lecture Notes in Computer Science, 2595, 2003, 250–270 | DOI | MR | Zbl

[2] S. Chow, P. Eisen, H. Johnson, P.C. van Oorschot, “A White-Box Des Implementation for DRM Applications”, Digital Rights Management, Lecture Notes in Computer Science, 2696, 2003, 1–15 | DOI | Zbl

[3] H.E. Link, W.D. Neumann, “Clarifying Obfuscation: Improving the Security of White-Box DES”, Information Technology. “Coding and Computing, 2005”, 2005, 679–684

[4] O. Billet, H. Gilbert, C. Ech-Chatbi, “Cryptanalysis of a White Box Aes Implementation”, Selected Areas in Cryptography, Lecture Notes in Computer Science, 3357, 2004, 227–240 | DOI | MR

[5] B. Wyseur, W. Michiels, P. Gorissen, B. Preneel, “Cryptanalysis of White-Box Des Implementations with Arbitrary External Encodings”, Selected Areas in Cryptography, Lecture Notes in Computer Science, 2007, 264–277 | DOI | Zbl

[6] P. Eisen, G. Goodes, D.E. Murdock, System and Method for Generating White-Box Implementations of Software Applications, US Patent Application CA2724793 A1, 2009

[7] W. Michiels, P. Gorissen, Cryptographic Method for a White-Box Implementation, US Patent Application WO2008059420 A2, 2007

[8] A.J. Farrugia, B. Chevallier-Mames, B. Kindarji, M. Ciet, T. Icart, Cryptographic Process Execution Protecting an Input Value Against Attacks, US Patent Application US 8605894 B2, 2011

[9] M. Rabin, Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981

[10] S. Even, O. Goldreich, A. Lempel, “A Randomized Protocol for Signing Contracts”, Communications of the ACM, 28:6 (1985), 637–647 | DOI | MR

[11] G. Brassard, C. Crepeau, J.-M. Robert, “All-Or-Nothing Disclosure of Secrets”, Advances in Cryptology–CRYPTO’86, 1986, 234–238 | MR

[12] Y. Lindell, B. Pinkas, “Secure Two-Party Computation Via Cut-and-Choose Oblivious Transfer”, Journal of Cryptology, 25:4 (2012), 680–722 | DOI | MR | Zbl

[13] M. Naor, B. Pinkas, Financial Cryptography Lecture Notes in Computer Science, Lecture Notes in Computer Science, 1962, 2001, 1–20 | DOI | MR | Zbl

[14] A. Jivanyan, G. Khachatryan, A. Oliynik, “Efficient Oblivious Transfer Protocols Based on White-Box Cryptography”, AUA Internal Reports, 2013

[15] D. Malkhi, N. Nisan, B. Pinkas, Y. Sella, “Fairplay – A Secure Two-Party Computation System.”, USENIX Security Symposium, v. 4, 2004

[16] A. Yao, “How to Generate and Exchange Secrets”, Foundations of Computer Science, 27th Annual Symposium, 1986, 162–167

[17] O. Goldreich, S. Micali, A. Wigderson, “How to Play any Mental Game”, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, 218–229

[18] D. Beaver, “Correlated Pseudo-Randomness and the Complexity of Private Computations”, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, 479–488 | MR | Zbl

[19] Y. Ishai, J. Kilian, K. Nissim, E. Petrank, “Extending Oblivious Transfers Efficiently”, Advances in Cryptology–CRYPTO’2003, 2003, 145–161 | MR | Zbl

[20] G. Asharov, Y. Lindell, T. Schneider, M. Zohner, “More Efficient Oblivious Transfer and Extensions for Faster Secure Computation”, Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013, 535–548

[21] V. Kolesnikov, R. Kumaresan, “Improved OT Extension for Transferring Short Secrets”, Advances in Cryptology–CRYPTO’2013, 2013, 54–70 | MR | Zbl