8/1/2019 · Silent OT extension. We present the first concretely efficient PCG for oblivious transfer correlations. Its security is based on a variant of the binary LPN assumption and any correlation-robust hash function. We expect it to provide a faster alternative to the IKNP OT extension protocol (Crypto 2003) when communication is the bottleneck.
Two-Round Silent OT Extension. We present the firstconcretely efficienttwo-round OT extension protocol, based on a variant of the LPN assumption. The protocol has a silent preprocessing fea-ture, allowing the parties to push the bulk of the computational work to an offline phase. It can be used in two modes: either a, 11/6/2019 · This implies the first efficient 2-round OT extension protocol of any kind and , more generally, protocols for non-interactive secure computation (NISC) that are concretely efficient and have the silent preprocessing feature.
10/4/2019 · Paper by Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl presented at Crypto 2019See https://iacr.org/cryptodb/data/paper.ph…
The resulting OT extension would still require 3 rounds. Their optimized variant requires 4 exponentiations under IDDH assump-tion and their unoptimized variant requires 6 exponentiations in the PRO model. However, IDDH is not known to be reducible to the standard DDH assumption. { Silent OT extension [BCG+19] does not follow the IKNP-style …
Bibliographic details on Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. We would like to express our heartfelt thanks to the many users who have sent us their remarks and constructive critizisms via our survey during the past weeks. Your detailed comments have been very informative and extremely helpful.
PCGs enable MPC with silent preprocessing, where a small amount of interaction used for securely sampling the seeds is followed by silent local generation of correlated pseudorandomness. … and show how it can be turned into the first efficient 2-round OT extension protocol of any kind. Further, we provide efficient constructions of PCGs for a …
Two-Round Silent OT Extension. We present the ?rst concretely e?cient two-round OT extension protocol, based on a variant of the LPN assumption. The protocol has a silent pre-processingfeature ,allowingthepartiestopushthebulkofthecomputationalworktoano?ine phase. It can be used in two modes: either a random-input mode, where the communication, Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl: ePrint, ACM: PKC 2019: Non-Interactive Keyed-Verification Anonymous Credentials Geoffroy Couteau and Michael Reichle: ePrint, Springer: EUROCRYPT 2018, dom generator (PRG). This PCG follows naturally from a building block of the silent OT extension construction (as we explain in Section2). It compresses the storage cost of an authenticatedOTTTfromO( n) bitsdowntoO( logn) bit s,foratableofsizen,giving a reduction in size of over 20x for a length-256 table such as the AES S-box. There is a +
