Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead

DOI10.1007/978-3-319-16295-9_20MaRDI QIDQ2946485zbMATH OpenOpenAlexFDO

Authors Enrique Larraia

Publication date 17 September 2015

Published in Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-16295-9_20

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Actively secure OT extension with optimal overhead
• Advances in Cryptology - CRYPTO 2003
• More efficient oblivious transfer extensions with security for malicious adversaries
• More efficient oblivious transfer extensions
• Actively secure 1-out-of-\(N\) OT extension with application to private set intersection

Cited in

(10)

• More efficient oblivious transfer extensions
• The simplest protocol for oblivious transfer
• Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
• On the complexity of additively homomorphic UC commitments
• Extending oblivious transfer with low communication via key-homomorphic PRFs
• Actively secure OT-extension from \(q\)-ary linear codes
• More efficient oblivious transfer extensions with security for malicious adversaries
• Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
• Actively secure OT extension with optimal overhead
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946485)