A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions

DOI10.1109/TIT.2008.921704zbMath1328.94077OpenAlexW2141081244MaRDI QIDQ3604596

Takeshi Koshiba, Wataru Kishimoto, Kaoru Kurosawa

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.921704

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

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

This page was built for publication: A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions