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

DOI10.1007/978-3-540-85093-9_19zbMath1162.94379OpenAlexW1490430515MaRDI QIDQ5502802

Takeshi Koshiba, Kaoru Kurosawa

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)

Cites Work

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