Round-Optimal Compiler for Semi-Honest to Malicious Oblivious Transfer via CIH
Authors
Varun Madathil, Alessandra Scafuro, Tanner Verber
Varun Madathil
Yale University, New Haven, USA
varun dot madathil at yale dot edu
varun dot madathil at yale dot edu
Alessandra Scafuro
North Carolina State University, Raleigh, USA
ascafur at ncsu dot edu
ascafur at ncsu dot edu
Abstract
A central question in the theory of cryptography is whether we can build protocols that achieve stronger security guarantees, e.g., security against malicious adversaries, by combining building blocks that achieve much weaker security guarantees, e.g., security only against semi-honest adversaries; and with the minimal number of rounds. An additional focus is whether these building blocks can be used only as a black-box. Since Oblivious Transfer (OT) is the necessary and sufficient building block to securely realize any two-party (and multi-party) functionality, theoreticians often focus on proving whether maliciously secure OT can be built from a weaker notion of OT.
There is a rich body of literature that provides (black-box) compilers that build malicious OT from OTs that achieve weaker security such as semi-malicious OT and defensibly secure OT, within the minimal number of rounds. However, no round-optimal compiler exists that builds malicious OT from the weakest notion of semi-honest OT, in the plain model.
Correlation intractable hash (CIH) functions are special hash functions whose properties allow instantiating the celebrated Fiat-Shamir transform, and hence reduce the round complexity of public-coin proof systems.
In this work, we devise the first round-optimal compiler from semi-honest OT to malicious OT, by a novel application of CIH for collapsing rounds in the plain model. We provide the following contributions. First, we provide a new CIH-based round-collapsing construction for general cut-and-choose. This gadget can be used generally to prove the correctness of the evaluation of a function. Then, we use our gadget to build the first round-optimal compiler from semi-honest OT to malicious OT.
Our compiler uses the semi-honest OT protocol and the other building blocks in a black-box manner. However, for technical reasons, the underlying CIH construction requires the upper bound of the circuit size of the semi-honest OT protocol used. The need for this upper-bound makes our protocol not fully black-box, hence is incomparable with existing, fully black-box, compilers.
References
[AJL+12]
Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. In David Pointcheval and Thomas Johansson, editors, Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings, volume 7237 of Lecture Notes in Computer Science, pages 483–501. 2012. Springer. DOI: 10.1007/978-3-642-29011-4_29
[BFJ+20]
Saikrishna Badrinarayanan, Rex Fernando, Aayush Jain, Dakshita Khurana, and Amit Sahai. Statistical ZAP Arguments. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part III, volume 12107 of Lecture Notes in Computer Science, pages 642–667. 2020. Springer. DOI: 10.1007/978-3-030-45727-3_22
[BKM20]
Zvika Brakerski, Venkata Koppula, and Tamer Mour. NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations. In Daniele Micciancio and Thomas Ristenpart, editors, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III, volume 12172 of Lecture Notes in Computer Science, pages 738–767. 2020. Springer. DOI: 10.1007/978-3-030-56877-1_26
[BLV06]
Boaz Barak, Yehuda Lindell, and Salil P. Vadhan. Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci., 72(2):321–391, 2006. DOI: 10.1016/J.JCSS.2005.06.010
[BR93]
Mihir Bellare and Phillip Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Dorothy E. Denning, Raymond Pyle, Ravi Ganesan, Ravi S. Sandhu, and Victoria Ashby, editors, CCS '93, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, November 3-5, 1993, pages 62–73. 1993. ACM. DOI: 10.1145/168588.168596
[CCG+21]
Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, and Rafail Ostrovsky. Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. In Kobbi Nissim and Brent Waters, editors, Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part II, volume 13043 of Lecture Notes in Computer Science, pages 518–549. 2021. Springer. DOI: 10.1007/978-3-030-90453-1_18
[CCH+18]
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, and Ron D. Rothblum. Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch., 2018.
[CCH+19]
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, and Daniel Wichs. Fiat-Shamir: from practice to theory. In Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 1082–1090. 2019. ACM. DOI: 10.1145/3313276.3316380
[CCR16]
Ran Canetti, Yilei Chen, and Leonid Reyzin. On the Correlation Intractability of Obfuscated Pseudorandom Functions. In Eyal Kushilevitz and Tal Malkin, editors, Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, volume 9562 of Lecture Notes in Computer Science, pages 389–415. 2016. Springer. DOI: 10.1007/978-3-662-49096-9_17
[CCRR18]
Ran Canetti, Yilei Chen, Leonid Reyzin, and Ron D. Rothblum. Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. In Jesper Buus Nielsen and Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I, volume 10820 of Lecture Notes in Computer Science, pages 91–122. 2018. Springer. DOI: 10.1007/978-3-319-78381-9_4
[CDMW09]
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, and Hoeteck Wee. Simple, Black-Box Constructions of Adaptively Secure Protocols. In Omer Reingold, editor, Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings, volume 5444 of Lecture Notes in Computer Science, pages 387–402. 2009. Springer. DOI: 10.1007/978-3-642-00457-5_23
[CGH98]
Ran Canetti, Oded Goldreich, and Shai Halevi. The Random Oracle Methodology, Revisited (Preliminary Version). In Jeffrey Scott Vitter, editor, Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pages 209–218. 1998. ACM. DOI: 10.1145/276698.276741
[CGH04]
Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. J. ACM, 51(4):557–594, 2004. DOI: 10.1145/1008731.1008734
[CGJ+23]
Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, and Jiaheng Zhang. Correlation Intractability and SNARGs from Sub-exponential DDH. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part IV, volume 14084 of Lecture Notes in Computer Science, pages 635–668. 2023. Springer. DOI: 10.1007/978-3-031-38551-3_20
[CJJ21a]
Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin. Non-interactive Batch Arguments for NP from Standard Assumptions. 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 IV, volume 12828 of Lecture Notes in Computer Science, pages 394–423. 2021. Springer. DOI: 10.1007/978-3-030-84259-8_14
[CJJ21b]
Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin. SNARGs for $\mathcal{P}$ from LWE. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 68–79. 2021. IEEE. DOI: 10.1109/FOCS52979.2021.00016
[COSW23]
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, and Hendrik Waldner. List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, volume 14081 of Lecture Notes in Computer Science, pages 459–488. 2023. Springer. DOI: 10.1007/978-3-031-38557-5_15
[DGH+20]
Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, and Daniel Wichs. Two-Round Oblivious Transfer from CDH or LPN. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part II, volume 12106 of Lecture Notes in Computer Science, pages 768–797. 2020. Springer. DOI: 10.1007/978-3-030-45724-2_26
[FMV19]
Daniele Friolo, Daniel Masny, and Daniele Venturi. A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement. In Dennis Hofheinz and Alon Rosen, editors, Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part I, volume 11891 of Lecture Notes in Computer Science, pages 111–130. 2019. Springer. DOI: 10.1007/978-3-030-36030-6_5
[FS86]
Amos Fiat and Adi Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Andrew M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings, volume 263 of Lecture Notes in Computer Science, pages 186–194. 1986. Springer. DOI: 10.1007/3-540-47721-7_12
[GJJM20]
Vipul Goyal, Abhishek Jain, Zhengzhong Jin, and Giulio Malavolta. Statistical Zaps and New Oblivious Transfer Protocols. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part III, volume 12107 of Lecture Notes in Computer Science, pages 668–699. 2020. Springer. DOI: 10.1007/978-3-030-45727-3_23
[GK03]
Shafi Goldwasser and Yael Tauman Kalai. On the (In)security of the Fiat-Shamir Paradigm. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 102–113. 2003. IEEE Computer Society. DOI: 10.1109/SFCS.2003.1238185
[GKR08]
Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. Delegating computation: interactive proofs for muggles. In Cynthia Dwork, editor, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pages 113–122. 2008. ACM. DOI: 10.1145/1374376.1374396
[GLOV12]
Vipul Goyal, Chen-Kuei Lee, Rafail Ostrovsky, and Ivan Visconti. Constructing Non-malleable Commitments: A Black-Box Approach. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 51–60. 2012. IEEE Computer Society. DOI: 10.1109/FOCS.2012.47
[GMW87]
Oded Goldreich, Silvio Micali, and Avi Wigderson. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Alfred V. Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pages 218–229. 1987. ACM. DOI: 10.1145/28395.28420
[GOSV14]
Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, and Ivan Visconti. Black-box non-black-box zero knowledge. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages 515–524. 2014. ACM. DOI: 10.1145/2591796.2591879
[Goy11]
Vipul Goyal. Constant round non-malleable protocols using one way functions. In Lance Fortnow and Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 695–704. 2011. ACM. DOI: 10.1145/1993636.1993729
[Hai08]
Iftach Haitner. Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. In Ran Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, volume 4948 of Lecture Notes in Computer Science, pages 412–426. 2008. Springer. DOI: 10.1007/978-3-540-78524-8_23
[HIK+11]
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, and Erez Petrank. Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput., 40(2):225–266, 2011. DOI: 10.1137/100790537
[HL18]
Justin Holmgren and Alex Lombardi. Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pages 850–858. 2018. IEEE Computer Society. DOI: 10.1109/FOCS.2018.00085
[HLR21]
Justin Holmgren, Alex Lombardi, and Ron D. Rothblum. Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 750–760. 2021. ACM. DOI: 10.1145/3406325.3451116
[IKLP06]
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, and Erez Petrank. Black-box constructions for secure computation. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pages 99–108. 2006. ACM. DOI: 10.1145/1132516.1132531
[IKOS07]
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge from secure multiparty computation. In David S. Johnson and Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pages 21–30. 2007. ACM. DOI: 10.1145/1250790.1250794
[IKSS21]
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan. On the Round Complexity of Black-Box Secure MPC. 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 214–243. 2021. Springer. DOI: 10.1007/978-3-030-84245-1_8
[IKSS22a]
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan. Round-Optimal Black-Box Protocol Compilers. In Orr Dunkelman and Stefan Dziembowski, editors, Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part I, volume 13275 of Lecture Notes in Computer Science, pages 210–240. 2022. Springer. DOI: 10.1007/978-3-031-06944-4_8
[IKSS22b]
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan. Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. In Eike Kiltz and Vinod Vaikuntanathan, editors, Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II, volume 13748 of Lecture Notes in Computer Science, pages 441–469. 2022. Springer. DOI: 10.1007/978-3-031-22365-5_16
[IKSS23]
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan. Round-Optimal Black-Box MPC in the Plain Model. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, volume 14081 of Lecture Notes in Computer Science, pages 393–426. 2023. Springer. DOI: 10.1007/978-3-031-38557-5_13
[JJ21]
Abhishek Jain and Zhengzhong Jin. Non-interactive Zero Knowledge from Sub-exponential DDH. In Anne Canteaut and François-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 I, volume 12696 of Lecture Notes in Computer Science, pages 3–32. 2021. Springer. DOI: 10.1007/978-3-030-77870-5_1
[JKKZ21]
Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, and Rachel Yun Zhang. SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 708–721. 2021. ACM. DOI: 10.1145/3406325.3451055
[Kil88]
Joe Kilian. Founding Cryptography on Oblivious Transfer. In Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 20–31. 1988. ACM. DOI: 10.1145/62212.62215
[KMO14]
Susumu Kiyoshima, Yoshifumi Manabe, and Tatsuaki Okamoto. Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. In Yehuda Lindell, editor, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings, volume 8349 of Lecture Notes in Computer Science, pages 343–367. 2014. Springer. DOI: 10.1007/978-3-642-54242-8_15
[KO04]
Jonathan Katz and Rafail Ostrovsky. Round-Optimal Secure Two-Party Computation. In Matthew K. Franklin, editor, Advances in Cryptology - CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings, volume 3152 of Lecture Notes in Computer Science, pages 335–354. 2004. Springer. DOI: 10.1007/978-3-540-28628-8_21
[KRR17]
Yael Tauman Kalai, Guy N. Rothblum, and Ron D. Rothblum. From Obfuscation to the Security of Fiat-Shamir for Proofs. In Jonathan Katz and Hovav Shacham, editors, Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part II, volume 10402 of Lecture Notes in Computer Science, pages 224–251. 2017. Springer. DOI: 10.1007/978-3-319-63715-0_8
[Lin13]
Yehuda Lindell. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II, volume 8043 of Lecture Notes in Computer Science, pages 1–17. 2013. Springer. DOI: 10.1007/978-3-642-40084-1_1
[LP07]
Yehuda Lindell and Benny Pinkas. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In Moni Naor, editor, Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, volume 4515 of Lecture Notes in Computer Science, pages 52–78. 2007. Springer. DOI: 10.1007/978-3-540-72540-4_4
[LP12]
Huijia Lin and Rafael Pass. Black-Box Constructions of Composable Protocols without Set-Up. In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, volume 7417 of Lecture Notes in Computer Science, pages 461–478. 2012. Springer. DOI: 10.1007/978-3-642-32009-5_27
[LV22]
Alex Lombardi and Vinod Vaikuntanathan. Correlation-Intractable Hash Functions via Shift-Hiding. In Mark Braverman, editor, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, volume 215 of LIPIcs, pages 102:1–102:16. 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. DOI: 10.4230/LIPIcs.ITCS.2022.102
[MOSV22]
Varun Madathil, Chris Orsini, Alessandra Scafuro, and Daniele Venturi. From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic. In Dana Dachman-Soled, editor, 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA, volume 230 of LIPIcs, pages 5:1–5:20. 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. DOI: 10.4230/LIPIcs.ITC.2022.5
[ORS15]
Rafail Ostrovsky, Silas Richelson, and Alessandra Scafuro. Round-Optimal Black-Box Two-Party Computation. In Rosario Gennaro and Matthew Robshaw, editors, Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II, volume 9216 of Lecture Notes in Computer Science, pages 339–358. 2015. Springer. DOI: 10.1007/978-3-662-48000-7_17
[PS18]
Chris Peikert and Sina Shiehian. Privately Constraining and Programming PRFs, the LWE Way. In Michel Abdalla and Ricardo Dahab, editors, Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part II, volume 10770 of Lecture Notes in Computer Science, pages 675–701. 2018. Springer. DOI: 10.1007/978-3-319-76581-5_23
[PS19]
Chris Peikert and Sina Shiehian. Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I, volume 11692 of Lecture Notes in Computer Science, pages 89–114. 2019. Springer. DOI: 10.1007/978-3-030-26948-7_4
[PW09]
Rafael Pass and Hoeteck Wee. Black-Box Constructions of Two-Party Protocols from One-Way Functions. In Omer Reingold, editor, Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings, volume 5444 of Lecture Notes in Computer Science, pages 403–418. 2009. Springer. DOI: 10.1007/978-3-642-00457-5_24
[Rab05]
Michael O. Rabin. How To Exchange Secrets with Oblivious Transfer. IACR Cryptol. ePrint Arch., 2005.
[Wee10]
Hoeteck Wee. Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, pages 531–540. 2010. IEEE Computer Society. DOI: 10.1109/FOCS.2010.87
PDF
History
Submitted: 2024-10-08
Accepted: 2024-12-03
Published: 2025-01-13
Accepted: 2024-12-03
Published: 2025-01-13
How to cite
Varun Madathil, Alessandra Scafuro, and Tanner Verber, Round-Optimal Compiler for Semi-Honest to Malicious Oblivious Transfer via CIH. IACR Communications in Cryptology, vol. 1, no. 4, Jan 13, 2025, doi: 10.62056/abe0wa3y6.
License
Copyright is held by the author(s)
This work is licensed under a Creative Commons Attribution (CC BY) license.