Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Actively Secure OT Extension with Optimal Overhead

Marcel Keller, Emmanuela Orsini, Peter Schöll

Published Jan 1, 2015• 173 citations
Publisher
DOI
10.1007/978-3-662-47989-6_35

Related papers

Actively Secure OT Extension with Optimal Overhead.

Marcel Keller, Emmanuela Orsini, Peter Schöll

•Jan 1, 2015•0 citations

Actively Secure OT-Extension from q-ary Linear Codes

Ignacio Cascudo, René Bødker Christensen, Jaron Skovsted Gundersen

Lecture notes in computer science•Jan 1, 2018•4 citations

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection

Michele Orrù, Emmanuela Orsini, Peter Schöll

Lecture notes in computer science•Jan 1, 2017•88 citations

Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead

Benny Applebaum, Niv Konstantini

Lecture notes in computer science•Jan 1, 2023•10 citations

Extending Oblivious Transfer Efficiently, or - How to get active security with constant cryptographic overhead.

Enrique Larraia

Abstract. On top of the passively secure extension protocol of [IKNP03] we build a new construction secure against active adversaries. We can replace the invocation of the hash function that is used to check the receiver is well-behaved with the XOR of bit strings. This is pos-sible by applying a cut-and-choose technique on the length of the bit strings that the receiver sends in the reversed OT. We also improve on the number of seeds required for the extension, both asymptotically and practically. Moreover, the protocol used to test receiver’s behaviour en-joys unconditional security. 1

•Jan 1, 2014•6 citations

Improved OT Extension for Transferring Short Secrets

Vladimir Kolesnikov, Ranjit Kumaresan

Lecture notes in computer science•Jan 1, 2013•175 citations
Abstract. On top of the passively secure extension protocol of [IKNP03] we build a new construction secure against active adversaries. We can replace the invocation of the hash function that is used to check the receiver is well-behaved with the XOR of bit strings. This is pos-sible by applying a cut-and-choose technique on the length of the bit strings that the receiver sends in the reversed OT. We also improve on the number of seeds required for the extension, both asymptotically and practically. Moreover, the protocol used to test receiver’s behaviour en-joys unconditional security. 1