Statistically secure linear-rate dimension extension for oblivious affine function evaluation

DOI10.1007/978-3-642-32284-6_7MaRDI QIDQ5200458zbMATH OpenOpenAlexFDO

Authors Nico Döttling, Daniel Kraschewski, Joern Mueller-Quade

Publication date 6 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32284-6_7

zbMATH Keywords

garbled arithmetic circuitsinformation-theoretic reductionsoblivious transfersecure function evaluationuniversal composability

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Oblivious transfer and n-variate linear function evaluation
• Maliciously secure oblivious linear function evaluation with constant overhead
• Two-round oblivious linear evaluation from learning with errors
• Oblivious Transfer and Linear Functions
• Improved OT extension for transferring short secrets

Cited in

(2)

• Maliciously secure oblivious linear function evaluation with constant overhead
• Oblivious transfer and n-variate linear function evaluation

This page was built for publication: Statistically secure linear-rate dimension extension for oblivious affine function evaluation

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