6 days ago · Their security could be compromised if any of the underlying assumptions or problems are proven to be solvable efficiently by future advancements in quan- tum ...

Jun 21, 2024 · Hence, there exists no (efficient) unconditionally secure OT that does not use noisy channels, multi-server, and fully trusted initializer.

Apr 25, 2024 · Efficient Fully Simulatable Oblivious Transfer from the McEliece Assumptions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(11): 2059-2066 (2012).

Aug 10, 2023 · Efficient fully simulatable oblivious transfer from the McEliece assumptions. In: IEEE Information Theory Workshop (ITW), 2011. QUELHO, R. T. M. ; Bernardo ...

Sep 14, 2023 · Bernardo David, Anderson C. A. Nascimento. Efficient fully simulatable oblivious transfer from the McEliece assumptions. IEEE Information Theory Workshop (ITW),.

Apr 9, 2024 · ... oblivious transfer protocol described by Lai et al. (Eurocrypt 2021), hence providing the first concretely efficient two-message isogeny-based OT protocol ...

Sep 15, 2023 · Concretely and first, we present the first efficient UC-secure oblivious transfer using only a constant number of isogeny computations based on the group action ...

Apr 29, 2024 · Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any ...

Mar 25, 2024 · In this presentation, we will first discuss a general recipe for PCGs, studying the important special case of the oblivious transfer (OT) correlation. We ...

Sep 5, 2023 · Efficient fully-simulatable oblivious transfer. In: Proc. of the ... Universally composable oblivious transfer from lossy encryption and the mceliece assumptions.