Equational security proofs of oblivious transfer protocols

DOI10.1007/978-3-319-76578-5_18MaRDI QIDQ1749300zbMATH OpenOpenAlexFDO

Authors Baiyu Li, Daniele Micciancio

Publication date 16 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76578-5_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Equivocable oblivious transfer
• Efficient oblivious transfer protocols
• Oblivious Transfer and Linear Functions
• scientific article; zbMATH DE number 1302802
• scientific article; zbMATH DE number 503345

Cited in

(9)

• Formal analysis of symbolic authenticity
• Compactness vs collusion resistance in functional encryption
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Endemic oblivious transfer via random oracles, revisited
• Blazing fast OT for three-round UC OT extension
• Equivocable oblivious transfer
• ``The simplest protocol for oblivious transfer revisited
• Local XOR unification: definitions, algorithms and application to cryptography
• Robust and secure implementation: equivalence theorems

This page was built for publication: Equational security proofs of oblivious transfer protocols

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