Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

DOI10.1007/978-3-540-85093-9_19zbMATH Open1162.94379OpenAlexW1490430515MaRDI QIDQ5502802FDOQ5502802

Authors Kaoru Kurosawa, Takeshi Koshiba

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_19

zbMATH Keywords

reductionoblivious transferprivacy amplificationdeterministic randomness extractor

Mathematics Subject Classification ID

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

Recommendations

• Oblivious transfer and privacy amplification
• Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• scientific article; zbMATH DE number 826067
• On the Reversibility of Oblivious Transfer

Cites work

• scientific article; zbMATH DE number 1303135 (Why is no real title available?)
• scientific article; zbMATH DE number 1418314 (Why is no real title available?)
• A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions
• All-or-nothing encryption and the package transform
• Almost \(k\)-wise independent sample spaces and their cryptologic applications
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
• Deterministic Extractors for Independent-Symbol Sources
• Exposure-resilient functions and all-or-nothing transforms
• Generalized privacy amplification
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Lower Bounds for Oblivious Transfer Reductions
• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Oblivious Transfer and Linear Functions
• Oblivious transfer and privacy amplification
• Oblivious transfers and intersecting codes
• Privacy Amplification by Public Discussion
• Probability Inequalities for Sums of Bounded Random Variables
• Simple Constructions of Almost k-wise Independent Random Variables

This page was built for publication: Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

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