Oblivious Transfer Based on the McEliece Assumptions

DOI10.1007/978-3-540-85093-9_11zbMath1162.94353OpenAlexW1498297643MaRDI QIDQ5502796

Jeroen van de Graaf, Anderson C. A. Nascimento, Rafael Dowsley, Jörn Müller-Quade

Publication date: 9 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_11

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Related Items

Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Secure two-party computation in a quantum world ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security

Cites Work

• Semantic security for the McEliece cryptosystem without random oracles
• An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
• On the inherent intractability of certain coding problems (Corresp.)
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Foundations of Cryptography
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item